/usr/bin/java -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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 02:02:40,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 02:02:40,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 02:02:40,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 02:02:40,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 02:02:40,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 02:02:40,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 02:02:40,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 02:02:40,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 02:02:40,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 02:02:40,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 02:02:40,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 02:02:40,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 02:02:40,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 02:02:40,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 02:02:40,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 02:02:40,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 02:02:40,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 02:02:40,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 02:02:40,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 02:02:40,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 02:02:40,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 02:02:40,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 02:02:40,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 02:02:40,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 02:02:40,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 02:02:40,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 02:02:40,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 02:02:40,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 02:02:40,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 02:02:40,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 02:02:40,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 02:02:40,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 02:02:40,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 02:02:40,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 02:02:40,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 02:02:40,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 02:02:40,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 02:02:40,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 02:02:40,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 02:02:40,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 02:02:40,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 02:02:40,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 02:02:40,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 02:02:40,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 02:02:40,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 02:02:40,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 02:02:40,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 02:02:40,519 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 02:02:40,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 02:02:40,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 02:02:40,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 02:02:40,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 02:02:40,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 02:02:40,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 02:02:40,521 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 02:02:40,521 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 02:02:40,521 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 02:02:40,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 02:02:40,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 02:02:40,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 02:02:40,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 02:02:40,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 02:02:40,522 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 02:02:40,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 02:02:40,524 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 02:02:40,524 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-01-11 02:02:40,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 02:02:40,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 02:02:40,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 02:02:40,719 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 02:02:40,719 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 02:02:40,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-01-11 02:02:40,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b629715/c54c4bd911494bdc845a0a84fa824e6b/FLAG4d134d147 [2022-01-11 02:02:41,123 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 02:02:41,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-01-11 02:02:41,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b629715/c54c4bd911494bdc845a0a84fa824e6b/FLAG4d134d147 [2022-01-11 02:02:41,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b629715/c54c4bd911494bdc845a0a84fa824e6b [2022-01-11 02:02:41,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 02:02:41,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 02:02:41,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 02:02:41,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 02:02:41,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 02:02:41,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa46850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41, skipping insertion in model container [2022-01-11 02:02:41,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 02:02:41,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 02:02:41,671 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-invgen/apache-get-tag.i[893,906] [2022-01-11 02:02:41,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 02:02:41,721 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 02:02:41,746 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-invgen/apache-get-tag.i[893,906] [2022-01-11 02:02:41,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 02:02:41,759 INFO L208 MainTranslator]: Completed translation [2022-01-11 02:02:41,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41 WrapperNode [2022-01-11 02:02:41,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 02:02:41,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 02:02:41,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 02:02:41,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 02:02:41,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,802 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 174 [2022-01-11 02:02:41,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 02:02:41,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 02:02:41,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 02:02:41,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 02:02:41,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 02:02:41,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 02:02:41,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 02:02:41,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 02:02:41,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (1/1) ... [2022-01-11 02:02:41,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 02:02:41,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 02:02:41,864 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-01-11 02:02:41,866 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-01-11 02:02:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 02:02:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 02:02:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 02:02:41,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 02:02:41,947 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 02:02:41,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 02:02:42,129 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 02:02:42,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 02:02:42,146 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-11 02:02:42,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:02:42 BoogieIcfgContainer [2022-01-11 02:02:42,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 02:02:42,148 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 02:02:42,149 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 02:02:42,161 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 02:02:42,163 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:02:42" (1/1) ... [2022-01-11 02:02:42,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 02:02:42 BasicIcfg [2022-01-11 02:02:42,240 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 02:02:42,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 02:02:42,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 02:02:42,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 02:02:42,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 02:02:41" (1/4) ... [2022-01-11 02:02:42,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17731324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:02:42, skipping insertion in model container [2022-01-11 02:02:42,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:41" (2/4) ... [2022-01-11 02:02:42,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17731324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:02:42, skipping insertion in model container [2022-01-11 02:02:42,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:02:42" (3/4) ... [2022-01-11 02:02:42,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17731324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:02:42, skipping insertion in model container [2022-01-11 02:02:42,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 02:02:42" (4/4) ... [2022-01-11 02:02:42,245 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.iTransformedIcfg [2022-01-11 02:02:42,248 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 02:02:42,248 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-11 02:02:42,289 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 02:02:42,293 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 02:02:42,293 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-11 02:02:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 83 states have internal predecessors, (111), 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-01-11 02:02:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-11 02:02:42,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:42,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:42,310 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1189786994, now seen corresponding path program 1 times [2022-01-11 02:02:42,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:42,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833624360] [2022-01-11 02:02:42,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:42,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:42,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:42,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833624360] [2022-01-11 02:02:42,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833624360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:42,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:42,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 02:02:42,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28924470] [2022-01-11 02:02:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:42,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 02:02:42,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:42,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 02:02:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 02:02:42,495 INFO L87 Difference]: Start difference. First operand has 84 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 83 states have internal predecessors, (111), 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 has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-01-11 02:02:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:42,525 INFO L93 Difference]: Finished difference Result 164 states and 217 transitions. [2022-01-11 02:02:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 02:02:42,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2022-01-11 02:02:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:42,534 INFO L225 Difference]: With dead ends: 164 [2022-01-11 02:02:42,534 INFO L226 Difference]: Without dead ends: 76 [2022-01-11 02:02:42,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 02:02:42,544 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:42,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 02:02:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-11 02:02:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-01-11 02:02:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 75 states have internal predecessors, (79), 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-01-11 02:02:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-01-11 02:02:42,584 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 8 [2022-01-11 02:02:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:42,585 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-01-11 02:02:42,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-01-11 02:02:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-01-11 02:02:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-11 02:02:42,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:42,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:42,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 02:02:42,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:42,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1189726386, now seen corresponding path program 1 times [2022-01-11 02:02:42,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:42,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123605984] [2022-01-11 02:02:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:42,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:42,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:42,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123605984] [2022-01-11 02:02:42,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123605984] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:42,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:42,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 02:02:42,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089625291] [2022-01-11 02:02:42,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:42,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 02:02:42,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 02:02:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 02:02:42,684 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-01-11 02:02:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:42,839 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-01-11 02:02:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 02:02:42,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2022-01-11 02:02:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:42,842 INFO L225 Difference]: With dead ends: 103 [2022-01-11 02:02:42,842 INFO L226 Difference]: Without dead ends: 97 [2022-01-11 02:02:42,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-11 02:02:42,846 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:42,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 149 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 02:02:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-11 02:02:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2022-01-11 02:02:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 82 states have internal predecessors, (88), 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-01-11 02:02:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-01-11 02:02:42,865 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 8 [2022-01-11 02:02:42,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:42,865 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-01-11 02:02:42,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-01-11 02:02:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-01-11 02:02:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-11 02:02:42,867 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:42,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:42,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 02:02:42,869 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash -865715369, now seen corresponding path program 1 times [2022-01-11 02:02:42,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:42,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976917618] [2022-01-11 02:02:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:42,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:42,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:42,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976917618] [2022-01-11 02:02:42,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976917618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:42,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:42,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 02:02:42,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840583823] [2022-01-11 02:02:42,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:42,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 02:02:42,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 02:02:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 02:02:42,996 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-01-11 02:02:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:43,107 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-01-11 02:02:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 02:02:43,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2022-01-11 02:02:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:43,111 INFO L225 Difference]: With dead ends: 93 [2022-01-11 02:02:43,111 INFO L226 Difference]: Without dead ends: 80 [2022-01-11 02:02:43,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-11 02:02:43,116 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 45 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:43,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 135 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 02:02:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-11 02:02:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-01-11 02:02:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 69 states have internal predecessors, (74), 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-01-11 02:02:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-01-11 02:02:43,126 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 10 [2022-01-11 02:02:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:43,126 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-01-11 02:02:43,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-01-11 02:02:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-01-11 02:02:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-11 02:02:43,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:43,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:43,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 02:02:43,127 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1036832650, now seen corresponding path program 1 times [2022-01-11 02:02:43,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:43,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185802952] [2022-01-11 02:02:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:43,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:43,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:43,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185802952] [2022-01-11 02:02:43,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185802952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:43,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:43,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 02:02:43,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504092295] [2022-01-11 02:02:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:43,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 02:02:43,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 02:02:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 02:02:43,263 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-01-11 02:02:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:43,375 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-01-11 02:02:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 02:02:43,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2022-01-11 02:02:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:43,376 INFO L225 Difference]: With dead ends: 80 [2022-01-11 02:02:43,376 INFO L226 Difference]: Without dead ends: 76 [2022-01-11 02:02:43,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 02:02:43,377 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:43,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 169 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 02:02:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-11 02:02:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-01-11 02:02:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.278688524590164) internal successors, (78), 73 states have internal predecessors, (78), 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-01-11 02:02:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-01-11 02:02:43,398 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 11 [2022-01-11 02:02:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:43,399 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-01-11 02:02:43,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-01-11 02:02:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-01-11 02:02:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 02:02:43,399 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:43,399 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:43,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 02:02:43,399 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash 501654305, now seen corresponding path program 1 times [2022-01-11 02:02:43,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:43,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56611317] [2022-01-11 02:02:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:43,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:43,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:43,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56611317] [2022-01-11 02:02:43,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56611317] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 02:02:43,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743581067] [2022-01-11 02:02:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:43,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 02:02:43,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 02:02:43,518 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-01-11 02:02:43,529 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-01-11 02:02:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:43,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-11 02:02:43,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 02:02:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:43,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 02:02:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:46,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743581067] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 02:02:46,231 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 02:02:46,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2022-01-11 02:02:46,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915831259] [2022-01-11 02:02:46,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 02:02:46,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-11 02:02:46,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:46,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-11 02:02:46,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2022-01-11 02:02:46,233 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-01-11 02:02:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:46,635 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-01-11 02:02:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 02:02:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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) Word has length 15 [2022-01-11 02:02:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:46,636 INFO L225 Difference]: With dead ends: 76 [2022-01-11 02:02:46,636 INFO L226 Difference]: Without dead ends: 67 [2022-01-11 02:02:46,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=108, Invalid=311, Unknown=1, NotChecked=0, Total=420 [2022-01-11 02:02:46,637 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 241 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:46,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 98 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 175 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-01-11 02:02:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-11 02:02:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-01-11 02:02:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 64 states have internal predecessors, (69), 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-01-11 02:02:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-01-11 02:02:46,643 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 15 [2022-01-11 02:02:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:46,643 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-01-11 02:02:46,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-01-11 02:02:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-01-11 02:02:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 02:02:46,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:46,644 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:46,662 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-01-11 02:02:46,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 02:02:46,844 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1628552675, now seen corresponding path program 1 times [2022-01-11 02:02:46,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:46,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25807160] [2022-01-11 02:02:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:46,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:46,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:46,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25807160] [2022-01-11 02:02:46,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25807160] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 02:02:46,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255260668] [2022-01-11 02:02:46,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:46,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 02:02:46,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 02:02:46,904 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-01-11 02:02:46,904 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-01-11 02:02:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:46,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-11 02:02:46,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 02:02:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:47,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 02:02:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:47,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255260668] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 02:02:47,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 02:02:47,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 17 [2022-01-11 02:02:47,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603435919] [2022-01-11 02:02:47,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 02:02:47,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-11 02:02:47,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-11 02:02:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-01-11 02:02:47,684 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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-01-11 02:02:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:48,653 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2022-01-11 02:02:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 02:02:48,653 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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) Word has length 16 [2022-01-11 02:02:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:48,654 INFO L225 Difference]: With dead ends: 144 [2022-01-11 02:02:48,654 INFO L226 Difference]: Without dead ends: 120 [2022-01-11 02:02:48,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2022-01-11 02:02:48,655 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 468 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:48,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 121 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 02:02:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-11 02:02:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 79. [2022-01-11 02:02:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.162162162162162) internal successors, (86), 78 states have internal predecessors, (86), 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-01-11 02:02:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2022-01-11 02:02:48,665 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 16 [2022-01-11 02:02:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:48,665 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2022-01-11 02:02:48,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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-01-11 02:02:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-01-11 02:02:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-11 02:02:48,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:48,666 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:48,677 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-01-11 02:02:48,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-11 02:02:48,870 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1939025962, now seen corresponding path program 1 times [2022-01-11 02:02:48,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:48,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917480969] [2022-01-11 02:02:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:48,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:49,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:49,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917480969] [2022-01-11 02:02:49,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917480969] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 02:02:49,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713546815] [2022-01-11 02:02:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:49,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 02:02:49,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 02:02:49,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 02:02:49,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 02:02:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:49,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-11 02:02:49,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 02:02:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 02:02:50,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 02:02:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 02:02:50,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713546815] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 02:02:50,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 02:02:50,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 26 [2022-01-11 02:02:50,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801484564] [2022-01-11 02:02:50,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 02:02:50,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-11 02:02:50,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-11 02:02:50,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-01-11 02:02:50,727 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 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-01-11 02:02:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:52,089 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-01-11 02:02:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 02:02:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 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) Word has length 25 [2022-01-11 02:02:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:52,090 INFO L225 Difference]: With dead ends: 114 [2022-01-11 02:02:52,090 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 02:02:52,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-01-11 02:02:52,091 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 485 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:52,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 105 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-11 02:02:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 02:02:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 02:02:52,092 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-01-11 02:02:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 02:02:52,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-01-11 02:02:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:52,092 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 02:02:52,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 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-01-11 02:02:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 02:02:52,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 02:02:52,094 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-01-11 02:02:52,095 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-01-11 02:02:52,096 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-01-11 02:02:52,096 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-01-11 02:02:52,096 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-01-11 02:02:52,096 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-01-11 02:02:52,096 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-01-11 02:02:52,096 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-01-11 02:02:52,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 02:02:52,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 02:02:52,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 02:02:54,378 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 02:02:54,378 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 02:02:54,378 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L861 garLoopResultBuilder]: At program point L75(lines 25 77) the Hoare annotation is: true [2022-01-11 02:02:54,379 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 44) the Hoare annotation is: (or (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1))) (and (<= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (< (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967295)) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) 6442450942) (- 2147483648))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967296)) 4294967296) 1)) (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 4294967296))) [2022-01-11 02:02:54,379 INFO L861 garLoopResultBuilder]: At program point L76(lines 24 77) the Hoare annotation is: true [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point L32-3(lines 32 44) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L858 garLoopResultBuilder]: For program point L19-4(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,379 INFO L854 garLoopResultBuilder]: At program point L18-14(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1))) (or (and .cse0 .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1) (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2)) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) .cse1 (not (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|)) (< (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967295)) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) 6442450942) (- 2147483648))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967296)) 4294967296) 1)) (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 4294967296)))) [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (< (div |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) (+ (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 1))) [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point L19-2(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L854 garLoopResultBuilder]: At program point L18-8(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1))) (or (and .cse0 .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1) (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2)) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) .cse1 (not (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|)) (< (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967295)) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) 6442450942) (- 2147483648))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967296)) 4294967296) 1)) (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 4294967296)))) [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point L19-5(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L854 garLoopResultBuilder]: At program point L18-17(lines 17 22) the Hoare annotation is: (let ((.cse6 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|)) (.cse4 (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648))) (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse1 (<= .cse4 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) (.cse5 (<= (div (+ (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2) .cse6) (- 2147483648)) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* .cse4 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) .cse5) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) .cse2 .cse3 (not (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|)) (< (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967295)) (- 4294967296)) (div (+ .cse6 6442450942) (- 2147483648))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967296)) 4294967296) 1)) .cse5 (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 0))))) [2022-01-11 02:02:54,380 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,380 INFO L861 garLoopResultBuilder]: At program point L18-5(lines 17 22) the Hoare annotation is: true [2022-01-11 02:02:54,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,381 INFO L858 garLoopResultBuilder]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,381 INFO L854 garLoopResultBuilder]: At program point L48-2(lines 48 72) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1))) [2022-01-11 02:02:54,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,381 INFO L858 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,381 INFO L854 garLoopResultBuilder]: At program point L18-11(lines 17 22) the Hoare annotation is: (let ((.cse6 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|)) (.cse4 (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648))) (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse1 (<= .cse4 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) (.cse5 (<= (div (+ (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2) .cse6) (- 2147483648)) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* .cse4 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) .cse5) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) .cse2 .cse3 (not (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|)) (< (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967295)) (- 4294967296)) (div (+ .cse6 6442450942) (- 2147483648))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| (- 4294967296)) 4294967296) 1)) .cse5 (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 0))))) [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L48-3(lines 48 72) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L18-42(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L54(lines 54 68) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L19-14(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L854 garLoopResultBuilder]: At program point L18-44(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1)) (.cse2 (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2))) (or (and .cse0 .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1) .cse2) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) .cse1 (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 1) (not (= |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 0)) (<= (div (+ .cse2 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|)) (- 2147483648)) 0)))) [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L19-6(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L854 garLoopResultBuilder]: At program point L18-20(lines 17 22) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (not (<= (+ (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 1) (div |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648)))) [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L55(lines 55 64) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 68) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,382 INFO L858 garLoopResultBuilder]: For program point L18-45(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L18-24(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 54 68) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L19-15(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L861 garLoopResultBuilder]: At program point L18-47(lines 17 22) the Hoare annotation is: true [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L19-7(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L861 garLoopResultBuilder]: At program point L18-23(lines 17 22) the Hoare annotation is: true [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L19-8(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L854 garLoopResultBuilder]: At program point L18-26(lines 17 22) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1) (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2)) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L18-36(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L18-27(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,383 INFO L858 garLoopResultBuilder]: For program point L19-12(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L854 garLoopResultBuilder]: At program point L18-38(lines 17 22) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1) (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2)) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point L19-9(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L854 garLoopResultBuilder]: At program point L18-29(lines 17 22) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1) (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2)) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point L18-39(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point L19-13(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L854 garLoopResultBuilder]: At program point L18-41(lines 17 22) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 1) (* (mod |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648) 2)) (< |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (<= (+ (* (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|)) [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point L18-30(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point L19-10(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L854 garLoopResultBuilder]: At program point L18-32(lines 17 22) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int|) (not (<= (+ (div |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2147483648) 1) (div |ULTIMATE.start_ULTIMATE.start_main_~tagbuf_len~0#1Int| 2147483648)))) [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,384 INFO L858 garLoopResultBuilder]: For program point L18-33(lines 18 20) no Hoare annotation was computed. [2022-01-11 02:02:54,385 INFO L858 garLoopResultBuilder]: For program point L19-11(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,385 INFO L861 garLoopResultBuilder]: At program point L18-35(lines 17 22) the Hoare annotation is: true [2022-01-11 02:02:54,385 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 02:02:54,387 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:54,388 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 02:02:54,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:02:54 BasicIcfg [2022-01-11 02:02:54,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 02:02:54,458 INFO L158 Benchmark]: Toolchain (without parser) took 12917.88ms. Allocated memory was 169.9MB in the beginning and 291.5MB in the end (delta: 121.6MB). Free memory was 112.7MB in the beginning and 124.8MB in the end (delta: -12.2MB). Peak memory consumption was 112.7MB. Max. memory is 8.0GB. [2022-01-11 02:02:54,458 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 02:02:54,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.39ms. Allocated memory was 169.9MB in the beginning and 242.2MB in the end (delta: 72.4MB). Free memory was 112.5MB in the beginning and 215.1MB in the end (delta: -102.6MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-01-11 02:02:54,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.43ms. Allocated memory is still 242.2MB. Free memory was 215.1MB in the beginning and 212.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 02:02:54,459 INFO L158 Benchmark]: Boogie Preprocessor took 35.80ms. Allocated memory is still 242.2MB. Free memory was 212.9MB in the beginning and 211.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 02:02:54,459 INFO L158 Benchmark]: RCFGBuilder took 308.49ms. Allocated memory is still 242.2MB. Free memory was 211.6MB in the beginning and 196.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-11 02:02:54,459 INFO L158 Benchmark]: IcfgTransformer took 91.28ms. Allocated memory is still 242.2MB. Free memory was 196.9MB in the beginning and 191.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 02:02:54,460 INFO L158 Benchmark]: TraceAbstraction took 12217.04ms. Allocated memory was 242.2MB in the beginning and 291.5MB in the end (delta: 49.3MB). Free memory was 191.1MB in the beginning and 124.8MB in the end (delta: 66.3MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. [2022-01-11 02:02:54,461 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.39ms. Allocated memory was 169.9MB in the beginning and 242.2MB in the end (delta: 72.4MB). Free memory was 112.5MB in the beginning and 215.1MB in the end (delta: -102.6MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.43ms. Allocated memory is still 242.2MB. Free memory was 215.1MB in the beginning and 212.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.80ms. Allocated memory is still 242.2MB. Free memory was 212.9MB in the beginning and 211.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 308.49ms. Allocated memory is still 242.2MB. Free memory was 211.6MB in the beginning and 196.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 91.28ms. Allocated memory is still 242.2MB. Free memory was 196.9MB in the beginning and 191.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 12217.04ms. Allocated memory was 242.2MB in the beginning and 291.5MB in the end (delta: 49.3MB). Free memory was 191.1MB in the beginning and 124.8MB in the end (delta: 66.3MB). Peak memory consumption was 118.3MB. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 84 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1301 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1301 mSDsluCounter, 868 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 33 IncrementalHoareTripleChecker+Unchecked, 508 mSDsCounter, 875 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 877 IncrementalHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 875 mSolverCounterUnsat, 360 mSDtfsCounter, 877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 69 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 67 NumberOfFragments, 668 HoareAnnotationTreeSize, 20 FomulaSimplifications, 3954 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5577 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 192 ConstructedInterpolants, 5 QuantifiedInterpolants, 2836 SizeOfPredicates, 20 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 15/75 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 16 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(~zero_extendFrom32To33(t), ~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33))) && ~bvule34(~bvadd16(~zero_extendFrom33To34(tagbuf_len[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule32(0bv32, tagbuf_len) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33), ~zero_extendFrom32To33(tagbuf_len[30:0] ++ 0bv1))) && ~bvule32(0bv32, t) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (~bvule32(1bv32, cond) && !~bvule2(~bvadd16(~zero_extendFrom1To2(t[31:31]), 1bv2), ~zero_extendFrom1To2(tagbuf_len[31:31]))) && ~bvule32(t, tagbuf_len) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33), ~zero_extendFrom32To33(tagbuf_len[30:0] ++ 0bv1))) && ~bvule32(0bv32, t)) || ((((((~bvult64(~zero_extendFrom32To33(tagbuf_len), 4294967296bv33) && ~bvule32(1bv32, cond)) && !(t == tagbuf_len)) && ~bvule32(cond, 1bv32)) && ~bvslt66(~bvadd16(~sign_extendFrom8To32((if !(~bvurem33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33) == 0bv33) then (if ~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33)[32:32] == 1bv1 then ~bvadd16(1bv33, ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33))), ~sign_extendFrom8To32((if !(0bv65 == ~bvurem65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) then (if ~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65)[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)))), ~sign_extendFrom8To32(~bvadd16(~sign_extendFrom8To32(~bvadd16(~zero_extendFrom32To34(tagbuf_len), 12884901888bv34)[33:32]), 1bv3)))) && t == 0bv32) && ~bvule32(0bv32, tagbuf_len)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33), ~zero_extendFrom32To33(tagbuf_len[30:0] ++ 0bv1))) && ~bvule32(0bv32, t)) || (((((~bvule32(1bv32, cond) && ~bvsle32((if !(~bvurem65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65) == 0bv65) then (if ~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)))[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)), 0bv65)) && t == 1bv32) && ~bvule32(cond, 1bv32)) && !(tagbuf_len == 0bv32)) && ~bvule32(0bv32, tagbuf_len)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33), ~zero_extendFrom32To33(tagbuf_len[30:0] ++ 0bv1))) && ~bvule32(0bv32, t)) || ((((((~bvult64(~zero_extendFrom32To33(tagbuf_len), 4294967296bv33) && ~bvule32(1bv32, cond)) && !(t == tagbuf_len)) && ~bvule32(cond, 1bv32)) && ~bvslt66(~bvadd16(~sign_extendFrom8To32((if !(~bvurem33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33) == 0bv33) then (if ~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33)[32:32] == 1bv1 then ~bvadd16(1bv33, ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33))), ~sign_extendFrom8To32((if !(0bv65 == ~bvurem65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) then (if ~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65)[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)))), ~sign_extendFrom8To32(~bvadd16(~sign_extendFrom8To32(~bvadd16(~zero_extendFrom32To34(tagbuf_len), 12884901888bv34)[33:32]), 1bv3)))) && t == 0bv32) && ~bvule32(0bv32, tagbuf_len)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33), ~zero_extendFrom32To33(tagbuf_len[30:0] ++ 0bv1))) && ~bvule32(0bv32, t) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((~bvult64(~zero_extendFrom32To33(tagbuf_len), 4294967296bv33) && ~bvule32(t, tagbuf_len)) && ~bvslt66(~bvadd16(~sign_extendFrom8To32((if !(~bvurem33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33) == 0bv33) then (if ~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33)[32:32] == 1bv1 then ~bvadd16(1bv33, ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33))), ~sign_extendFrom8To32((if !(0bv65 == ~bvurem65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) then (if ~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65)[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)))), ~sign_extendFrom8To32(~bvadd16(~sign_extendFrom8To32(~bvadd16(~zero_extendFrom32To34(tagbuf_len), 12884901888bv34)[33:32]), 1bv3)))) && t == 0bv32) || ((((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(~zero_extendFrom32To33(t), ~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33))) && ~bvule34(~bvadd16(~zero_extendFrom33To34(tagbuf_len[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule32(0bv32, tagbuf_len)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33), ~zero_extendFrom32To33(tagbuf_len[30:0] ++ 0bv1))) && ~bvule32(0bv32, t) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((~bvule32(1bv32, cond) && ~bvsle32((if !(~bvurem65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65) == 0bv65) then (if ~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)))[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)), 0bv65)) && !(t == tagbuf_len)) && ~bvule32(cond, 1bv32)) && ~bvslt66(~bvadd16(~sign_extendFrom8To32((if !(~bvurem33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33) == 0bv33) then (if ~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33)[32:32] == 1bv1 then ~bvadd16(1bv33, ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33))), ~sign_extendFrom8To32((if !(0bv65 == ~bvurem65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) then (if ~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65)[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)))), ~sign_extendFrom8To32(~bvadd16(~sign_extendFrom8To32(~bvadd16(~zero_extendFrom32To34(tagbuf_len), 12884901888bv34)[33:32]), 1bv3)))) && t == 0bv32) && ~bvule1(t[31:31], 0bv1)) && ~bvule32(0bv32, t)) && ~bvule32(0bv32, tagbuf_len)) || ((((((~bvule32(1bv32, cond) && ~bvsle32((if !(~bvurem65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65) == 0bv65) then (if ~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)))[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)), 0bv65)) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule1(t[31:31], 0bv1)) && ~bvule32(0bv32, t)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (~bvule32(1bv32, cond) && ~bvule32(t, tagbuf_len)) && ~bvult64(~zero_extendFrom1To2(tagbuf_len[31:31]), ~bvadd16(~zero_extendFrom1To2(t[31:31]), 1bv2)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((~bvule32(1bv32, cond) && ~bvsle32((if !(~bvurem65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65) == 0bv65) then (if ~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)))[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)), 0bv65)) && !(t == tagbuf_len)) && ~bvule32(cond, 1bv32)) && ~bvslt66(~bvadd16(~sign_extendFrom8To32((if !(~bvurem33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33) == 0bv33) then (if ~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33)[32:32] == 1bv1 then ~bvadd16(1bv33, ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33)) else ~bvsdiv33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 4294967297bv33), 4294967296bv33))), ~sign_extendFrom8To32((if !(0bv65 == ~bvurem65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) then (if ~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65)[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)), 6442450942bv65), 36893488145271619584bv65)))), ~sign_extendFrom8To32(~bvadd16(~sign_extendFrom8To32(~bvadd16(~zero_extendFrom32To34(tagbuf_len), 12884901888bv34)[33:32]), 1bv3)))) && t == 0bv32) && ~bvule1(t[31:31], 0bv1)) && ~bvule32(0bv32, t)) && ~bvule32(0bv32, tagbuf_len)) || ((((((~bvule32(1bv32, cond) && ~bvsle32((if !(~bvurem65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65) == 0bv65) then (if ~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64)))[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)) else ~bvsdiv65(~bvadd16(~zero_extendFrom32To65(tagbuf_len[30:0] ++ 0bv1), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(tagbuf_len), 18446744073709551615bv64))), 36893488145271619584bv65)), 0bv65)) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule1(t[31:31], 0bv1)) && ~bvule32(0bv32, t)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (~bvule32(1bv32, cond) && !~bvule2(~bvadd16(~zero_extendFrom1To2(t[31:31]), 1bv2), ~zero_extendFrom1To2(tagbuf_len[31:31]))) && ~bvule32(t, tagbuf_len) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, cond) && ~bvule32(cond, 1bv32)) && ~bvult64(t, tagbuf_len)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(t[31:31] ++ 0bv32), 1bv34), ~zero_extendFrom32To34(t))) && ~bvule33(~bvadd16(~zero_extendFrom32To33(tagbuf_len), 1bv33), ~zero_extendFrom32To33(tagbuf_len[30:0] ++ 0bv1))) && ~bvule32(0bv32, t) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-11 02:02:54,509 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...