/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/afnp2014.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:50:18,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:50:18,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:50:18,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:50:18,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:50:18,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:50:18,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:50:18,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:50:18,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:50:18,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:50:18,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:50:18,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:50:18,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:50:18,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:50:18,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:50:18,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:50:18,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:50:18,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:50:18,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:50:18,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:50:18,082 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:50:18,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:50:18,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:50:18,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:50:18,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:50:18,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:50:18,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:50:18,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:50:18,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:50:18,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:50:18,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:50:18,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:50:18,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:50:18,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:50:18,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:50:18,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:50:18,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:50:18,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:50:18,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:50:18,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:50:18,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:50:18,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:50:18,106 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:50:18,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:50:18,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:50:18,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:50:18,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:50:18,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:50:18,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:50:18,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:50:18,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:50:18,132 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:50:18,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:50:18,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:50:18,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:50:18,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:50:18,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:50:18,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:50:18,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:50:18,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:50:18,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:50:18,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:50:18,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:50:18,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:50:18,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:50:18,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:50:18,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:50:18,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:50:18,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:50:18,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:50:18,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:50:18,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:50:18,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:50:18,135 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:50:18,135 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:50:18,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:50:18,136 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:50:18,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:50:18,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:50:18,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:50:18,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:50:18,416 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:50:18,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/afnp2014.i [2022-04-27 10:50:18,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47199b1a0/2fbb9e0d4c434443aa86422007ae90de/FLAGec402c5a1 [2022-04-27 10:50:18,878 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:50:18,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/afnp2014.i [2022-04-27 10:50:18,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47199b1a0/2fbb9e0d4c434443aa86422007ae90de/FLAGec402c5a1 [2022-04-27 10:50:19,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47199b1a0/2fbb9e0d4c434443aa86422007ae90de [2022-04-27 10:50:19,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:50:19,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:50:19,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:50:19,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:50:19,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:50:19,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b21529c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19, skipping insertion in model container [2022-04-27 10:50:19,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:50:19,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:50:19,499 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/afnp2014.i[895,908] [2022-04-27 10:50:19,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:50:19,526 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:50:19,540 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/afnp2014.i[895,908] [2022-04-27 10:50:19,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:50:19,562 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:50:19,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19 WrapperNode [2022-04-27 10:50:19,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:50:19,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:50:19,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:50:19,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:50:19,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:50:19,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:50:19,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:50:19,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:50:19,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (1/1) ... [2022-04-27 10:50:19,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:50:19,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:19,632 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:50:19,653 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:50:19,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:50:19,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:50:19,668 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:50:19,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:50:19,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:50:19,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:50:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:50:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:50:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:50:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:50:19,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:50:19,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:50:19,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:50:19,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:50:19,735 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:50:19,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:50:19,871 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:50:19,877 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:50:19,877 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:50:19,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:50:19 BoogieIcfgContainer [2022-04-27 10:50:19,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:50:19,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:50:19,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:50:19,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:50:19,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:50:19" (1/3) ... [2022-04-27 10:50:19,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594447e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:50:19, skipping insertion in model container [2022-04-27 10:50:19,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:19" (2/3) ... [2022-04-27 10:50:19,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594447e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:50:19, skipping insertion in model container [2022-04-27 10:50:19,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:50:19" (3/3) ... [2022-04-27 10:50:19,903 INFO L111 eAbstractionObserver]: Analyzing ICFG afnp2014.i [2022-04-27 10:50:19,932 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:50:19,932 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:50:19,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:50:19,995 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@6bff5c7a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a265cd4 [2022-04-27 10:50:19,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:50:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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:50:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:50:20,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:20,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:20,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1411659294, now seen corresponding path program 1 times [2022-04-27 10:50:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:20,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242283216] [2022-04-27 10:50:20,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:20,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:20,179 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); {24#true} is VALID [2022-04-27 10:50:20,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:50:20,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #57#return; {24#true} is VALID [2022-04-27 10:50:20,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:20,182 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); {24#true} is VALID [2022-04-27 10:50:20,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:50:20,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #57#return; {24#true} is VALID [2022-04-27 10:50:20,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-27 10:50:20,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 1;~y~0 := 0; {24#true} is VALID [2022-04-27 10:50:20,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-27 10:50:20,184 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {25#false} is VALID [2022-04-27 10:50:20,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-27 10:50:20,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-27 10:50:20,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 10:50:20,185 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:50:20,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:20,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242283216] [2022-04-27 10:50:20,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242283216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:50:20,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:50:20,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:50:20,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675284708] [2022-04-27 10:50:20,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:50:20,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 10:50:20,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:20,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:50:20,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:20,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:50:20,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:50:20,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:50:20,248 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:50:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:20,339 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 10:50:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:50:20,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 10:50:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:50:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 10:50:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:50:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 10:50:20,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 10:50:20,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:20,401 INFO L225 Difference]: With dead ends: 33 [2022-04-27 10:50:20,401 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 10:50:20,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:50:20,406 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:20,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:50:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 10:50:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 10:50:20,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:20,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:50:20,432 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:50:20,432 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:50:20,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:20,435 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 10:50:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:50:20,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:20,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:20,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:50:20,436 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:50:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:20,438 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 10:50:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:50:20,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:20,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:20,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:20,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:50:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 10:50:20,442 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 10:50:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:20,442 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 10:50:20,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:50:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:50:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:50:20,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:20,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:20,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:50:20,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1052240059, now seen corresponding path program 1 times [2022-04-27 10:50:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:20,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814597092] [2022-04-27 10:50:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:20,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:20,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#(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); {123#true} is VALID [2022-04-27 10:50:20,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume true; {123#true} is VALID [2022-04-27 10:50:20,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} #57#return; {123#true} is VALID [2022-04-27 10:50:20,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} call ULTIMATE.init(); {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:20,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(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); {123#true} is VALID [2022-04-27 10:50:20,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} assume true; {123#true} is VALID [2022-04-27 10:50:20,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} #57#return; {123#true} is VALID [2022-04-27 10:50:20,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} call #t~ret3 := main(); {123#true} is VALID [2022-04-27 10:50:20,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} ~x~0 := 1;~y~0 := 0; {128#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:20,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {128#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:20,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {128#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:20,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {128#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:20,620 INFO L272 TraceCheckUtils]: 9: Hoare triple {128#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {129#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:50:20,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {130#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:50:20,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {124#false} is VALID [2022-04-27 10:50:20,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-04-27 10:50:20,623 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:50:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814597092] [2022-04-27 10:50:20,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814597092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:50:20,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:50:20,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:50:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532287217] [2022-04-27 10:50:20,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:50:20,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-27 10:50:20,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:20,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:50:20,641 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 10:50:20,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:50:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:20,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:50:20,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:50:20,643 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:50:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:20,819 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 10:50:20,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:50:20,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-27 10:50:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:50:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 10:50:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:50:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 10:50:20,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 10:50:20,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:20,854 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:50:20,854 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:50:20,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:50:20,861 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:20,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:50:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:50:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 10:50:20,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:20,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:20,870 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:20,870 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:20,872 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 10:50:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:50:20,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:20,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:20,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 10:50:20,874 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 10:50:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:20,876 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 10:50:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:50:20,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:20,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:20,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:20,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 10:50:20,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-27 10:50:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:20,879 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 10:50:20,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:50:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:50:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:50:20,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:20,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:20,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:50:20,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1104509419, now seen corresponding path program 1 times [2022-04-27 10:50:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:20,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526932843] [2022-04-27 10:50:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:20,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(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); {231#true} is VALID [2022-04-27 10:50:20,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 10:50:20,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #57#return; {231#true} is VALID [2022-04-27 10:50:20,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:20,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(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); {231#true} is VALID [2022-04-27 10:50:20,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 10:50:20,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #57#return; {231#true} is VALID [2022-04-27 10:50:20,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret3 := main(); {231#true} is VALID [2022-04-27 10:50:20,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} ~x~0 := 1;~y~0 := 0; {236#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 10:50:20,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#(= (+ (- 1) main_~x~0) 0)} #t~short2 := ~y~0 < 1000; {236#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 10:50:20,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(= (+ (- 1) main_~x~0) 0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {236#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 10:50:20,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#(= (+ (- 1) main_~x~0) 0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:20,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:20,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:20,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:20,984 INFO L272 TraceCheckUtils]: 12: Hoare triple {237#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:50:20,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {239#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:50:20,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {232#false} is VALID [2022-04-27 10:50:20,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 10:50:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:20,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:20,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526932843] [2022-04-27 10:50:20,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526932843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:50:20,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971480397] [2022-04-27 10:50:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:20,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:20,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:21,011 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:50:21,039 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:50:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:21,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:50:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:21,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:50:21,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 10:50:21,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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); {231#true} is VALID [2022-04-27 10:50:21,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 10:50:21,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #57#return; {231#true} is VALID [2022-04-27 10:50:21,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret3 := main(); {231#true} is VALID [2022-04-27 10:50:21,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} ~x~0 := 1;~y~0 := 0; {259#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:21,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {259#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:21,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {259#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:21,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:21,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:21,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:21,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:21,301 INFO L272 TraceCheckUtils]: 12: Hoare triple {237#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:21,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:21,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 10:50:21,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 10:50:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:21,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:50:21,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 10:50:21,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 10:50:21,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:21,454 INFO L272 TraceCheckUtils]: 12: Hoare triple {237#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:21,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:21,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:21,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:21,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:21,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {259#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:21,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {259#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:21,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} ~x~0 := 1;~y~0 := 0; {259#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:21,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret3 := main(); {231#true} is VALID [2022-04-27 10:50:21,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #57#return; {231#true} is VALID [2022-04-27 10:50:21,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 10:50:21,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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); {231#true} is VALID [2022-04-27 10:50:21,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 10:50:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:21,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971480397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:50:21,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:50:21,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-27 10:50:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721027129] [2022-04-27 10:50:21,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:50:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:50:21,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:21,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:21,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:21,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 10:50:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 10:50:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:50:21,483 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:21,658 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 10:50:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:50:21,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:50:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-27 10:50:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-27 10:50:21,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-27 10:50:21,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:21,689 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:50:21,689 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 10:50:21,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:50:21,690 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:21,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 44 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:50:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 10:50:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 10:50:21,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:21,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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:50:21,695 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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:50:21,696 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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:50:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:21,716 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 10:50:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 10:50:21,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:21,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:21,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 20 states. [2022-04-27 10:50:21,718 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 20 states. [2022-04-27 10:50:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:21,719 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 10:50:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 10:50:21,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:21,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:21,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:21,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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:50:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 10:50:21,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2022-04-27 10:50:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:21,721 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 10:50:21,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 10:50:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:50:21,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:21,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:21,744 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:50:21,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:21,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:21,934 INFO L85 PathProgramCache]: Analyzing trace with hash -812115269, now seen corresponding path program 2 times [2022-04-27 10:50:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:21,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738759814] [2022-04-27 10:50:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:22,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#(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); {452#true} is VALID [2022-04-27 10:50:22,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:50:22,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {452#true} {452#true} #57#return; {452#true} is VALID [2022-04-27 10:50:22,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:22,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#(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); {452#true} is VALID [2022-04-27 10:50:22,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:50:22,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #57#return; {452#true} is VALID [2022-04-27 10:50:22,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret3 := main(); {452#true} is VALID [2022-04-27 10:50:22,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} ~x~0 := 1;~y~0 := 0; {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-27 10:50:22,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-27 10:50:22,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-27 10:50:22,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,057 INFO L272 TraceCheckUtils]: 15: Hoare triple {459#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {460#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:50:22,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {461#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:50:22,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {453#false} is VALID [2022-04-27 10:50:22,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 10:50:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:22,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738759814] [2022-04-27 10:50:22,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738759814] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:50:22,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852288226] [2022-04-27 10:50:22,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:50:22,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:22,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:22,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:50:22,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:50:22,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:50:22,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:50:22,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:50:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:22,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:50:22,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2022-04-27 10:50:22,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#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); {452#true} is VALID [2022-04-27 10:50:22,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:50:22,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #57#return; {452#true} is VALID [2022-04-27 10:50:22,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret3 := main(); {452#true} is VALID [2022-04-27 10:50:22,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} ~x~0 := 1;~y~0 := 0; {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-27 10:50:22,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-27 10:50:22,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-27 10:50:22,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,291 INFO L272 TraceCheckUtils]: 15: Hoare triple {459#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:22,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:22,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {453#false} is VALID [2022-04-27 10:50:22,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 10:50:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:22,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:50:22,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 10:50:22,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {453#false} is VALID [2022-04-27 10:50:22,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:22,489 INFO L272 TraceCheckUtils]: 15: Hoare triple {459#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:22,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 10:50:22,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {458#(<= 1 main_~x~0)} is VALID [2022-04-27 10:50:22,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {553#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 10:50:22,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {553#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 10:50:22,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} ~x~0 := 1;~y~0 := 0; {553#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 10:50:22,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret3 := main(); {452#true} is VALID [2022-04-27 10:50:22,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #57#return; {452#true} is VALID [2022-04-27 10:50:22,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:50:22,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#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); {452#true} is VALID [2022-04-27 10:50:22,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2022-04-27 10:50:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:22,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852288226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:50:22,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:50:22,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:50:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750781331] [2022-04-27 10:50:22,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:50:22,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 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 19 [2022-04-27 10:50:22,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:22,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 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 10:50:22,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:22,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:50:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:22,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:50:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:50:22,536 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 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 10:50:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:22,702 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 10:50:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:50:22,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 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 19 [2022-04-27 10:50:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 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 10:50:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-27 10:50:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 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 10:50:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-27 10:50:22,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2022-04-27 10:50:22,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:22,723 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:50:22,723 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:50:22,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:50:22,724 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:22,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 37 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:50:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:50:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:50:22,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:22,726 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:50:22,726 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:50:22,726 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:50:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:22,726 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:50:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:22,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:22,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:22,726 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:50:22,727 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:50:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:22,727 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:50:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:22,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:22,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:22,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:22,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:22,727 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:50:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:50:22,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-27 10:50:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:22,728 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:50:22,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 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 10:50:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:22,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:22,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:50:22,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:50:22,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:50:22,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:50:22,995 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:50:22,995 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:50:22,996 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:50:22,996 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:50:22,996 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:22,996 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:22,996 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:22,996 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 10:50:22,996 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 33) the Hoare annotation is: true [2022-04-27 10:50:22,996 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-27 10:50:22,997 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 33) no Hoare annotation was computed. [2022-04-27 10:50:22,997 INFO L899 garLoopResultBuilder]: For program point L27-3(lines 27 30) no Hoare annotation was computed. [2022-04-27 10:50:22,997 INFO L895 garLoopResultBuilder]: At program point L27-5(lines 27 30) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 main_~x~0)) [2022-04-27 10:50:22,997 INFO L895 garLoopResultBuilder]: At program point L27-6(lines 27 30) the Hoare annotation is: (<= main_~y~0 main_~x~0) [2022-04-27 10:50:22,997 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 33) no Hoare annotation was computed. [2022-04-27 10:50:22,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:50:22,997 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:50:22,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:50:22,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:50:22,997 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:50:22,998 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:50:22,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:50:22,998 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:50:22,998 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:50:22,998 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:50:22,998 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:50:22,998 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:50:22,998 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:50:23,001 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 10:50:23,002 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:50:23,005 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:50:23,005 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:50:23,005 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:50:23,006 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:50:23,006 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:23,007 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:50:23,007 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:50:23,007 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:50:23,007 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:50:23,007 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:50:23,008 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 10:50:23,009 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:50:23,010 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:50:23,010 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:50:23,010 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:50:23,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:50:23 BoogieIcfgContainer [2022-04-27 10:50:23,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:50:23,016 INFO L158 Benchmark]: Toolchain (without parser) took 3741.47ms. Allocated memory was 184.5MB in the beginning and 240.1MB in the end (delta: 55.6MB). Free memory was 127.9MB in the beginning and 141.9MB in the end (delta: -14.0MB). Peak memory consumption was 43.2MB. Max. memory is 8.0GB. [2022-04-27 10:50:23,017 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 184.5MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:50:23,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.28ms. Allocated memory was 184.5MB in the beginning and 240.1MB in the end (delta: 55.6MB). Free memory was 127.6MB in the beginning and 209.3MB in the end (delta: -81.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-27 10:50:23,017 INFO L158 Benchmark]: Boogie Preprocessor took 37.92ms. Allocated memory is still 240.1MB. Free memory was 209.3MB in the beginning and 207.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:50:23,018 INFO L158 Benchmark]: RCFGBuilder took 276.33ms. Allocated memory is still 240.1MB. Free memory was 207.6MB in the beginning and 196.2MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:50:23,018 INFO L158 Benchmark]: TraceAbstraction took 3135.34ms. Allocated memory is still 240.1MB. Free memory was 195.6MB in the beginning and 141.9MB in the end (delta: 53.8MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. [2022-04-27 10:50:23,019 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.43ms. Allocated memory is still 184.5MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.28ms. Allocated memory was 184.5MB in the beginning and 240.1MB in the end (delta: 55.6MB). Free memory was 127.6MB in the beginning and 209.3MB in the end (delta: -81.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.92ms. Allocated memory is still 240.1MB. Free memory was 209.3MB in the beginning and 207.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 276.33ms. Allocated memory is still 240.1MB. Free memory was 207.6MB in the beginning and 196.2MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3135.34ms. Allocated memory is still 240.1MB. Free memory was 195.6MB in the beginning and 141.9MB in the end (delta: 53.8MB). Peak memory consumption was 53.8MB. 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 55 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 24 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 SizeOfPredicates, 2 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/36 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: 27]: Loop Invariant Derived loop invariant: (0 <= y && 1 <= x) && y <= x RESULT: Ultimate proved your program to be correct! [2022-04-27 10:50:23,051 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...