/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/cggmp2005_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:50:43,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:50:43,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:50:43,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:50:43,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:50:43,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:50:43,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:50:43,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:50:43,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:50:43,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:50:43,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:50:43,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:50:43,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:50:43,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:50:43,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:50:43,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:50:43,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:50:43,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:50:43,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:50:43,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:50:43,999 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:50:44,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:50:44,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:50:44,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:50:44,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:50:44,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:50:44,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:50:44,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:50:44,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:50:44,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:50:44,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:50:44,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:50:44,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:50:44,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:50:44,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:50:44,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:50:44,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:50:44,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:50:44,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:50:44,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:50:44,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:50:44,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:50:44,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:50:44,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:50:44,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:50:44,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:50:44,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:50:44,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:50:44,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:50:44,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:50:44,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:50:44,038 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:50:44,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:50:44,038 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:50:44,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:50:44,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:50:44,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:50:44,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:50:44,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:50:44,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:50:44,040 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:50:44,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:50:44,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:50:44,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:50:44,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:50:44,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:50:44,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:50:44,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:50:44,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:50:44,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:50:44,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:50:44,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:50:44,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:50:44,042 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:50:44,042 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:50:44,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:50:44,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:50:44,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:50:44,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:50:44,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:50:44,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:50:44,299 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:50:44,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2022-04-27 10:50:44,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873737ce9/560bf39b256d4d7eab8c4c388661f31a/FLAG3deb37624 [2022-04-27 10:50:44,724 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:50:44,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2022-04-27 10:50:44,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873737ce9/560bf39b256d4d7eab8c4c388661f31a/FLAG3deb37624 [2022-04-27 10:50:44,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873737ce9/560bf39b256d4d7eab8c4c388661f31a [2022-04-27 10:50:44,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:50:44,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:50:44,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:50:44,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:50:44,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:50:44,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ec9005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44, skipping insertion in model container [2022-04-27 10:50:44,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:50:44,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:50:44,905 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/cggmp2005_variant.i[895,908] [2022-04-27 10:50:44,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:50:44,922 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:50:44,933 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/cggmp2005_variant.i[895,908] [2022-04-27 10:50:44,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:50:44,946 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:50:44,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44 WrapperNode [2022-04-27 10:50:44,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:50:44,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:50:44,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:50:44,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:50:44,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:50:44,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:50:44,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:50:44,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:50:44,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (1/1) ... [2022-04-27 10:50:44,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:50:44,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:45,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:50:45,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:50:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:50:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:50:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:50:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:50:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:50:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:50:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:50:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:50:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:50:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:50:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:50:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:50:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:50:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:50:45,112 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:50:45,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:50:45,207 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:50:45,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:50:45,214 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:50:45,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:50:45 BoogieIcfgContainer [2022-04-27 10:50:45,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:50:45,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:50:45,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:50:45,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:50:45,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:50:44" (1/3) ... [2022-04-27 10:50:45,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f2d0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:50:45, skipping insertion in model container [2022-04-27 10:50:45,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:44" (2/3) ... [2022-04-27 10:50:45,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f2d0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:50:45, skipping insertion in model container [2022-04-27 10:50:45,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:50:45" (3/3) ... [2022-04-27 10:50:45,222 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.i [2022-04-27 10:50:45,234 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:50:45,234 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:50:45,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:50:45,278 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@69190f9b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1411bc0d [2022-04-27 10:50:45,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:50:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:50:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:50:45,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:45,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:45,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 253912119, now seen corresponding path program 1 times [2022-04-27 10:50:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:45,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541523302] [2022-04-27 10:50:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:45,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-27 10:50:45,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:50:45,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-27 10:50:45,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:45,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-27 10:50:45,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:50:45,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-27 10:50:45,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-27 10:50:45,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2022-04-27 10:50:45,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {28#(not (<= main_~mid~0 0))} is VALID [2022-04-27 10:50:45,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(not (<= main_~mid~0 0))} assume !(~mid~0 > 0); {24#false} is VALID [2022-04-27 10:50:45,494 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {24#false} is VALID [2022-04-27 10:50:45,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 10:50:45,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 10:50:45,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 10:50:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:45,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:45,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541523302] [2022-04-27 10:50:45,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541523302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:50:45,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:50:45,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:50:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503548242] [2022-04-27 10:50:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:50:45,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:50:45,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:45,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:45,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:45,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:50:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:50:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:50:45,547 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:45,649 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 10:50:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:50:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:50:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-27 10:50:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-27 10:50:45,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-27 10:50:45,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:45,739 INFO L225 Difference]: With dead ends: 33 [2022-04-27 10:50:45,739 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 10:50:45,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:50:45,749 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:45,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:50:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 10:50:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 10:50:45,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:45,773 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:50:45,773 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:50:45,773 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:50:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:45,776 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 10:50:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:50:45,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:45,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:45,777 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:50:45,777 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:50:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:45,779 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 10:50:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:50:45,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:45,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:45,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:45,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:45,781 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:50:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 10:50:45,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 10:50:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:45,784 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 10:50:45,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:50:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:50:45,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:45,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:45,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:50:45,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash -684163825, now seen corresponding path program 1 times [2022-04-27 10:50:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:45,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033309028] [2022-04-27 10:50:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:46,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#(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); {127#true} is VALID [2022-04-27 10:50:46,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 10:50:46,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127#true} {127#true} #54#return; {127#true} is VALID [2022-04-27 10:50:46,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:46,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#(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); {127#true} is VALID [2022-04-27 10:50:46,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 10:50:46,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #54#return; {127#true} is VALID [2022-04-27 10:50:46,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret2 := main(); {127#true} is VALID [2022-04-27 10:50:46,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {132#(= main_~lo~0 0)} is VALID [2022-04-27 10:50:46,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {133#(and (= main_~lo~0 0) (<= 2 main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-27 10:50:46,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(and (= main_~lo~0 0) (<= 2 main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {134#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} is VALID [2022-04-27 10:50:46,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {135#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-27 10:50:46,035 INFO L272 TraceCheckUtils]: 9: Hoare triple {135#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {136#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:50:46,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {137#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:50:46,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {128#false} is VALID [2022-04-27 10:50:46,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 10:50:46,037 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:50:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:46,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033309028] [2022-04-27 10:50:46,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033309028] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:50:46,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406531870] [2022-04-27 10:50:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:46,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:46,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:50:46,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:50:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:46,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 10:50:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:46,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:50:47,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-27 10:50:47,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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); {127#true} is VALID [2022-04-27 10:50:47,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 10:50:47,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #54#return; {127#true} is VALID [2022-04-27 10:50:47,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret2 := main(); {127#true} is VALID [2022-04-27 10:50:47,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {132#(= main_~lo~0 0)} is VALID [2022-04-27 10:50:47,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {160#(and (= main_~lo~0 0) (< 0 main_~mid~0) (= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-27 10:50:47,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#(and (= main_~lo~0 0) (< 0 main_~mid~0) (= main_~hi~0 (* main_~mid~0 2)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {164#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) (+ main_~mid~0 1)) (= main_~lo~0 1))} is VALID [2022-04-27 10:50:47,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) (+ main_~mid~0 1)) (= main_~lo~0 1))} assume !(~mid~0 > 0); {168#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) 1) (= main_~lo~0 1))} is VALID [2022-04-27 10:50:47,017 INFO L272 TraceCheckUtils]: 9: Hoare triple {168#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) 1) (= main_~lo~0 1))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:47,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:47,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {128#false} is VALID [2022-04-27 10:50:47,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 10:50:47,019 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:50:47,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:50:47,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 10:50:47,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {128#false} is VALID [2022-04-27 10:50:47,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:47,283 INFO L272 TraceCheckUtils]: 9: Hoare triple {135#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:47,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} assume !(~mid~0 > 0); {135#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-27 10:50:47,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {195#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} is VALID [2022-04-27 10:50:47,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {199#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)))} is VALID [2022-04-27 10:50:47,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {132#(= main_~lo~0 0)} is VALID [2022-04-27 10:50:47,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret2 := main(); {127#true} is VALID [2022-04-27 10:50:47,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #54#return; {127#true} is VALID [2022-04-27 10:50:47,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 10:50:47,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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); {127#true} is VALID [2022-04-27 10:50:47,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-27 10:50:47,291 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:50:47,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406531870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:50:47,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:50:47,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 10:50:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143451748] [2022-04-27 10:50:47,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:50:47,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:50:47,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:47,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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:50:47,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:47,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 10:50:47,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 10:50:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:50:47,321 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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:50:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:47,598 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 10:50:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:50:47,598 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:50:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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:50:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-27 10:50:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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:50:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-27 10:50:47,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-27 10:50:47,627 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:50:47,629 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:50:47,630 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:50:47,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:50:47,632 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:47,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 52 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:50:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:50:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:50:47,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:47,642 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:50:47,643 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:50:47,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:50:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:47,646 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:50:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:50:47,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:47,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:47,646 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:50:47,647 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:50:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:47,651 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:50:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:50:47,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:47,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:47,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:47,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:47,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:50:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 10:50:47,653 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 10:50:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:47,653 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 10:50:47,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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:50:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:50:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:50:47,654 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:47,654 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:47,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:50:47,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:47,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:47,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash 300252983, now seen corresponding path program 2 times [2022-04-27 10:50:47,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:47,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790936478] [2022-04-27 10:50:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:47,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:48,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:48,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {332#(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); {320#true} is VALID [2022-04-27 10:50:48,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2022-04-27 10:50:48,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #54#return; {320#true} is VALID [2022-04-27 10:50:48,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:48,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#(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); {320#true} is VALID [2022-04-27 10:50:48,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2022-04-27 10:50:48,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #54#return; {320#true} is VALID [2022-04-27 10:50:48,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret2 := main(); {320#true} is VALID [2022-04-27 10:50:48,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {325#(= main_~lo~0 0)} is VALID [2022-04-27 10:50:48,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {326#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-27 10:50:48,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {327#(and (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (<= (+ main_~lo~0 (* main_~mid~0 2)) main_~hi~0))} is VALID [2022-04-27 10:50:48,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#(and (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (<= (+ main_~lo~0 (* main_~mid~0 2)) main_~hi~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {328#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} is VALID [2022-04-27 10:50:48,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {329#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-27 10:50:48,042 INFO L272 TraceCheckUtils]: 10: Hoare triple {329#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {330#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:50:48,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {331#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:50:48,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {321#false} is VALID [2022-04-27 10:50:48,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {321#false} assume !false; {321#false} is VALID [2022-04-27 10:50:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:48,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790936478] [2022-04-27 10:50:48,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790936478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:50:48,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971602736] [2022-04-27 10:50:48,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:50:48,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:48,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:50:48,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:50:48,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:50:48,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:50:48,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 10:50:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:48,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:50:48,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {320#true} is VALID [2022-04-27 10:50:48,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#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); {320#true} is VALID [2022-04-27 10:50:48,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2022-04-27 10:50:48,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #54#return; {320#true} is VALID [2022-04-27 10:50:48,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret2 := main(); {320#true} is VALID [2022-04-27 10:50:48,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {325#(= main_~lo~0 0)} is VALID [2022-04-27 10:50:48,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {326#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-27 10:50:48,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {357#(and (= (+ (- 1) main_~lo~0) 0) (<= (+ (* main_~mid~0 2) 1) main_~hi~0) (<= main_~hi~0 (+ (* main_~mid~0 2) 1)))} is VALID [2022-04-27 10:50:48,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(and (= (+ (- 1) main_~lo~0) 0) (<= (+ (* main_~mid~0 2) 1) main_~hi~0) (<= main_~hi~0 (+ (* main_~mid~0 2) 1)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {361#(and (< 0 (div main_~hi~0 2)) (<= (div (* (- 1) main_~hi~0) (- 2)) (+ main_~mid~0 1)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) (div main_~hi~0 2)))} is VALID [2022-04-27 10:50:48,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#(and (< 0 (div main_~hi~0 2)) (<= (div (* (- 1) main_~hi~0) (- 2)) (+ main_~mid~0 1)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) (div main_~hi~0 2)))} assume !(~mid~0 > 0); {365#(and (< 0 (div main_~hi~0 2)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) 1))} is VALID [2022-04-27 10:50:48,905 INFO L272 TraceCheckUtils]: 10: Hoare triple {365#(and (< 0 (div main_~hi~0 2)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) 1))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:48,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:48,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {373#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {321#false} is VALID [2022-04-27 10:50:48,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {321#false} assume !false; {321#false} is VALID [2022-04-27 10:50:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:48,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:50:49,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {321#false} assume !false; {321#false} is VALID [2022-04-27 10:50:49,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {373#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {321#false} is VALID [2022-04-27 10:50:49,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:49,174 INFO L272 TraceCheckUtils]: 10: Hoare triple {329#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:49,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} assume !(~mid~0 > 0); {329#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-27 10:50:49,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)) (not (< 0 main_~mid~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {392#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} is VALID [2022-04-27 10:50:49,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {400#(or (not (< 1 main_~mid~0)) (< 2 main_~mid~0) (and (< main_~hi~0 (+ 5 main_~lo~0)) (<= (+ main_~lo~0 4) main_~hi~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {396#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)) (not (< 0 main_~mid~0)))} is VALID [2022-04-27 10:50:49,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {400#(or (not (< 1 main_~mid~0)) (< 2 main_~mid~0) (and (< main_~hi~0 (+ 5 main_~lo~0)) (<= (+ main_~lo~0 4) main_~hi~0)))} is VALID [2022-04-27 10:50:49,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {325#(= main_~lo~0 0)} is VALID [2022-04-27 10:50:49,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret2 := main(); {320#true} is VALID [2022-04-27 10:50:49,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #54#return; {320#true} is VALID [2022-04-27 10:50:49,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2022-04-27 10:50:49,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#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); {320#true} is VALID [2022-04-27 10:50:49,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {320#true} is VALID [2022-04-27 10:50:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:49,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971602736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:50:49,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:50:49,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-27 10:50:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613262057] [2022-04-27 10:50:49,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:50:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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:50:49,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:49,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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:50:49,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:49,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:50:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:49,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:50:49,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:50:49,204 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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:50:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:49,681 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 10:50:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:50:49,682 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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:50:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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:50:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2022-04-27 10:50:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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:50:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2022-04-27 10:50:49,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 18 transitions. [2022-04-27 10:50:49,708 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:50:49,709 INFO L225 Difference]: With dead ends: 17 [2022-04-27 10:50:49,709 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:50:49,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:50:49,710 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:49,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:50:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:50:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:50:49,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:49,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:50:49,712 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:50:49,712 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:50:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:49,712 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:50:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:49,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:49,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:49,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:50:49,713 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:50:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:49,713 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:50:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:49,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:49,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:49,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:49,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:50:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:50:49,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 10:50:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:49,714 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:50:49,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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:50:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:49,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:49,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:50:49,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:50:49,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 10:50:49,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:50:50,053 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:50:50,054 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:50:50,054 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:50:50,054 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:50:50,054 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:50,054 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:50,054 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:50,055 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-27 10:50:50,055 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 10:50:50,055 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 34) the Hoare annotation is: (let ((.cse0 (+ main_~lo~0 (* main_~mid~0 2)))) (and (<= main_~hi~0 .cse0) (<= main_~lo~0 main_~hi~0) (<= .cse0 main_~hi~0))) [2022-04-27 10:50:50,055 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 34) the Hoare annotation is: (or (let ((.cse0 (+ main_~lo~0 (* main_~mid~0 2)))) (and (<= main_~hi~0 .cse0) (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)) (<= .cse0 main_~hi~0))) (let ((.cse1 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)))) (and (< 0 .cse1) (= (mod (+ main_~hi~0 1) 2) 0) (<= .cse1 1) (<= .cse1 (+ main_~mid~0 1)) (= main_~lo~0 1)))) [2022-04-27 10:50:50,055 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 37) no Hoare annotation was computed. [2022-04-27 10:50:50,055 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 37) no Hoare annotation was computed. [2022-04-27 10:50:50,055 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 10:50:50,055 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:50:50,056 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:50:50,056 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:50:50,056 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:50:50,056 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:50:50,056 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:50:50,056 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:50:50,056 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:50:50,056 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:50:50,056 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:50:50,057 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:50:50,057 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:50:50,057 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:50:50,060 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-27 10:50:50,062 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:50:50,065 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:50:50,065 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:50:50,065 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:50:50,066 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:50,067 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:50,067 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:50:50,067 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:50:50,067 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:50:50,067 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:50:50,071 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:50:50,071 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:50:50,071 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:50:50,071 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:50:50,071 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:50:50,071 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:50:50,071 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:50:50,071 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:50:50,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:50:50 BoogieIcfgContainer [2022-04-27 10:50:50,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:50:50,080 INFO L158 Benchmark]: Toolchain (without parser) took 5337.88ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 123.9MB in the beginning and 86.7MB in the end (delta: 37.2MB). Peak memory consumption was 73.1MB. Max. memory is 8.0GB. [2022-04-27 10:50:50,080 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:50:50,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.45ms. Allocated memory is still 175.1MB. Free memory was 123.7MB in the beginning and 149.8MB in the end (delta: -26.1MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 10:50:50,081 INFO L158 Benchmark]: Boogie Preprocessor took 30.45ms. Allocated memory is still 175.1MB. Free memory was 149.8MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:50:50,081 INFO L158 Benchmark]: RCFGBuilder took 236.64ms. Allocated memory is still 175.1MB. Free memory was 148.2MB in the beginning and 137.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:50:50,081 INFO L158 Benchmark]: TraceAbstraction took 4861.97ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 137.2MB in the beginning and 86.7MB in the end (delta: 50.5MB). Peak memory consumption was 87.2MB. Max. memory is 8.0GB. [2022-04-27 10:50:50,083 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.13ms. Allocated memory is still 175.1MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.45ms. Allocated memory is still 175.1MB. Free memory was 123.7MB in the beginning and 149.8MB in the end (delta: -26.1MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.45ms. Allocated memory is still 175.1MB. Free memory was 149.8MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 236.64ms. Allocated memory is still 175.1MB. Free memory was 148.2MB in the beginning and 137.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4861.97ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 137.2MB in the beginning and 86.7MB in the end (delta: 50.5MB). Peak memory consumption was 87.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 37 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 16 NumberOfFragments, 93 HoareAnnotationTreeSize, 10 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 121 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/12 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: 30]: Loop Invariant Derived loop invariant: (hi <= lo + mid * 2 && lo <= hi) && lo + mid * 2 <= hi RESULT: Ultimate proved your program to be correct! [2022-04-27 10:50:50,101 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...