/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/benchmark32_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:44:30,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:44:30,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:44:30,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:44:30,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:44:30,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:44:30,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:44:30,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:44:30,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:44:30,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:44:30,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:44:30,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:44:30,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:44:30,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:44:30,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:44:30,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:44:30,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:44:30,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:44:30,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:44:30,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:44:30,809 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:44:30,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:44:30,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:44:30,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:44:30,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:44:30,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:44:30,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:44:30,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:44:30,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:44:30,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:44:30,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:44:30,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:44:30,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:44:30,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:44:30,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:44:30,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:44:30,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:44:30,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:44:30,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:44:30,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:44:30,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:44:30,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:44:30,823 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:30,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:44:30,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:44:30,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:44:30,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:44:30,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:44:30,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:44:30,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:44:30,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:44:30,844 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:44:30,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:44:30,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:44:30,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:44:30,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:44:30,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:44:30,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:44:30,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:44:30,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:44:30,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:44:30,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:30,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:44:30,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:44:30,848 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:44:30,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:44:30,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:44:30,848 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:31,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:44:31,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:44:31,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:44:31,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:44:31,045 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:44:31,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark32_linear.i [2022-04-27 11:44:31,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3f8cb3e/a53a490ee80e4c58859818ed94458586/FLAGb77bf1cb8 [2022-04-27 11:44:31,434 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:44:31,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark32_linear.i [2022-04-27 11:44:31,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3f8cb3e/a53a490ee80e4c58859818ed94458586/FLAGb77bf1cb8 [2022-04-27 11:44:31,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3f8cb3e/a53a490ee80e4c58859818ed94458586 [2022-04-27 11:44:31,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:44:31,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:44:31,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:31,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:44:31,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:44:31,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:31" (1/1) ... [2022-04-27 11:44:31,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f42090d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:31, skipping insertion in model container [2022-04-27 11:44:31,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:31" (1/1) ... [2022-04-27 11:44:31,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:44:31,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:44:31,627 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/benchmark32_linear.i[868,881] [2022-04-27 11:44:31,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:31,655 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:44:31,665 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/benchmark32_linear.i[868,881] [2022-04-27 11:44:31,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:31,679 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:44:31,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:31 WrapperNode [2022-04-27 11:44:31,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:31,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:44:31,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:44:31,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:44:31,687 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:31" (1/1) ... [2022-04-27 11:44:31,687 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:31" (1/1) ... [2022-04-27 11:44:31,692 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:31" (1/1) ... [2022-04-27 11:44:31,692 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:31" (1/1) ... [2022-04-27 11:44:31,698 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:31" (1/1) ... [2022-04-27 11:44:31,703 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:31" (1/1) ... [2022-04-27 11:44:31,707 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:31" (1/1) ... [2022-04-27 11:44:31,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:44:31,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:44:31,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:44:31,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:44:31,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:31" (1/1) ... [2022-04-27 11:44:31,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:31,732 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:31,746 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:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:44:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:44:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:44:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:44:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:44:31,761 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:44:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:44:31,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:44:31,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:44:31,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:44:31,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:44:31,806 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:44:31,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:44:31,935 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:44:31,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:44:31,939 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:44:31,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:31 BoogieIcfgContainer [2022-04-27 11:44:31,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:44:31,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:44:31,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:44:31,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:44:31,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:44:31" (1/3) ... [2022-04-27 11:44:31,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c4d561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:31, skipping insertion in model container [2022-04-27 11:44:31,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:31" (2/3) ... [2022-04-27 11:44:31,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c4d561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:31, skipping insertion in model container [2022-04-27 11:44:31,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:31" (3/3) ... [2022-04-27 11:44:31,945 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark32_linear.i [2022-04-27 11:44:31,953 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:44:31,953 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:44:31,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:44:31,999 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@71d5c690, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@51c41253 [2022-04-27 11:44:31,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:44:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:44:32,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:32,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:32,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash -35238852, now seen corresponding path program 1 times [2022-04-27 11:44:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:32,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176746050] [2022-04-27 11:44:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:32,165 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(21, 2); {25#true} is VALID [2022-04-27 11:44:32,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:44:32,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-27 11:44:32,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:32,170 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(21, 2); {25#true} is VALID [2022-04-27 11:44:32,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:44:32,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-27 11:44:32,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-27 11:44:32,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-27 11:44:32,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(1 == ~x~0 || 2 == ~x~0); {25#true} is VALID [2022-04-27 11:44:32,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 11:44:32,172 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~x~0 <= 8 then 1 else 0)); {26#false} is VALID [2022-04-27 11:44:32,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 11:44:32,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 11:44:32,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 11:44:32,173 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:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176746050] [2022-04-27 11:44:32,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176746050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:32,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:32,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:44:32,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452071834] [2022-04-27 11:44:32,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:32,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:32,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:32,203 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:32,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:44:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:44:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:44:32,221 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:32,292 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 11:44:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:44:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 11:44:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 11:44:32,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-27 11:44:32,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:32,360 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:44:32,361 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:44:32,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:44:32,366 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:32,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:44:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:44:32,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:32,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:32,390 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:32,390 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:32,397 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 11:44:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 11:44:32,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:32,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:32,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-27 11:44:32,400 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-27 11:44:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:32,403 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 11:44:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 11:44:32,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:32,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:32,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:32,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-27 11:44:32,410 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-04-27 11:44:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:32,411 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-27 11:44:32,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 11:44:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:44:32,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:32,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:32,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:44:32,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -49091667, now seen corresponding path program 1 times [2022-04-27 11:44:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:32,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045266307] [2022-04-27 11:44:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:32,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#(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); {128#true} is VALID [2022-04-27 11:44:32,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} assume true; {128#true} is VALID [2022-04-27 11:44:32,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128#true} {128#true} #56#return; {128#true} is VALID [2022-04-27 11:44:32,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {128#true} call ULTIMATE.init(); {136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:32,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#(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); {128#true} is VALID [2022-04-27 11:44:32,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2022-04-27 11:44:32,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #56#return; {128#true} is VALID [2022-04-27 11:44:32,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret3 := main(); {128#true} is VALID [2022-04-27 11:44:32,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {128#true} is VALID [2022-04-27 11:44:32,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#true} assume !!(1 == ~x~0 || 2 == ~x~0); {133#(<= main_~x~0 2)} is VALID [2022-04-27 11:44:32,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(<= main_~x~0 2)} assume !(0 != #t~nondet2 % 256);havoc #t~nondet2; {133#(<= main_~x~0 2)} is VALID [2022-04-27 11:44:32,545 INFO L272 TraceCheckUtils]: 8: Hoare triple {133#(<= main_~x~0 2)} call __VERIFIER_assert((if ~x~0 <= 8 then 1 else 0)); {134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:44:32,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {135#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:44:32,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {129#false} is VALID [2022-04-27 11:44:32,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#false} assume !false; {129#false} is VALID [2022-04-27 11:44:32,546 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:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:32,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045266307] [2022-04-27 11:44:32,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045266307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:32,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:32,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:44:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312990170] [2022-04-27 11:44:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:32,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:32,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:32,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:32,563 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:32,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:44:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:32,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:44:32,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:44:32,565 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:32,678 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 11:44:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:44:32,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-27 11:44:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-27 11:44:32,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-27 11:44:32,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:32,696 INFO L225 Difference]: With dead ends: 15 [2022-04-27 11:44:32,696 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:44:32,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:44:32,701 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:32,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:44:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:44:32,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:32,703 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:32,704 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:32,704 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:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:32,704 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:32,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:32,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:32,705 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:32,705 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:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:32,705 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:32,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:32,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:32,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:32,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:32,705 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:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:44:32,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 11:44:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:32,706 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:44:32,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:32,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:32,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:44:32,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:44:32,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:44:32,727 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-27 11:44:32,727 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-27 11:44:32,728 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:44:32,728 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 28) no Hoare annotation was computed. [2022-04-27 11:44:32,728 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 24) no Hoare annotation was computed. [2022-04-27 11:44:32,728 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-04-27 11:44:32,728 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 28) no Hoare annotation was computed. [2022-04-27 11:44:32,728 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 28) the Hoare annotation is: true [2022-04-27 11:44:32,728 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 11:44:32,728 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-04-27 11:44:32,729 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 22 25) the Hoare annotation is: (<= main_~x~0 2) [2022-04-27 11:44:32,729 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 25) the Hoare annotation is: (<= main_~x~0 2) [2022-04-27 11:44:32,729 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:32,729 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:32,729 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:32,729 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:32,729 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:44:32,730 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:44:32,730 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:32,730 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:44:32,730 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:44:32,730 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 11:44:32,730 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:32,730 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:32,730 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 11:44:32,732 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 11:44:32,734 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:44:32,739 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:32,739 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:32,739 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:32,740 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:44:32,740 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:32,740 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:44:32,741 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:32,743 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:32,743 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:44:32,743 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:44:32,745 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:32,745 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:32,745 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:44:32,745 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:32,745 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:44:32,746 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:32,746 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:32,746 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:32,746 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:44:32,747 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:44:32,747 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:44:32,747 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:32,747 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:32,747 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:44:32,747 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:44:32,747 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 11:44:32,747 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 11:44:32,747 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-27 11:44:32,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:44:32 BoogieIcfgContainer [2022-04-27 11:44:32,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:44:32,754 INFO L158 Benchmark]: Toolchain (without parser) took 1300.18ms. Allocated memory was 195.0MB in the beginning and 244.3MB in the end (delta: 49.3MB). Free memory was 145.8MB in the beginning and 212.5MB in the end (delta: -66.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:32,754 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 195.0MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:32,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.78ms. Allocated memory is still 195.0MB. Free memory was 145.6MB in the beginning and 170.6MB in the end (delta: -25.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-04-27 11:44:32,758 INFO L158 Benchmark]: Boogie Preprocessor took 30.41ms. Allocated memory is still 195.0MB. Free memory was 170.6MB in the beginning and 169.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:44:32,758 INFO L158 Benchmark]: RCFGBuilder took 229.78ms. Allocated memory is still 195.0MB. Free memory was 169.1MB in the beginning and 159.0MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 11:44:32,758 INFO L158 Benchmark]: TraceAbstraction took 811.58ms. Allocated memory was 195.0MB in the beginning and 244.3MB in the end (delta: 49.3MB). Free memory was 158.6MB in the beginning and 212.5MB in the end (delta: -53.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:32,759 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.23ms. Allocated memory is still 195.0MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.78ms. Allocated memory is still 195.0MB. Free memory was 145.6MB in the beginning and 170.6MB in the end (delta: -25.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.41ms. Allocated memory is still 195.0MB. Free memory was 170.6MB in the beginning and 169.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 229.78ms. Allocated memory is still 195.0MB. Free memory was 169.1MB in the beginning and 159.0MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 811.58ms. Allocated memory was 195.0MB in the beginning and 244.3MB in the end (delta: 49.3MB). Free memory was 158.6MB in the beginning and 212.5MB in the end (delta: -53.9MB). There was no memory consumed. 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 34 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 9 NumberOfFragments, 17 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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: 22]: Loop Invariant Derived loop invariant: x <= 2 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:44:32,785 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...