/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/benchmark20_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:44:15,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:44:15,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:44:15,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:44:15,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:44:15,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:44:15,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:44:15,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:44:15,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:44:15,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:44:15,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:44:15,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:44:15,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:44:15,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:44:15,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:44:15,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:44:15,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:44:15,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:44:15,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:44:15,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:44:15,116 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:44:15,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:44:15,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:44:15,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:44:15,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:44:15,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:44:15,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:44:15,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:44:15,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:44:15,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:44:15,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:44:15,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:44:15,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:44:15,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:44:15,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:44:15,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:44:15,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:44:15,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:44:15,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:44:15,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:44:15,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:44:15,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:44:15,130 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:15,149 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:44:15,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:44:15,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:44:15,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:44:15,150 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:44:15,151 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:44:15,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:44:15,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:44:15,151 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:44:15,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:44:15,152 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:44:15,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:44:15,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:44:15,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:44:15,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:44:15,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:44:15,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:44:15,153 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:44:15,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:44:15,153 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:44:15,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:44:15,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:44:15,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:15,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:44:15,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:44:15,154 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:15,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:44:15,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:44:15,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:44:15,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:44:15,326 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:44:15,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-27 11:44:15,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31cc5dc7/f10c00289a5c411aaaed01300137cb8e/FLAG7f6c8f9b8 [2022-04-27 11:44:15,736 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:44:15,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-27 11:44:15,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31cc5dc7/f10c00289a5c411aaaed01300137cb8e/FLAG7f6c8f9b8 [2022-04-27 11:44:15,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31cc5dc7/f10c00289a5c411aaaed01300137cb8e [2022-04-27 11:44:15,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:44:15,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:44:15,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:15,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:44:15,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:44:15,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:15" (1/1) ... [2022-04-27 11:44:15,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd716ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:15, skipping insertion in model container [2022-04-27 11:44:15,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:15" (1/1) ... [2022-04-27 11:44:15,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:44:15,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:44:15,914 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/benchmark20_conjunctive.i[873,886] [2022-04-27 11:44:15,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:15,939 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:44:15,948 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/benchmark20_conjunctive.i[873,886] [2022-04-27 11:44:15,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:15,964 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:44:15,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:15 WrapperNode [2022-04-27 11:44:15,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:15,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:44:15,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:44:15,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:44:15,972 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:15" (1/1) ... [2022-04-27 11:44:15,972 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:15" (1/1) ... [2022-04-27 11:44:15,976 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:15" (1/1) ... [2022-04-27 11:44:15,977 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:15" (1/1) ... [2022-04-27 11:44:15,984 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:15" (1/1) ... [2022-04-27 11:44:15,989 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:15" (1/1) ... [2022-04-27 11:44:15,990 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:15" (1/1) ... [2022-04-27 11:44:15,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:44:15,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:44:15,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:44:15,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:44:15,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:15" (1/1) ... [2022-04-27 11:44:16,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:16,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:16,022 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:16,036 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:16,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:44:16,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:44:16,059 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:44:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:44:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:44:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:44:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:44:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:44:16,121 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:44:16,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:44:16,255 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:44:16,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:44:16,259 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:44:16,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:16 BoogieIcfgContainer [2022-04-27 11:44:16,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:44:16,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:44:16,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:44:16,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:44:16,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:44:15" (1/3) ... [2022-04-27 11:44:16,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bca8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:16, skipping insertion in model container [2022-04-27 11:44:16,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:15" (2/3) ... [2022-04-27 11:44:16,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bca8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:16, skipping insertion in model container [2022-04-27 11:44:16,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:16" (3/3) ... [2022-04-27 11:44:16,266 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark20_conjunctive.i [2022-04-27 11:44:16,274 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:44:16,275 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:44:16,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:44:16,318 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@15ce5c4b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40df380 [2022-04-27 11:44:16,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:44:16,323 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:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:44:16,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:16,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:16,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:16,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-27 11:44:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:16,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642352138] [2022-04-27 11:44:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:16,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-27 11:44:16,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:44:16,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:44:16,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:16,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-27 11:44:16,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:44:16,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:44:16,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-27 11:44:16,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-27 11:44:16,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {28#(<= 0 main_~sum~0)} is VALID [2022-04-27 11:44:16,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {28#(<= 0 main_~sum~0)} is VALID [2022-04-27 11:44:16,567 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:44:16,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:44:16,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:44:16,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:44:16,568 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:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:16,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642352138] [2022-04-27 11:44:16,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642352138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:16,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:16,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:44:16,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291212433] [2022-04-27 11:44:16,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:16,575 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:16,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:16,578 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:16,592 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:16,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:44:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:16,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:44:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:44:16,611 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 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:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:16,862 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-27 11:44:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:44:16,862 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:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:16,863 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:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-27 11:44:16,869 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:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-27 11:44:16,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-27 11:44:16,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:16,916 INFO L225 Difference]: With dead ends: 41 [2022-04-27 11:44:16,916 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:44:16,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:44:16,921 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:16,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:44:16,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:44:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:44:16,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:16,949 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:16,949 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:16,949 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:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:16,951 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:16,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:16,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:16,951 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:16,952 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:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:16,953 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:16,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:16,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:16,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:16,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:16,954 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:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 11:44:16,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 11:44:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:16,955 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 11:44:16,956 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:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:44:16,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:16,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:16,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:44:16,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-27 11:44:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:16,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163873899] [2022-04-27 11:44:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:17,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {145#true} is VALID [2022-04-27 11:44:17,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 11:44:17,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145#true} {145#true} #45#return; {145#true} is VALID [2022-04-27 11:44:17,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {145#true} call ULTIMATE.init(); {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:17,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {145#true} is VALID [2022-04-27 11:44:17,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 11:44:17,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145#true} {145#true} #45#return; {145#true} is VALID [2022-04-27 11:44:17,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {145#true} call #t~ret5 := main(); {145#true} is VALID [2022-04-27 11:44:17,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {145#true} is VALID [2022-04-27 11:44:17,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {150#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-27 11:44:17,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {150#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {151#(<= 0 main_~sum~0)} is VALID [2022-04-27 11:44:17,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {151#(<= 0 main_~sum~0)} is VALID [2022-04-27 11:44:17,030 INFO L272 TraceCheckUtils]: 9: Hoare triple {151#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:44:17,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {153#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:44:17,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {146#false} is VALID [2022-04-27 11:44:17,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#false} assume !false; {146#false} is VALID [2022-04-27 11:44:17,031 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:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:17,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163873899] [2022-04-27 11:44:17,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163873899] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:44:17,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307264856] [2022-04-27 11:44:17,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:17,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:17,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:17,036 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:17,037 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:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:17,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:44:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:17,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:44:17,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {145#true} call ULTIMATE.init(); {145#true} is VALID [2022-04-27 11:44:17,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {145#true} is VALID [2022-04-27 11:44:17,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 11:44:17,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145#true} {145#true} #45#return; {145#true} is VALID [2022-04-27 11:44:17,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {145#true} call #t~ret5 := main(); {145#true} is VALID [2022-04-27 11:44:17,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {145#true} is VALID [2022-04-27 11:44:17,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {176#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-27 11:44:17,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {176#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {151#(<= 0 main_~sum~0)} is VALID [2022-04-27 11:44:17,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {151#(<= 0 main_~sum~0)} is VALID [2022-04-27 11:44:17,230 INFO L272 TraceCheckUtils]: 9: Hoare triple {151#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:17,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:17,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {146#false} is VALID [2022-04-27 11:44:17,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#false} assume !false; {146#false} is VALID [2022-04-27 11:44:17,231 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:17,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:44:17,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#false} assume !false; {146#false} is VALID [2022-04-27 11:44:17,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {146#false} is VALID [2022-04-27 11:44:17,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:17,331 INFO L272 TraceCheckUtils]: 9: Hoare triple {151#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:17,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {151#(<= 0 main_~sum~0)} is VALID [2022-04-27 11:44:17,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {150#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {151#(<= 0 main_~sum~0)} is VALID [2022-04-27 11:44:17,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {150#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-27 11:44:17,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {145#true} is VALID [2022-04-27 11:44:17,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {145#true} call #t~ret5 := main(); {145#true} is VALID [2022-04-27 11:44:17,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145#true} {145#true} #45#return; {145#true} is VALID [2022-04-27 11:44:17,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 11:44:17,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {145#true} is VALID [2022-04-27 11:44:17,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {145#true} call ULTIMATE.init(); {145#true} is VALID [2022-04-27 11:44:17,334 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:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307264856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:44:17,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:44:17,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-27 11:44:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380028685] [2022-04-27 11:44:17,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:44:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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:17,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:17,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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:17,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:17,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:44:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:44:17,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:44:17,349 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:17,434 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:44:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-27 11:44:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-27 11:44:17,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2022-04-27 11:44:17,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:17,448 INFO L225 Difference]: With dead ends: 14 [2022-04-27 11:44:17,448 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:44:17,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:44:17,449 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:17,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:44:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:44:17,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:17,451 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:17,451 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:17,451 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:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:17,451 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:17,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:17,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:17,451 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:17,452 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:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:17,452 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:17,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:17,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:17,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:17,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:17,452 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:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:44:17,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 11:44:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:17,453 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:44:17,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:17,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:17,455 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:44:17,473 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:17,670 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:17,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:44:17,703 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-27 11:44:17,703 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-27 11:44:17,703 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:44:17,703 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-27 11:44:17,703 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 11:44:17,703 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-27 11:44:17,704 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-27 11:44:17,704 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (<= 0 main_~i~0) (<= 0 main_~sum~0)) [2022-04-27 11:44:17,704 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 27) the Hoare annotation is: (<= 0 main_~sum~0) [2022-04-27 11:44:17,704 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-27 11:44:17,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:17,704 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:17,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:17,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:17,704 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:44:17,705 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:44:17,705 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:17,705 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:44:17,705 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:44:17,705 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 11:44:17,705 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:17,705 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:17,705 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 11:44:17,707 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 11:44:17,708 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:44:17,711 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:17,711 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:17,711 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:17,712 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:17,712 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:17,712 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:44:17,712 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:17,712 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:17,712 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:17,712 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:17,713 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:17,713 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:17,713 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:44:17,713 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:17,713 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:44:17,716 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:17,716 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:17,716 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:44:17,716 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:44:17,716 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 11:44:17,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:44:17,716 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 11:44:17,716 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:17,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:44:17 BoogieIcfgContainer [2022-04-27 11:44:17,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:44:17,723 INFO L158 Benchmark]: Toolchain (without parser) took 1967.02ms. Allocated memory was 230.7MB in the beginning and 282.1MB in the end (delta: 51.4MB). Free memory was 180.4MB in the beginning and 207.3MB in the end (delta: -26.9MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-04-27 11:44:17,724 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 230.7MB. Free memory is still 197.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:17,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.46ms. Allocated memory is still 230.7MB. Free memory was 180.3MB in the beginning and 206.3MB in the end (delta: -26.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 11:44:17,724 INFO L158 Benchmark]: Boogie Preprocessor took 29.39ms. Allocated memory is still 230.7MB. Free memory was 206.3MB in the beginning and 204.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:44:17,724 INFO L158 Benchmark]: RCFGBuilder took 265.50ms. Allocated memory is still 230.7MB. Free memory was 204.8MB in the beginning and 193.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 11:44:17,725 INFO L158 Benchmark]: TraceAbstraction took 1460.60ms. Allocated memory was 230.7MB in the beginning and 282.1MB in the end (delta: 51.4MB). Free memory was 193.3MB in the beginning and 207.3MB in the end (delta: -14.0MB). Peak memory consumption was 38.3MB. Max. memory is 8.0GB. [2022-04-27 11:44:17,726 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.30ms. Allocated memory is still 230.7MB. Free memory is still 197.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.46ms. Allocated memory is still 230.7MB. Free memory was 180.3MB in the beginning and 206.3MB in the end (delta: -26.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.39ms. Allocated memory is still 230.7MB. Free memory was 206.3MB in the beginning and 204.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 265.50ms. Allocated memory is still 230.7MB. Free memory was 204.8MB in the beginning and 193.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1460.60ms. Allocated memory was 230.7MB in the beginning and 282.1MB in the end (delta: 51.4MB). Free memory was 193.3MB in the beginning and 207.3MB in the end (delta: -14.0MB). Peak memory consumption was 38.3MB. 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.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 27 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 9 PreInvPairs, 11 NumberOfFragments, 21 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 109 SizeOfPredicates, 3 NumberOfNonLiveVariables, 68 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: 24]: Loop Invariant Derived loop invariant: 0 <= i && 0 <= sum RESULT: Ultimate proved your program to be correct! [2022-04-27 11:44:17,755 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...