/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/hhk2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:53:12,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:53:12,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:53:12,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:53:12,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:53:12,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:53:12,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:53:12,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:53:12,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:53:12,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:53:12,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:53:12,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:53:12,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:53:12,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:53:12,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:53:12,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:53:12,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:53:12,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:53:12,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:53:12,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:53:12,967 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:53:12,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:53:12,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:53:12,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:53:12,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:53:12,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:53:12,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:53:12,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:53:12,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:53:12,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:53:12,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:53:12,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:53:12,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:53:12,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:53:12,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:53:12,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:53:12,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:53:12,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:53:12,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:53:12,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:53:12,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:53:12,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:53:12,983 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:13,018 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:53:13,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:53:13,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:53:13,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:53:13,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:53:13,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:53:13,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:53:13,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:53:13,020 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:53:13,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:53:13,021 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:53:13,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:53:13,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:53:13,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:53:13,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:53:13,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:53:13,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:53:13,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:53:13,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:53:13,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:53:13,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:53:13,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:53:13,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:53:13,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:53:13,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:13,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:53:13,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:53:13,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:53:13,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:53:13,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:53:13,023 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:53:13,023 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:53:13,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:53:13,024 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:13,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:53:13,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:53:13,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:53:13,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:53:13,260 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:53:13,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i [2022-04-27 10:53:13,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a2ea38f/907b745aad964011a47f650624df7f59/FLAG139a2e7b9 [2022-04-27 10:53:13,689 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:53:13,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i [2022-04-27 10:53:13,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a2ea38f/907b745aad964011a47f650624df7f59/FLAG139a2e7b9 [2022-04-27 10:53:14,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a2ea38f/907b745aad964011a47f650624df7f59 [2022-04-27 10:53:14,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:53:14,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:53:14,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:14,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:53:14,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:53:14,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:14" (1/1) ... [2022-04-27 10:53:14,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150eddca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:14, skipping insertion in model container [2022-04-27 10:53:14,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:14" (1/1) ... [2022-04-27 10:53:14,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:53:14,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:53:14,270 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/hhk2008.i[895,908] [2022-04-27 10:53:14,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:14,312 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:53:14,324 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/hhk2008.i[895,908] [2022-04-27 10:53:14,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:14,338 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:53:14,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:14 WrapperNode [2022-04-27 10:53:14,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:14,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:53:14,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:53:14,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:53:14,346 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:14" (1/1) ... [2022-04-27 10:53:14,347 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:14" (1/1) ... [2022-04-27 10:53:14,351 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:14" (1/1) ... [2022-04-27 10:53:14,351 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:14" (1/1) ... [2022-04-27 10:53:14,356 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:14" (1/1) ... [2022-04-27 10:53:14,360 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:14" (1/1) ... [2022-04-27 10:53:14,361 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:14" (1/1) ... [2022-04-27 10:53:14,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:53:14,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:53:14,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:53:14,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:53:14,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:14" (1/1) ... [2022-04-27 10:53:14,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:14,389 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:14,397 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:14,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:53:14,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:53:14,420 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:53:14,420 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:53:14,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:53:14,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:53:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:53:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:53:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:53:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:53:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:53:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:53:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:53:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:53:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:53:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:53:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:53:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:53:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:53:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:53:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:53:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:53:14,473 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:53:14,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:53:14,593 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:53:14,598 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:53:14,599 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:53:14,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:14 BoogieIcfgContainer [2022-04-27 10:53:14,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:53:14,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:53:14,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:53:14,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:53:14,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:53:14" (1/3) ... [2022-04-27 10:53:14,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7e498e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:14, skipping insertion in model container [2022-04-27 10:53:14,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:14" (2/3) ... [2022-04-27 10:53:14,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7e498e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:14, skipping insertion in model container [2022-04-27 10:53:14,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:14" (3/3) ... [2022-04-27 10:53:14,607 INFO L111 eAbstractionObserver]: Analyzing ICFG hhk2008.i [2022-04-27 10:53:14,620 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:53:14,620 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:53:14,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:53:14,662 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@26d87e31, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60a1a20b [2022-04-27 10:53:14,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:53:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:53:14,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:14,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:14,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash 499112448, now seen corresponding path program 1 times [2022-04-27 10:53:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:14,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462675549] [2022-04-27 10:53:14,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:14,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-27 10:53:14,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:53:14,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID [2022-04-27 10:53:14,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:14,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-27 10:53:14,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:53:14,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID [2022-04-27 10:53:14,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-27 10:53:14,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {24#true} is VALID [2022-04-27 10:53:14,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~a~0 <= 1000000); {24#true} is VALID [2022-04-27 10:53:14,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {24#true} is VALID [2022-04-27 10:53:14,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-27 10:53:14,961 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {25#false} is VALID [2022-04-27 10:53:14,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-27 10:53:14,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-27 10:53:14,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 10:53:14,962 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:14,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:14,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462675549] [2022-04-27 10:53:14,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462675549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:14,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:14,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:53:14,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926790149] [2022-04-27 10:53:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:14,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:14,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:14,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:15,005 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:15,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:53:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:53:15,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:53:15,040 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:15,139 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 10:53:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:53:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 10:53:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 10:53:15,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-27 10:53:15,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:15,225 INFO L225 Difference]: With dead ends: 33 [2022-04-27 10:53:15,225 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 10:53:15,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:53:15,233 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:15,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:53:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 10:53:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 10:53:15,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:15,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:15,266 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:15,267 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:15,271 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 10:53:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:53:15,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:15,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:15,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 10:53:15,273 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 10:53:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:15,275 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 10:53:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:53:15,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:15,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:15,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:15,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 10:53:15,278 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2022-04-27 10:53:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:15,279 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 10:53:15,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:53:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:53:15,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:15,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:15,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:53:15,281 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash 495418364, now seen corresponding path program 1 times [2022-04-27 10:53:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:15,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096979192] [2022-04-27 10:53:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:15,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {123#true} is VALID [2022-04-27 10:53:15,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume true; {123#true} is VALID [2022-04-27 10:53:15,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} #58#return; {123#true} is VALID [2022-04-27 10:53:15,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} call ULTIMATE.init(); {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:15,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {123#true} is VALID [2022-04-27 10:53:15,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} assume true; {123#true} is VALID [2022-04-27 10:53:15,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} #58#return; {123#true} is VALID [2022-04-27 10:53:15,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} call #t~ret3 := main(); {123#true} is VALID [2022-04-27 10:53:15,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {123#true} is VALID [2022-04-27 10:53:15,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#true} assume !!(~a~0 <= 1000000); {123#true} is VALID [2022-04-27 10:53:15,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {128#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID [2022-04-27 10:53:15,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} assume !(~cnt~0 > 0); {129#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 10:53:15,442 INFO L272 TraceCheckUtils]: 9: Hoare triple {129#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {130#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:15,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {131#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:15,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {131#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {124#false} is VALID [2022-04-27 10:53:15,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-04-27 10:53:15,444 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:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:15,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096979192] [2022-04-27 10:53:15,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096979192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:15,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:15,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:53:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547220695] [2022-04-27 10:53:15,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:15,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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:15,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:15,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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:15,458 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:15,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:53:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:15,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:53:15,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:53:15,460 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:15,599 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 10:53:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:53:15,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-27 10:53:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-27 10:53:15,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-27 10:53:15,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:15,628 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:53:15,628 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:53:15,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:53:15,634 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:15,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:53:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:53:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:53:15,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:15,644 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:15,644 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:15,644 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:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:15,647 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:53:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:15,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:15,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:15,648 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:15,649 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:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:15,651 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:53:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:15,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:15,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:15,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:15,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:15,652 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:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 10:53:15,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 10:53:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:15,655 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 10:53:15,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:53:15,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:15,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:15,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:53:15,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1787404818, now seen corresponding path program 1 times [2022-04-27 10:53:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:15,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079741119] [2022-04-27 10:53:15,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:15,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:15,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(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); {226#true} is VALID [2022-04-27 10:53:15,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} assume true; {226#true} is VALID [2022-04-27 10:53:15,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} #58#return; {226#true} is VALID [2022-04-27 10:53:15,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:15,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(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); {226#true} is VALID [2022-04-27 10:53:15,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} assume true; {226#true} is VALID [2022-04-27 10:53:15,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} #58#return; {226#true} is VALID [2022-04-27 10:53:15,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} call #t~ret3 := main(); {226#true} is VALID [2022-04-27 10:53:15,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {226#true} is VALID [2022-04-27 10:53:15,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} assume !!(~a~0 <= 1000000); {226#true} is VALID [2022-04-27 10:53:15,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {231#(and (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 10:53:15,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(and (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {232#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID [2022-04-27 10:53:15,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} assume !(~cnt~0 > 0); {233#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 10:53:15,806 INFO L272 TraceCheckUtils]: 10: Hoare triple {233#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:15,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {235#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:15,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {227#false} is VALID [2022-04-27 10:53:15,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} assume !false; {227#false} is VALID [2022-04-27 10:53:15,820 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:15,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:15,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079741119] [2022-04-27 10:53:15,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079741119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:15,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714232511] [2022-04-27 10:53:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:15,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:15,823 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:15,866 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:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:15,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:53:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:15,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:16,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2022-04-27 10:53:16,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#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); {226#true} is VALID [2022-04-27 10:53:16,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} assume true; {226#true} is VALID [2022-04-27 10:53:16,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} #58#return; {226#true} is VALID [2022-04-27 10:53:16,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} call #t~ret3 := main(); {226#true} is VALID [2022-04-27 10:53:16,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {226#true} is VALID [2022-04-27 10:53:16,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} assume !!(~a~0 <= 1000000); {226#true} is VALID [2022-04-27 10:53:16,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {261#(and (= main_~cnt~0 main_~b~0) (= main_~res~0 main_~a~0))} is VALID [2022-04-27 10:53:16,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(and (= main_~cnt~0 main_~b~0) (= main_~res~0 main_~a~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {265#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 (+ main_~cnt~0 1)) (< 0 main_~b~0))} is VALID [2022-04-27 10:53:16,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {265#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 (+ main_~cnt~0 1)) (< 0 main_~b~0))} assume !(~cnt~0 > 0); {269#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 1) (< 0 main_~b~0))} is VALID [2022-04-27 10:53:16,245 INFO L272 TraceCheckUtils]: 10: Hoare triple {269#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 1) (< 0 main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:16,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:16,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {227#false} is VALID [2022-04-27 10:53:16,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} assume !false; {227#false} is VALID [2022-04-27 10:53:16,247 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:16,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:16,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} assume !false; {227#false} is VALID [2022-04-27 10:53:16,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {227#false} is VALID [2022-04-27 10:53:16,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:16,430 INFO L272 TraceCheckUtils]: 10: Hoare triple {233#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:16,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (< 0 main_~cnt~0))} assume !(~cnt~0 > 0); {233#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 10:53:16,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(or (< 1 main_~cnt~0) (not (< 0 main_~cnt~0)) (and (< main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~res~0 1))))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {296#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (< 0 main_~cnt~0))} is VALID [2022-04-27 10:53:16,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {300#(or (< 1 main_~cnt~0) (not (< 0 main_~cnt~0)) (and (< main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~res~0 1))))} is VALID [2022-04-27 10:53:16,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} assume !!(~a~0 <= 1000000); {226#true} is VALID [2022-04-27 10:53:16,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {226#true} is VALID [2022-04-27 10:53:16,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} call #t~ret3 := main(); {226#true} is VALID [2022-04-27 10:53:16,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} #58#return; {226#true} is VALID [2022-04-27 10:53:16,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} assume true; {226#true} is VALID [2022-04-27 10:53:16,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#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); {226#true} is VALID [2022-04-27 10:53:16,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2022-04-27 10:53:16,434 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:16,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714232511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:16,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:16,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 10:53:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125636893] [2022-04-27 10:53:16,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:16,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:53:16,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:16,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:16,456 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:16,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 10:53:16,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:16,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 10:53:16,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:53:16,457 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:16,816 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 10:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:53:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:53:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2022-04-27 10:53:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2022-04-27 10:53:16,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2022-04-27 10:53:16,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:16,840 INFO L225 Difference]: With dead ends: 17 [2022-04-27 10:53:16,840 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:53:16,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:53:16,842 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:16,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:53:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:53:16,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:16,843 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:16,843 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:16,843 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:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:16,844 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:16,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:16,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:16,844 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:16,844 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:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:16,844 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:16,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:16,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:16,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:16,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:16,845 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:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:53:16,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 10:53:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:16,845 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:53:16,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:16,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:16,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:53:16,873 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:17,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:17,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:53:17,133 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:53:17,133 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:53:17,133 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:53:17,133 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:53:17,133 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:17,133 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:17,133 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:17,134 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse1 (+ main_~cnt~0 main_~res~0)) (.cse0 (+ main_~b~0 main_~a~0))) (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-27 10:53:17,134 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 38) the Hoare annotation is: true [2022-04-27 10:53:17,134 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 10:53:17,134 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) [2022-04-27 10:53:17,134 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 10:53:17,134 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 38) no Hoare annotation was computed. [2022-04-27 10:53:17,134 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 38) no Hoare annotation was computed. [2022-04-27 10:53:17,134 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-04-27 10:53:17,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:17,134 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:17,135 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:17,135 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:17,135 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:53:17,135 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:53:17,135 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:17,135 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:17,135 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:53:17,135 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:17,135 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:53:17,136 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:53:17,136 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:53:17,138 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 10:53:17,140 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:53:17,143 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:17,143 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:17,143 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:17,148 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:53:17,149 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:53:17,155 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:53:17,155 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:53:17,155 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:53:17,155 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:53:17,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:53:17 BoogieIcfgContainer [2022-04-27 10:53:17,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:53:17,165 INFO L158 Benchmark]: Toolchain (without parser) took 3050.33ms. Allocated memory was 187.7MB in the beginning and 238.0MB in the end (delta: 50.3MB). Free memory was 127.3MB in the beginning and 124.3MB in the end (delta: 3.0MB). Peak memory consumption was 53.2MB. Max. memory is 8.0GB. [2022-04-27 10:53:17,165 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:53:17,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.84ms. Allocated memory was 187.7MB in the beginning and 238.0MB in the end (delta: 50.3MB). Free memory was 127.1MB in the beginning and 208.4MB in the end (delta: -81.4MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-27 10:53:17,165 INFO L158 Benchmark]: Boogie Preprocessor took 22.47ms. Allocated memory is still 238.0MB. Free memory was 208.4MB in the beginning and 206.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:53:17,166 INFO L158 Benchmark]: RCFGBuilder took 237.80ms. Allocated memory is still 238.0MB. Free memory was 206.9MB in the beginning and 195.8MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:53:17,166 INFO L158 Benchmark]: TraceAbstraction took 2560.62ms. Allocated memory is still 238.0MB. Free memory was 194.8MB in the beginning and 124.8MB in the end (delta: 70.0MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. [2022-04-27 10:53:17,169 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.09ms. Allocated memory is still 187.7MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.84ms. Allocated memory was 187.7MB in the beginning and 238.0MB in the end (delta: 50.3MB). Free memory was 127.1MB in the beginning and 208.4MB in the end (delta: -81.4MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.47ms. Allocated memory is still 238.0MB. Free memory was 208.4MB in the beginning and 206.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 237.80ms. Allocated memory is still 238.0MB. Free memory was 206.9MB in the beginning and 195.8MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2560.62ms. Allocated memory is still 238.0MB. Free memory was 194.8MB in the beginning and 124.8MB in the end (delta: 70.0MB). Peak memory consumption was 69.5MB. 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: 2.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 42 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 20, 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, 10 PreInvPairs, 15 NumberOfFragments, 44 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 251 SizeOfPredicates, 2 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (res < b + a + 1 && b + a <= cnt + res) && cnt + res <= b + a RESULT: Ultimate proved your program to be correct! [2022-04-27 10:53:17,206 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...