/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-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:53:06,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:53:06,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:53:06,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:53:06,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:53:06,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:53:06,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:53:06,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:53:06,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:53:06,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:53:06,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:53:06,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:53:06,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:53:06,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:53:06,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:53:06,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:53:06,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:53:06,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:53:06,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:53:06,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:53:06,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:53:06,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:53:06,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:53:06,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:53:06,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:53:06,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:53:06,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:53:06,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:53:06,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:53:06,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:53:06,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:53:06,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:53:06,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:53:06,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:53:06,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:53:06,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:53:06,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:53:06,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:53:06,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:53:06,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:53:06,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:53:06,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:53:06,134 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 10:53:06,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:53:06,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:53:06,166 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:53:06,166 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:53:06,166 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:53:06,167 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:53:06,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:53:06,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:53:06,167 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:53:06,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:53:06,168 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:53:06,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:53:06,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:53:06,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:53:06,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:53:06,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:53:06,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:53:06,169 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:53:06,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:53:06,171 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:53:06,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:53:06,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:53:06,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:53:06,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:53:06,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:06,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:53:06,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:53:06,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:53:06,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:53:06,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:53:06,172 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:53:06,172 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:53:06,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:53:06,173 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 10:53:06,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:53:06,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:53:06,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:53:06,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:53:06,429 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:53:06,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-27 10:53:06,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9beaf6982/547577f85db04b80a932b74a066d3d25/FLAGb9d379a1c [2022-04-27 10:53:06,845 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:53:06,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-27 10:53:06,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9beaf6982/547577f85db04b80a932b74a066d3d25/FLAGb9d379a1c [2022-04-27 10:53:07,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9beaf6982/547577f85db04b80a932b74a066d3d25 [2022-04-27 10:53:07,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:53:07,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:53:07,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:07,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:53:07,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:53:07,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef75404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07, skipping insertion in model container [2022-04-27 10:53:07,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:53:07,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:53:07,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i[895,908] [2022-04-27 10:53:07,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:07,512 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:53:07,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i[895,908] [2022-04-27 10:53:07,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:07,538 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:53:07,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07 WrapperNode [2022-04-27 10:53:07,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:07,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:53:07,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:53:07,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:53:07,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:53:07,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:53:07,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:53:07,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:53:07,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (1/1) ... [2022-04-27 10:53:07,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:07,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:07,590 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 10:53:07,612 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 10:53:07,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:53:07,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:53:07,635 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:53:07,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:53:07,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:53:07,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:53:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:53:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:53:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:53:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:53:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:53:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:53:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:53:07,704 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:53:07,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:53:07,803 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:53:07,809 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:53:07,809 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:53:07,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:07 BoogieIcfgContainer [2022-04-27 10:53:07,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:53:07,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:53:07,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:53:07,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:53:07,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:53:07" (1/3) ... [2022-04-27 10:53:07,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfab691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:07, skipping insertion in model container [2022-04-27 10:53:07,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:07" (2/3) ... [2022-04-27 10:53:07,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfab691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:07, skipping insertion in model container [2022-04-27 10:53:07,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:07" (3/3) ... [2022-04-27 10:53:07,817 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.i [2022-04-27 10:53:07,829 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:53:07,830 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:53:07,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:53:07,894 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@75ea3152, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4077155d [2022-04-27 10:53:07,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:53:07,901 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 10:53:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:53:07,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:07,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:07,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:07,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:07,934 INFO L85 PathProgramCache]: Analyzing trace with hash 253912119, now seen corresponding path program 1 times [2022-04-27 10:53:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:07,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738880822] [2022-04-27 10:53:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:08,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:08,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-27 10:53:08,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:53:08,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-27 10:53:08,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:08,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-27 10:53:08,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:53:08,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-27 10:53:08,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-27 10:53:08,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {28#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 10:53:08,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {28#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 10:53:08,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~x~0 50) 0)} assume !(~x~0 < 0); {24#false} is VALID [2022-04-27 10:53:08,145 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {24#false} is VALID [2022-04-27 10:53:08,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 10:53:08,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 10:53:08,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 10:53:08,146 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 10:53:08,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:08,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738880822] [2022-04-27 10:53:08,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738880822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:08,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:08,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:53:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306950454] [2022-04-27 10:53:08,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:08,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:53:08,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:08,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:08,176 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 10:53:08,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:53:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:53:08,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:53:08,205 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:08,355 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 10:53:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:53:08,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:53:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-27 10:53:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-27 10:53:08,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-27 10:53:08,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:08,420 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:53:08,420 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 10:53:08,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:53:08,426 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:08,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:53:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 10:53:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 10:53:08,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:08,468 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 10:53:08,469 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 10:53:08,469 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 10:53:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:08,474 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 10:53:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:53:08,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:08,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:08,476 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 10:53:08,477 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 10:53:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:08,480 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 10:53:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:53:08,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:08,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:08,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:08,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:08,482 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 10:53:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 10:53:08,484 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 10:53:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:08,485 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 10:53:08,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:53:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:53:08,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:08,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:08,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:53:08,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash -684163825, now seen corresponding path program 1 times [2022-04-27 10:53:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:08,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113178384] [2022-04-27 10:53:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:08,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {129#true} is VALID [2022-04-27 10:53:08,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2022-04-27 10:53:08,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #54#return; {129#true} is VALID [2022-04-27 10:53:08,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:08,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {129#true} is VALID [2022-04-27 10:53:08,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} assume true; {129#true} is VALID [2022-04-27 10:53:08,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#true} {129#true} #54#return; {129#true} is VALID [2022-04-27 10:53:08,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#true} call #t~ret3 := main(); {129#true} is VALID [2022-04-27 10:53:08,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {134#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 10:53:08,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {134#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 10:53:08,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {135#(<= (+ 51 main_~x~0) main_~y~0)} is VALID [2022-04-27 10:53:08,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {135#(<= (+ 51 main_~x~0) main_~y~0)} assume !(~x~0 < 0); {136#(<= 51 main_~y~0)} is VALID [2022-04-27 10:53:08,617 INFO L272 TraceCheckUtils]: 9: Hoare triple {136#(<= 51 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:08,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {138#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:08,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {138#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {130#false} is VALID [2022-04-27 10:53:08,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-04-27 10:53:08,619 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 10:53:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:08,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113178384] [2022-04-27 10:53:08,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113178384] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:08,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165192313] [2022-04-27 10:53:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:08,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:08,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:08,627 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 10:53:08,658 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 10:53:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:08,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:53:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:08,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:08,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2022-04-27 10:53:08,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#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(9, 2); {129#true} is VALID [2022-04-27 10:53:08,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} assume true; {129#true} is VALID [2022-04-27 10:53:08,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#true} {129#true} #54#return; {129#true} is VALID [2022-04-27 10:53:08,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#true} call #t~ret3 := main(); {129#true} is VALID [2022-04-27 10:53:08,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {134#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 10:53:08,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {134#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 10:53:08,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {135#(<= (+ 51 main_~x~0) main_~y~0)} is VALID [2022-04-27 10:53:08,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {135#(<= (+ 51 main_~x~0) main_~y~0)} assume !(~x~0 < 0); {136#(<= 51 main_~y~0)} is VALID [2022-04-27 10:53:08,966 INFO L272 TraceCheckUtils]: 9: Hoare triple {136#(<= 51 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:08,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:08,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2022-04-27 10:53:08,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-04-27 10:53:08,968 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 10:53:08,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:09,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-04-27 10:53:09,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2022-04-27 10:53:09,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:09,205 INFO L272 TraceCheckUtils]: 9: Hoare triple {190#(< 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:09,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {194#(or (< main_~x~0 0) (< 0 main_~y~0))} assume !(~x~0 < 0); {190#(< 0 main_~y~0)} is VALID [2022-04-27 10:53:09,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {198#(< main_~x~0 1)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {194#(or (< main_~x~0 0) (< 0 main_~y~0))} is VALID [2022-04-27 10:53:09,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(< main_~x~0 1)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {198#(< main_~x~0 1)} is VALID [2022-04-27 10:53:09,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {198#(< main_~x~0 1)} is VALID [2022-04-27 10:53:09,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#true} call #t~ret3 := main(); {129#true} is VALID [2022-04-27 10:53:09,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#true} {129#true} #54#return; {129#true} is VALID [2022-04-27 10:53:09,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} assume true; {129#true} is VALID [2022-04-27 10:53:09,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#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(9, 2); {129#true} is VALID [2022-04-27 10:53:09,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2022-04-27 10:53:09,216 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 10:53:09,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165192313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:09,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:09,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-27 10:53:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332179447] [2022-04-27 10:53:09,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:09,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 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 10:53:09,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:09,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:09,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:09,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 10:53:09,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:09,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 10:53:09,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:53:09,245 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:09,486 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 10:53:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:53:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 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 10:53:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-27 10:53:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-27 10:53:09,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 17 transitions. [2022-04-27 10:53:09,512 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 10:53:09,512 INFO L225 Difference]: With dead ends: 16 [2022-04-27 10:53:09,512 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:53:09,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:53:09,516 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:09,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:53:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:53:09,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:09,518 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 10:53:09,518 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 10:53:09,518 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 10:53:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:09,519 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:09,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:09,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:09,519 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 10:53:09,519 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 10:53:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:09,520 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:09,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:09,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:09,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:09,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:09,521 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 10:53:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:53:09,525 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 10:53:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:09,525 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:53:09,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:09,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:09,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:53:09,567 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 10:53:09,758 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 10:53:09,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:53:09,805 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:53:09,806 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:53:09,806 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:53:09,806 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:53:09,806 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:09,806 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:09,806 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:09,807 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-27 10:53:09,807 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 35) the Hoare annotation is: true [2022-04-27 10:53:09,807 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 10:53:09,807 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 32) the Hoare annotation is: (or (< main_~x~0 0) (< 0 main_~y~0)) [2022-04-27 10:53:09,807 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 32) the Hoare annotation is: (< 0 main_~y~0) [2022-04-27 10:53:09,807 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 35) no Hoare annotation was computed. [2022-04-27 10:53:09,807 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 35) no Hoare annotation was computed. [2022-04-27 10:53:09,807 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:09,808 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 10:53:09,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:09,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:09,810 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:53:09,811 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:53:09,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:09,811 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:09,814 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:53:09,814 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:09,814 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:53:09,814 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:53:09,814 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:53:09,817 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 10:53:09,819 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:53:09,821 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:09,822 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:09,822 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:09,823 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:09,824 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:09,824 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:09,824 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:53:09,824 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:09,824 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:53:09,824 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:53:09,828 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:09,829 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:09,829 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:53:09,829 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:53:09,829 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:53:09,829 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:53:09,829 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:53:09,829 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 10:53:09,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:53:09 BoogieIcfgContainer [2022-04-27 10:53:09,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:53:09,837 INFO L158 Benchmark]: Toolchain (without parser) took 2547.99ms. Allocated memory was 199.2MB in the beginning and 252.7MB in the end (delta: 53.5MB). Free memory was 142.8MB in the beginning and 173.1MB in the end (delta: -30.3MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. [2022-04-27 10:53:09,837 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 199.2MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:53:09,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.19ms. Allocated memory was 199.2MB in the beginning and 252.7MB in the end (delta: 53.5MB). Free memory was 142.6MB in the beginning and 223.3MB in the end (delta: -80.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-27 10:53:09,838 INFO L158 Benchmark]: Boogie Preprocessor took 23.53ms. Allocated memory is still 252.7MB. Free memory was 223.3MB in the beginning and 221.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:53:09,838 INFO L158 Benchmark]: RCFGBuilder took 247.67ms. Allocated memory is still 252.7MB. Free memory was 221.8MB in the beginning and 210.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:53:09,839 INFO L158 Benchmark]: TraceAbstraction took 2023.93ms. Allocated memory is still 252.7MB. Free memory was 210.3MB in the beginning and 173.1MB in the end (delta: 37.2MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2022-04-27 10:53:09,840 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.41ms. Allocated memory is still 199.2MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.19ms. Allocated memory was 199.2MB in the beginning and 252.7MB in the end (delta: 53.5MB). Free memory was 142.6MB in the beginning and 223.3MB in the end (delta: -80.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.53ms. Allocated memory is still 252.7MB. Free memory was 223.3MB in the beginning and 221.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 247.67ms. Allocated memory is still 252.7MB. Free memory was 221.8MB in the beginning and 210.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2023.93ms. Allocated memory is still 252.7MB. Free memory was 210.3MB in the beginning and 173.1MB in the end (delta: 37.2MB). Peak memory consumption was 36.0MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 27 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 13 NumberOfFragments, 21 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 3 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 7 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: 29]: Loop Invariant Derived loop invariant: x < 0 || 0 < y RESULT: Ultimate proved your program to be correct! [2022-04-27 10:53:09,875 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...