/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/benchmark26_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:44:25,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:44:25,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:44:25,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:44:25,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:44:25,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:44:25,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:44:25,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:44:25,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:44:25,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:44:25,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:44:25,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:44:25,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:44:25,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:44:25,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:44:25,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:44:25,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:44:25,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:44:25,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:44:25,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:44:25,687 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:44:25,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:44:25,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:44:25,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:44:25,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:44:25,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:44:25,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:44:25,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:44:25,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:44:25,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:44:25,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:44:25,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:44:25,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:44:25,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:44:25,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:44:25,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:44:25,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:44:25,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:44:25,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:44:25,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:44:25,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:44:25,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:44:25,712 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-27 11:44:25,730 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:44:25,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:44:25,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:44:25,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:44:25,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:44:25,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:44:25,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:44:25,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:44:25,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:44:25,733 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:44:25,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:44:25,733 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:44:25,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:44:25,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:44:25,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:44:25,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:44:25,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:25,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:44:25,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:44:25,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:44:25,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:44:25,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:44:25,734 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:44:25,734 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:44:25,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:44:25,734 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-27 11:44:25,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:44:25,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:44:25,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:44:25,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:44:25,910 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:44:25,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark26_linear.i [2022-04-27 11:44:25,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1f9afbc/a99d1f98852c40368875669c0b09de1c/FLAGbaa951e52 [2022-04-27 11:44:26,292 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:44:26,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i [2022-04-27 11:44:26,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1f9afbc/a99d1f98852c40368875669c0b09de1c/FLAGbaa951e52 [2022-04-27 11:44:26,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1f9afbc/a99d1f98852c40368875669c0b09de1c [2022-04-27 11:44:26,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:44:26,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:44:26,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:26,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:44:26,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:44:26,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@acde6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26, skipping insertion in model container [2022-04-27 11:44:26,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:44:26,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:44:26,439 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/benchmark26_linear.i[868,881] [2022-04-27 11:44:26,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:26,460 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:44:26,471 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/benchmark26_linear.i[868,881] [2022-04-27 11:44:26,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:26,481 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:44:26,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26 WrapperNode [2022-04-27 11:44:26,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:26,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:44:26,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:44:26,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:44:26,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:44:26,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:44:26,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:44:26,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:44:26,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (1/1) ... [2022-04-27 11:44:26,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:26,541 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-27 11:44:26,557 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-27 11:44:26,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:44:26,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:44:26,569 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:44:26,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:44:26,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:44:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:44:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:44:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:44:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:44:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:44:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:44:26,619 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:44:26,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:44:26,689 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:44:26,700 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:44:26,701 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:44:26,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:26 BoogieIcfgContainer [2022-04-27 11:44:26,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:44:26,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:44:26,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:44:26,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:44:26,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:44:26" (1/3) ... [2022-04-27 11:44:26,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a471a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:26, skipping insertion in model container [2022-04-27 11:44:26,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:26" (2/3) ... [2022-04-27 11:44:26,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a471a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:26, skipping insertion in model container [2022-04-27 11:44:26,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:26" (3/3) ... [2022-04-27 11:44:26,709 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark26_linear.i [2022-04-27 11:44:26,720 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:44:26,720 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:44:26,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:44:26,759 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10a916ce, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23f7f72e [2022-04-27 11:44:26,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:44:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:44:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:44:26,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:26,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:26,781 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-27 11:44:26,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:26,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785522801] [2022-04-27 11:44:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:26,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {23#true} is VALID [2022-04-27 11:44:26,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:44:26,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:44:26,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:26,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {23#true} is VALID [2022-04-27 11:44:26,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:44:26,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:44:26,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-27 11:44:26,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#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; {23#true} is VALID [2022-04-27 11:44:26,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~x~0 < ~y~0); {28#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-27 11:44:26,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~x~0 1) main_~y~0)} assume !(~x~0 < ~y~0); {24#false} is VALID [2022-04-27 11:44:26,935 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1 else 0)); {24#false} is VALID [2022-04-27 11:44:26,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 11:44:26,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:44:26,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:44:26,936 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-27 11:44:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:26,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785522801] [2022-04-27 11:44:26,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785522801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:26,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:26,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:44:26,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493076215] [2022-04-27 11:44:26,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:26,942 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-27 11:44:26,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:26,945 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-27 11:44:26,957 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-27 11:44:26,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:44:26,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:44:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:44:26,985 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:27,095 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 11:44:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:44:27,096 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-27 11:44:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:27,096 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-27 11:44:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-27 11:44:27,109 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-27 11:44:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-27 11:44:27,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-27 11:44:27,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:27,174 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:44:27,174 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:44:27,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:44:27,183 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:27,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:44:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:44:27,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:27,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:27,216 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:27,216 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:27,220 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:27,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:27,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:27,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:44:27,221 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:44:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:27,224 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:27,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:27,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:27,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:27,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 11:44:27,227 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 11:44:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:27,228 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 11:44:27,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:44:27,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:27,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:27,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:44:27,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:27,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-27 11:44:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:27,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939666239] [2022-04-27 11:44:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:27,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:27,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#(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(21, 2); {127#true} is VALID [2022-04-27 11:44:27,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:27,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:27,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:27,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#(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(21, 2); {127#true} is VALID [2022-04-27 11:44:27,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:27,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:27,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret3 := main(); {127#true} is VALID [2022-04-27 11:44:27,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#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; {127#true} is VALID [2022-04-27 11:44:27,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!(~x~0 < ~y~0); {132#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-27 11:44:27,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(<= (+ main_~x~0 1) main_~y~0)} assume !!(~x~0 < ~y~0);~x~0 := 1 + ~x~0; {133#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-27 11:44:27,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(< main_~x~0 (+ main_~y~0 1))} assume !(~x~0 < ~y~0); {134#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 11:44:27,368 INFO L272 TraceCheckUtils]: 9: Hoare triple {134#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1 else 0)); {135#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:44:27,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {136#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:44:27,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {136#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:27,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:27,369 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-27 11:44:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939666239] [2022-04-27 11:44:27,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939666239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:44:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595434617] [2022-04-27 11:44:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:27,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:27,373 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-27 11:44:27,374 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-27 11:44:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:27,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:44:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:27,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:44:27,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-27 11:44:27,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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(21, 2); {127#true} is VALID [2022-04-27 11:44:27,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:27,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:27,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret3 := main(); {127#true} is VALID [2022-04-27 11:44:27,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#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; {127#true} is VALID [2022-04-27 11:44:27,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!(~x~0 < ~y~0); {132#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-27 11:44:27,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(<= (+ main_~x~0 1) main_~y~0)} assume !!(~x~0 < ~y~0);~x~0 := 1 + ~x~0; {133#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-27 11:44:27,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(< main_~x~0 (+ main_~y~0 1))} assume !(~x~0 < ~y~0); {134#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 11:44:27,770 INFO L272 TraceCheckUtils]: 9: Hoare triple {134#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1 else 0)); {168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:27,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:27,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:27,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:27,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-27 11:44:27,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:44:27,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:27,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:27,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:27,880 INFO L272 TraceCheckUtils]: 9: Hoare triple {134#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1 else 0)); {168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:27,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(< main_~x~0 (+ main_~y~0 1))} assume !(~x~0 < ~y~0); {134#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 11:44:27,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(<= (+ main_~x~0 1) main_~y~0)} assume !!(~x~0 < ~y~0);~x~0 := 1 + ~x~0; {133#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-27 11:44:27,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!(~x~0 < ~y~0); {132#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-27 11:44:27,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#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; {127#true} is VALID [2022-04-27 11:44:27,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret3 := main(); {127#true} is VALID [2022-04-27 11:44:27,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:27,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:27,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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(21, 2); {127#true} is VALID [2022-04-27 11:44:27,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-27 11:44:27,888 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-27 11:44:27,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595434617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:44:27,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:44:27,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-27 11:44:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425940676] [2022-04-27 11:44:27,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:44:27,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 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 13 [2022-04-27 11:44:27,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:27,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 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-27 11:44:27,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:27,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:44:27,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:27,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:44:27,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:44:27,908 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 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-27 11:44:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:28,020 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:44:28,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 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 13 [2022-04-27 11:44:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 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-27 11:44:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-27 11:44:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 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-27 11:44:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-27 11:44:28,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2022-04-27 11:44:28,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:28,053 INFO L225 Difference]: With dead ends: 14 [2022-04-27 11:44:28,053 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:44:28,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:44:28,055 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:28,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:44:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:44:28,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:28,058 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-27 11:44:28,058 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-27 11:44:28,058 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-27 11:44:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:28,059 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:28,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:28,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:28,059 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-27 11:44:28,059 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-27 11:44:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:28,059 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:28,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:28,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:28,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:28,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:28,060 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-27 11:44:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:44:28,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 11:44:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:28,063 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:44:28,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 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-27 11:44:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:28,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:28,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:44:28,086 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-27 11:44:28,275 WARN L477 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-27 11:44:28,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:44:28,298 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-27 11:44:28,298 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-27 11:44:28,298 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:44:28,298 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 28) the Hoare annotation is: true [2022-04-27 11:44:28,298 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 11:44:28,299 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 28) no Hoare annotation was computed. [2022-04-27 11:44:28,299 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-27 11:44:28,299 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 25) the Hoare annotation is: (< main_~x~0 (+ main_~y~0 1)) [2022-04-27 11:44:28,299 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 25) the Hoare annotation is: (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)) [2022-04-27 11:44:28,299 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 28) no Hoare annotation was computed. [2022-04-27 11:44:28,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:28,299 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:44:28,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:28,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:28,299 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:44:28,299 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:44:28,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:28,300 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:44:28,300 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:44:28,300 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 11:44:28,300 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:28,300 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:28,300 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 11:44:28,302 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 11:44:28,303 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:44:28,306 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:28,306 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:28,306 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:28,307 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:44:28,307 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:28,307 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:44:28,307 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:28,307 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:28,308 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:44:28,308 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:44:28,308 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:28,308 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:28,308 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:44:28,308 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:28,308 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:44:28,310 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:28,310 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:28,310 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:44:28,311 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:44:28,322 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:44:28,322 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:44:28,322 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:44:28,322 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:44:28,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:44:28 BoogieIcfgContainer [2022-04-27 11:44:28,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:44:28,328 INFO L158 Benchmark]: Toolchain (without parser) took 2022.17ms. Allocated memory was 200.3MB in the beginning and 274.7MB in the end (delta: 74.4MB). Free memory was 149.2MB in the beginning and 252.2MB in the end (delta: -103.0MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. [2022-04-27 11:44:28,332 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:28,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.09ms. Allocated memory is still 200.3MB. Free memory was 148.9MB in the beginning and 175.9MB in the end (delta: -26.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 11:44:28,335 INFO L158 Benchmark]: Boogie Preprocessor took 16.24ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 174.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:44:28,335 INFO L158 Benchmark]: RCFGBuilder took 201.61ms. Allocated memory is still 200.3MB. Free memory was 174.3MB in the beginning and 163.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 11:44:28,335 INFO L158 Benchmark]: TraceAbstraction took 1623.93ms. Allocated memory was 200.3MB in the beginning and 274.7MB in the end (delta: 74.4MB). Free memory was 162.8MB in the beginning and 252.2MB in the end (delta: -89.4MB). Peak memory consumption was 99.2MB. Max. memory is 8.0GB. [2022-04-27 11:44:28,336 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.09ms. Allocated memory is still 200.3MB. Free memory was 148.9MB in the beginning and 175.9MB in the end (delta: -26.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.24ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 174.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 201.61ms. Allocated memory is still 200.3MB. Free memory was 174.3MB in the beginning and 163.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1623.93ms. Allocated memory was 200.3MB in the beginning and 274.7MB in the end (delta: 74.4MB). Free memory was 162.8MB in the beginning and 252.2MB in the end (delta: -89.4MB). Peak memory consumption was 99.2MB. 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 27 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 8 PreInvPairs, 10 NumberOfFragments, 25 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 125 SizeOfPredicates, 3 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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: 23]: Loop Invariant Derived loop invariant: x < y + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:44:28,360 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...