/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/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:53:20,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:53:20,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:53:20,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:53:20,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:53:20,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:53:20,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:53:20,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:53:20,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:53:20,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:53:20,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:53:20,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:53:20,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:53:20,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:53:20,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:53:20,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:53:20,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:53:20,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:53:20,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:53:20,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:53:20,379 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:53:20,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:53:20,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:53:20,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:53:20,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:53:20,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:53:20,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:53:20,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:53:20,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:53:20,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:53:20,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:53:20,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:53:20,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:53:20,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:53:20,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:53:20,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:53:20,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:53:20,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:53:20,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:53:20,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:53:20,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:53:20,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:53:20,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:53:20,431 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:53:20,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:53:20,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:53:20,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:53:20,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:53:20,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:53:20,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:53:20,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:53:20,433 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:53:20,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:53:20,433 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:53:20,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:53:20,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:53:20,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:53:20,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:53:20,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:53:20,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:20,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:53:20,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:53:20,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:53:20,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:53:20,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:53:20,435 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:53:20,436 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:53:20,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:53:20,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:53:20,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:53:20,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:53:20,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:53:20,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:53:20,679 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:53:20,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-27 10:53:20,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43a96ab7/98e58ea6d11944fe854d38ebf3399e2b/FLAG1e92a579c [2022-04-27 10:53:21,129 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:53:21,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-27 10:53:21,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43a96ab7/98e58ea6d11944fe854d38ebf3399e2b/FLAG1e92a579c [2022-04-27 10:53:21,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43a96ab7/98e58ea6d11944fe854d38ebf3399e2b [2022-04-27 10:53:21,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:53:21,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:53:21,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:21,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:53:21,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:53:21,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e6a623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21, skipping insertion in model container [2022-04-27 10:53:21,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:53:21,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:53:21,729 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/jm2006.i[895,908] [2022-04-27 10:53:21,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:21,763 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:53:21,780 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/jm2006.i[895,908] [2022-04-27 10:53:21,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:21,798 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:53:21,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21 WrapperNode [2022-04-27 10:53:21,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:21,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:53:21,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:53:21,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:53:21,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:53:21,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:53:21,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:53:21,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:53:21,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (1/1) ... [2022-04-27 10:53:21,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:21,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:21,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:53:21,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:53:21,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:53:21,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:53:21,900 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:53:21,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:53:21,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:53:21,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:53:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:53:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:53:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:53:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:53:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:53:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:53:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:53:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:53:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:53:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:53:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:53:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:53:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:53:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:53:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:53:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:53:21,963 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:53:21,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:53:22,107 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:53:22,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:53:22,127 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:53:22,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:22 BoogieIcfgContainer [2022-04-27 10:53:22,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:53:22,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:53:22,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:53:22,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:53:22,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:53:21" (1/3) ... [2022-04-27 10:53:22,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfedeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:22, skipping insertion in model container [2022-04-27 10:53:22,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:21" (2/3) ... [2022-04-27 10:53:22,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfedeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:22, skipping insertion in model container [2022-04-27 10:53:22,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:22" (3/3) ... [2022-04-27 10:53:22,143 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.i [2022-04-27 10:53:22,156 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:53:22,157 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:53:22,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:53:22,204 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@5e9ff66a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ca36bc9 [2022-04-27 10:53:22,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:53:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:53:22,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:22,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:22,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:22,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 1 times [2022-04-27 10:53:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:22,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218131932] [2022-04-27 10:53:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:22,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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:53:22,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:53:22,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-27 10:53:22,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:22,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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:53:22,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:53:22,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-27 10:53:22,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-27 10:53:22,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-27 10:53:22,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:22,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:22,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume ~i~0 == ~j~0; {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:22,622 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:22,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:22,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-27 10:53:22,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 10:53:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:22,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218131932] [2022-04-27 10:53:22,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218131932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:22,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:22,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:53:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307610238] [2022-04-27 10:53:22,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:22,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:53:22,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:22,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:53:22,657 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:53:22,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:53:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:22,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:53:22,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:53:22,691 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:53:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:23,157 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 10:53:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:53:23,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:53:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:53:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-27 10:53:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:53:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-27 10:53:23,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-27 10:53:23,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:23,254 INFO L225 Difference]: With dead ends: 47 [2022-04-27 10:53:23,255 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:53:23,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:53:23,260 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:23,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:23,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:53:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:53:23,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:23,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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:53:23,288 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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:53:23,288 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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:53:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:23,290 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:53:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:23,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:23,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:23,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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 15 states. [2022-04-27 10:53:23,291 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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 15 states. [2022-04-27 10:53:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:23,293 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:53:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:23,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:23,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:23,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:23,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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:53:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 10:53:23,296 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 10:53:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:23,296 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 10:53:23,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:53:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:53:23,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:23,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:23,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:53:23,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1450374075, now seen corresponding path program 1 times [2022-04-27 10:53:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:23,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824013005] [2022-04-27 10:53:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:23,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:23,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(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); {161#true} is VALID [2022-04-27 10:53:23,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 10:53:23,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-27 10:53:23,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:23,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(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); {161#true} is VALID [2022-04-27 10:53:23,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 10:53:23,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-27 10:53:23,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret5 := main(); {161#true} is VALID [2022-04-27 10:53:23,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {161#true} is VALID [2022-04-27 10:53:23,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {166#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 10:53:23,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {167#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~y~0 1)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~y~0 1) main_~j~0) (<= main_~y~0 0)))} is VALID [2022-04-27 10:53:23,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~y~0 1)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~y~0 1) main_~j~0) (<= main_~y~0 0)))} assume !(0 != ~x~0); {168#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-27 10:53:23,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {168#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {169#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:23,490 INFO L272 TraceCheckUtils]: 10: Hoare triple {169#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:23,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {171#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:23,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {171#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-27 10:53:23,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-27 10:53:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:23,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824013005] [2022-04-27 10:53:23,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824013005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:23,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478611610] [2022-04-27 10:53:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:23,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:23,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:53:23,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:53:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:23,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 10:53:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:23,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:23,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2022-04-27 10:53:23,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#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); {161#true} is VALID [2022-04-27 10:53:23,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 10:53:23,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-27 10:53:23,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret5 := main(); {161#true} is VALID [2022-04-27 10:53:23,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {161#true} is VALID [2022-04-27 10:53:23,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {166#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 10:53:23,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {197#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:23,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {201#(and (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)) (= main_~i~0 1))} is VALID [2022-04-27 10:53:23,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(and (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)) (= main_~i~0 1))} assume ~i~0 == ~j~0; {169#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:23,952 INFO L272 TraceCheckUtils]: 10: Hoare triple {169#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {208#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:23,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {212#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:23,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {162#false} is VALID [2022-04-27 10:53:23,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-27 10:53:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:23,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:24,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-27 10:53:24,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {162#false} is VALID [2022-04-27 10:53:24,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {212#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:24,159 INFO L272 TraceCheckUtils]: 10: Hoare triple {169#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {208#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:24,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {169#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:24,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {231#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-27 10:53:24,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {235#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-27 10:53:24,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {239#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-27 10:53:24,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {161#true} is VALID [2022-04-27 10:53:24,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret5 := main(); {161#true} is VALID [2022-04-27 10:53:24,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-27 10:53:24,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 10:53:24,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#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); {161#true} is VALID [2022-04-27 10:53:24,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2022-04-27 10:53:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:24,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478611610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:24,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:24,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 10:53:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126186879] [2022-04-27 10:53:24,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:24,175 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 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 14 [2022-04-27 10:53:24,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:24,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 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:53:24,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 10:53:24,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 10:53:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:53:24,199 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 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:53:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:24,648 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 10:53:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:53:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 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 14 [2022-04-27 10:53:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 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:53:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-27 10:53:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 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:53:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-27 10:53:24,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-27 10:53:24,677 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:53:24,678 INFO L225 Difference]: With dead ends: 26 [2022-04-27 10:53:24,679 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 10:53:24,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:53:24,680 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:24,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:24,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 10:53:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 10:53:24,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:24,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:24,699 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:24,700 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:24,701 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:53:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:53:24,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:24,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:24,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-27 10:53:24,703 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-27 10:53:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:24,706 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:53:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:53:24,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:24,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:24,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:24,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 10:53:24,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-04-27 10:53:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:24,715 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 10:53:24,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 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:53:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:53:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:53:24,716 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:24,716 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:24,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:53:24,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:24,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1017812769, now seen corresponding path program 2 times [2022-04-27 10:53:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:24,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054302415] [2022-04-27 10:53:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(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); {390#true} is VALID [2022-04-27 10:53:25,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-27 10:53:25,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #60#return; {390#true} is VALID [2022-04-27 10:53:25,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:25,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#(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); {390#true} is VALID [2022-04-27 10:53:25,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-27 10:53:25,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #60#return; {390#true} is VALID [2022-04-27 10:53:25,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-27 10:53:25,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {390#true} is VALID [2022-04-27 10:53:25,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {395#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 10:53:25,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {396#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:25,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {397#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} is VALID [2022-04-27 10:53:25,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {397#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} is VALID [2022-04-27 10:53:25,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {397#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {398#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} is VALID [2022-04-27 10:53:25,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {398#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} assume !(0 != ~x~0); {399#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-27 10:53:25,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {399#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {400#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:25,180 INFO L272 TraceCheckUtils]: 13: Hoare triple {400#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {401#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:25,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {401#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {402#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:25,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {402#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {391#false} is VALID [2022-04-27 10:53:25,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-27 10:53:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:53:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054302415] [2022-04-27 10:53:25,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054302415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:25,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749099791] [2022-04-27 10:53:25,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:53:25,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:25,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:25,183 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:53:25,184 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:53:25,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:53:25,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:53:25,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 10:53:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:25,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-27 10:53:25,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#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); {390#true} is VALID [2022-04-27 10:53:25,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-27 10:53:25,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #60#return; {390#true} is VALID [2022-04-27 10:53:25,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-27 10:53:25,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {390#true} is VALID [2022-04-27 10:53:25,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {395#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 10:53:25,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {396#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:25,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {431#(and (= (+ (- 2) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-27 10:53:25,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#(and (= (+ (- 2) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {435#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ main_~i~0 (- 3) (* (- 1) main_~x~0)) 0))} is VALID [2022-04-27 10:53:25,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ main_~i~0 (- 3) (* (- 1) main_~x~0)) 0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {439#(and (= (+ main_~i~0 (- 4) (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 4) main_~j~0) (<= main_~j~0 (+ main_~y~0 4)))} is VALID [2022-04-27 10:53:25,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(and (= (+ main_~i~0 (- 4) (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 4) main_~j~0) (<= main_~j~0 (+ main_~y~0 4)))} assume !(0 != ~x~0); {443#(and (= (+ main_~i~0 (- 4)) 0) (<= (+ main_~y~0 4) main_~j~0) (<= main_~j~0 (+ main_~y~0 4)))} is VALID [2022-04-27 10:53:25,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(and (= (+ main_~i~0 (- 4)) 0) (<= (+ main_~y~0 4) main_~j~0) (<= main_~j~0 (+ main_~y~0 4)))} assume ~i~0 == ~j~0; {400#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:25,569 INFO L272 TraceCheckUtils]: 13: Hoare triple {400#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:25,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:25,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-27 10:53:25,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-27 10:53:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:25,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:25,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-27 10:53:25,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-27 10:53:25,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:25,885 INFO L272 TraceCheckUtils]: 13: Hoare triple {400#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:25,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {473#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {400#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:25,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {473#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-27 10:53:25,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 main_~y~0) (<= main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {477#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-27 10:53:25,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {485#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (<= main_~y~0 2) (< 1 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {481#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 main_~y~0) (<= main_~y~0 1)))} is VALID [2022-04-27 10:53:25,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {489#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 3) (< 2 main_~y~0)) (not (= (+ (- 1) main_~x~0) 2)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {485#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (<= main_~y~0 2) (< 1 main_~y~0)))} is VALID [2022-04-27 10:53:25,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {493#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 4) (< 3 main_~y~0)) (not (= main_~x~0 4)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {489#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 3) (< 2 main_~y~0)) (not (= (+ (- 1) main_~x~0) 2)))} is VALID [2022-04-27 10:53:25,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {493#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 4) (< 3 main_~y~0)) (not (= main_~x~0 4)))} is VALID [2022-04-27 10:53:25,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {390#true} is VALID [2022-04-27 10:53:25,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-27 10:53:25,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #60#return; {390#true} is VALID [2022-04-27 10:53:25,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-27 10:53:25,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#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); {390#true} is VALID [2022-04-27 10:53:25,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-27 10:53:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:25,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749099791] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:25,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:25,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-04-27 10:53:25,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052710482] [2022-04-27 10:53:25,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:25,899 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 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 17 [2022-04-27 10:53:25,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:25,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 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:53:25,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:25,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 10:53:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:25,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 10:53:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-04-27 10:53:25,929 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 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:53:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:26,464 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 10:53:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 10:53:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 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 17 [2022-04-27 10:53:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 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:53:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2022-04-27 10:53:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 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:53:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2022-04-27 10:53:26,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 22 transitions. [2022-04-27 10:53:26,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:26,487 INFO L225 Difference]: With dead ends: 21 [2022-04-27 10:53:26,487 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:53:26,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 10:53:26,489 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:26,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:53:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:53:26,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:26,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:53:26,491 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:53:26,491 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:53:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:26,491 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:26,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:26,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:26,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:53:26,492 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:53:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:26,492 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:26,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:26,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:26,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:26,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:53:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:53:26,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 10:53:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:26,493 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:53:26,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 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:53:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:26,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:26,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:53:26,521 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:53:26,696 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,SelfDestructingSolverStorable2 [2022-04-27 10:53:26,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:53:26,792 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:53:26,792 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:53:26,792 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:53:26,792 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:53:26,793 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:26,793 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:26,793 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:26,793 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 39) the Hoare annotation is: true [2022-04-27 10:53:26,793 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 34) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-27 10:53:26,794 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 10:53:26,794 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 24 39) no Hoare annotation was computed. [2022-04-27 10:53:26,794 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 39) no Hoare annotation was computed. [2022-04-27 10:53:26,794 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 39) no Hoare annotation was computed. [2022-04-27 10:53:26,796 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2022-04-27 10:53:26,796 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2022-04-27 10:53:26,797 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:26,799 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:53:26,799 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:26,800 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:26,800 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:53:26,800 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:53:26,800 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:26,800 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:26,800 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:53:26,801 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:26,801 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:53:26,801 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:53:26,801 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:53:26,804 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-27 10:53:26,805 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:53:26,808 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:26,808 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:26,808 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:26,809 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:53:26,809 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:26,809 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:26,809 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:53:26,809 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:26,809 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 10:53:26,810 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 10:53:26,811 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:26,812 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:26,812 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:53:26,812 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:53:26,812 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 10:53:26,812 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 10:53:26,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:53:26,812 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:53:26,812 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:53:26,812 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:53:26,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:53:26 BoogieIcfgContainer [2022-04-27 10:53:26,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:53:26,820 INFO L158 Benchmark]: Toolchain (without parser) took 5258.13ms. Allocated memory was 192.9MB in the beginning and 234.9MB in the end (delta: 41.9MB). Free memory was 141.1MB in the beginning and 91.6MB in the end (delta: 49.5MB). Peak memory consumption was 92.4MB. Max. memory is 8.0GB. [2022-04-27 10:53:26,820 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 192.9MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:53:26,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.04ms. Allocated memory was 192.9MB in the beginning and 234.9MB in the end (delta: 41.9MB). Free memory was 141.0MB in the beginning and 209.4MB in the end (delta: -68.5MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-27 10:53:26,821 INFO L158 Benchmark]: Boogie Preprocessor took 32.50ms. Allocated memory is still 234.9MB. Free memory was 209.4MB in the beginning and 207.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:53:26,821 INFO L158 Benchmark]: RCFGBuilder took 295.25ms. Allocated memory is still 234.9MB. Free memory was 207.8MB in the beginning and 196.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:53:26,821 INFO L158 Benchmark]: TraceAbstraction took 4688.78ms. Allocated memory is still 234.9MB. Free memory was 195.8MB in the beginning and 91.6MB in the end (delta: 104.2MB). Peak memory consumption was 104.7MB. Max. memory is 8.0GB. [2022-04-27 10:53:26,822 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.37ms. Allocated memory is still 192.9MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.04ms. Allocated memory was 192.9MB in the beginning and 234.9MB in the end (delta: 41.9MB). Free memory was 141.0MB in the beginning and 209.4MB in the end (delta: -68.5MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.50ms. Allocated memory is still 234.9MB. Free memory was 209.4MB in the beginning and 207.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 295.25ms. Allocated memory is still 234.9MB. Free memory was 207.8MB in the beginning and 196.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4688.78ms. Allocated memory is still 234.9MB. Free memory was 195.8MB in the beginning and 91.6MB in the end (delta: 104.2MB). Peak memory consumption was 104.7MB. 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: 4.6s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 39 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 38, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 35 HoareAnnotationTreeSize, 12 FomulaSimplifications, 19 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 289 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 680 SizeOfPredicates, 12 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 1/33 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: 31]: Loop Invariant Derived loop invariant: i + y <= j + x && j + x <= i + y RESULT: Ultimate proved your program to be correct! [2022-04-27 10:53:26,859 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...