/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_LAZY.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:18:27,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:18:27,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:18:28,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:18:28,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:18:28,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:18:28,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:18:28,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:18:28,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:18:28,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:18:28,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:18:28,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:18:28,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:18:28,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:18:28,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:18:28,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:18:28,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:18:28,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:18:28,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:18:28,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:18:28,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:18:28,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:18:28,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:18:28,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:18:28,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:18:28,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:18:28,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:18:28,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:18:28,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:18:28,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:18:28,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:18:28,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:18:28,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:18:28,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:18:28,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:18:28,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:18:28,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:18:28,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:18:28,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:18:28,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:18:28,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:18:28,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 14:18:28,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:18:28,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:18:28,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:18:28,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:18:28,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:18:28,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:18:28,079 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:18:28,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:18:28,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:18:28,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:18:28,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:18:28,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:18:28,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:18:28,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:18:28,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:18:28,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:18:28,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:18:28,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:18:28,083 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:18:28,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:18:28,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:18:28,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:18:28,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:18:28,085 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:18:28,086 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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-10 14:18:28,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:18:28,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:18:28,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:18:28,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:18:28,279 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:18:28,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2022-01-10 14:18:28,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd12d3f4c/ba9f37c07ad14bf7bc121b3664f0ff6a/FLAGf1cf2d065 [2022-01-10 14:18:28,676 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:18:28,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2022-01-10 14:18:28,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd12d3f4c/ba9f37c07ad14bf7bc121b3664f0ff6a/FLAGf1cf2d065 [2022-01-10 14:18:29,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd12d3f4c/ba9f37c07ad14bf7bc121b3664f0ff6a [2022-01-10 14:18:29,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:18:29,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:18:29,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:18:29,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:18:29,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:18:29,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f20c371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29, skipping insertion in model container [2022-01-10 14:18:29,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:18:29,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:18:29,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c[728,741] [2022-01-10 14:18:29,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:18:29,293 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:18:29,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c[728,741] [2022-01-10 14:18:29,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:18:29,333 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:18:29,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29 WrapperNode [2022-01-10 14:18:29,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:18:29,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:18:29,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:18:29,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:18:29,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,364 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 276 [2022-01-10 14:18:29,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:18:29,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:18:29,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:18:29,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:18:29,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:18:29,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:18:29,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:18:29,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:18:29,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:18:29,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:18:29,415 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-10 14:18:29,420 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-10 14:18:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:18:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:18:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:18:29,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:18:29,494 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:18:29,495 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:18:29,787 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:18:29,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:18:29,792 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 14:18:29,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:29 BoogieIcfgContainer [2022-01-10 14:18:29,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:18:29,794 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:18:29,794 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:18:29,795 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:18:29,801 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:29" (1/1) ... [2022-01-10 14:18:29,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:18:29 BasicIcfg [2022-01-10 14:18:29,887 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:18:29,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:18:29,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:18:29,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:18:29,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:18:29" (1/4) ... [2022-01-10 14:18:29,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc05f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:18:29, skipping insertion in model container [2022-01-10 14:18:29,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:29" (2/4) ... [2022-01-10 14:18:29,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc05f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:18:29, skipping insertion in model container [2022-01-10 14:18:29,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:29" (3/4) ... [2022-01-10 14:18:29,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc05f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:18:29, skipping insertion in model container [2022-01-10 14:18:29,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:18:29" (4/4) ... [2022-01-10 14:18:29,892 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.cTransformedIcfg [2022-01-10 14:18:29,896 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:18:29,896 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 14:18:29,927 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:18:29,932 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-10 14:18:29,932 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 14:18:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 72 states have internal predecessors, (125), 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-10 14:18:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 14:18:29,947 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:29,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:29,948 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1536015414, now seen corresponding path program 1 times [2022-01-10 14:18:29,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:29,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715168522] [2022-01-10 14:18:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:29,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,181 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-10 14:18:30,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715168522] [2022-01-10 14:18:30,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715168522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:30,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675746097] [2022-01-10 14:18:30,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:30,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:30,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:30,217 INFO L87 Difference]: Start difference. First operand has 73 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 72 states have internal predecessors, (125), 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 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10 14:18:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,369 INFO L93 Difference]: Finished difference Result 137 states and 230 transitions. [2022-01-10 14:18:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:30,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10 14:18:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,385 INFO L225 Difference]: With dead ends: 137 [2022-01-10 14:18:30,385 INFO L226 Difference]: Without dead ends: 69 [2022-01-10 14:18:30,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:30,394 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-10 14:18:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-01-10 14:18:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 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-10 14:18:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2022-01-10 14:18:30,419 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 25 [2022-01-10 14:18:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,420 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2022-01-10 14:18:30,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10 14:18:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-01-10 14:18:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 14:18:30,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:30,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:18:30,421 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1242597750, now seen corresponding path program 1 times [2022-01-10 14:18:30,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787930562] [2022-01-10 14:18:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,482 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-10 14:18:30,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787930562] [2022-01-10 14:18:30,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787930562] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:30,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106286980] [2022-01-10 14:18:30,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:30,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:30,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:30,485 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-10 14:18:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,495 INFO L93 Difference]: Finished difference Result 84 states and 122 transitions. [2022-01-10 14:18:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-01-10 14:18:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,496 INFO L225 Difference]: With dead ends: 84 [2022-01-10 14:18:30,496 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 14:18:30,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:30,498 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 13 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 186 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 14:18:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-01-10 14:18:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.46875) internal successors, (94), 64 states have internal predecessors, (94), 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-10 14:18:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2022-01-10 14:18:30,503 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 28 [2022-01-10 14:18:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,503 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-01-10 14:18:30,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-10 14:18:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2022-01-10 14:18:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:30,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:30,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:18:30,504 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1849665854, now seen corresponding path program 1 times [2022-01-10 14:18:30,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599193825] [2022-01-10 14:18:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,546 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-10 14:18:30,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599193825] [2022-01-10 14:18:30,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599193825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:30,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020198307] [2022-01-10 14:18:30,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:30,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:30,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:30,548 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10 14:18:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,608 INFO L93 Difference]: Finished difference Result 129 states and 185 transitions. [2022-01-10 14:18:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-01-10 14:18:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,610 INFO L225 Difference]: With dead ends: 129 [2022-01-10 14:18:30,610 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 14:18:30,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:30,611 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 14:18:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-01-10 14:18:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 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-10 14:18:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2022-01-10 14:18:30,618 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 30 [2022-01-10 14:18:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,618 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2022-01-10 14:18:30,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10 14:18:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2022-01-10 14:18:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 14:18:30,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:30,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:18:30,619 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash -721179066, now seen corresponding path program 1 times [2022-01-10 14:18:30,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265383923] [2022-01-10 14:18:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,732 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-10 14:18:30,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265383923] [2022-01-10 14:18:30,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265383923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:30,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826065724] [2022-01-10 14:18:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:30,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:30,734 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-10 14:18:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,942 INFO L93 Difference]: Finished difference Result 196 states and 264 transitions. [2022-01-10 14:18:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 14:18:30,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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 32 [2022-01-10 14:18:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,947 INFO L225 Difference]: With dead ends: 196 [2022-01-10 14:18:30,947 INFO L226 Difference]: Without dead ends: 192 [2022-01-10 14:18:30,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-10 14:18:30,957 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 235 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 388 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-10 14:18:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 122. [2022-01-10 14:18:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 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-10 14:18:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2022-01-10 14:18:30,977 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 32 [2022-01-10 14:18:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,977 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2022-01-10 14:18:30,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-10 14:18:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2022-01-10 14:18:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 14:18:30,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:30,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:18:30,979 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1533730274, now seen corresponding path program 1 times [2022-01-10 14:18:30,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776599253] [2022-01-10 14:18:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:31,059 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-10 14:18:31,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:31,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776599253] [2022-01-10 14:18:31,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776599253] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:31,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:31,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:31,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864464894] [2022-01-10 14:18:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:31,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:31,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:31,064 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-10 14:18:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:31,180 INFO L93 Difference]: Finished difference Result 200 states and 282 transitions. [2022-01-10 14:18:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:31,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 34 [2022-01-10 14:18:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:31,182 INFO L225 Difference]: With dead ends: 200 [2022-01-10 14:18:31,182 INFO L226 Difference]: Without dead ends: 172 [2022-01-10 14:18:31,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 14:18:31,185 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 142 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:31,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 382 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-01-10 14:18:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 136. [2022-01-10 14:18:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4074074074074074) internal successors, (190), 135 states have internal predecessors, (190), 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-10 14:18:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2022-01-10 14:18:31,198 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 34 [2022-01-10 14:18:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:31,198 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2022-01-10 14:18:31,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-10 14:18:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2022-01-10 14:18:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 14:18:31,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:31,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:31,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:18:31,201 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash 964285663, now seen corresponding path program 1 times [2022-01-10 14:18:31,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:31,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811815685] [2022-01-10 14:18:31,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:31,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:31,257 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-10 14:18:31,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:31,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811815685] [2022-01-10 14:18:31,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811815685] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:31,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:31,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:31,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991476355] [2022-01-10 14:18:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:31,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:31,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:31,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:31,259 INFO L87 Difference]: Start difference. First operand 136 states and 190 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-10 14:18:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:31,336 INFO L93 Difference]: Finished difference Result 160 states and 213 transitions. [2022-01-10 14:18:31,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:31,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 34 [2022-01-10 14:18:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:31,338 INFO L225 Difference]: With dead ends: 160 [2022-01-10 14:18:31,338 INFO L226 Difference]: Without dead ends: 155 [2022-01-10 14:18:31,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:31,339 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 95 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:31,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 352 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-01-10 14:18:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-01-10 14:18:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3888888888888888) internal successors, (200), 144 states have internal predecessors, (200), 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-10 14:18:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2022-01-10 14:18:31,353 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 34 [2022-01-10 14:18:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:31,353 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2022-01-10 14:18:31,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-10 14:18:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2022-01-10 14:18:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 14:18:31,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:31,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:31,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:18:31,357 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:31,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 965209184, now seen corresponding path program 1 times [2022-01-10 14:18:31,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:31,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683939017] [2022-01-10 14:18:31,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:31,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:31,392 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-10 14:18:31,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:31,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683939017] [2022-01-10 14:18:31,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683939017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:31,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:31,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:18:31,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539437262] [2022-01-10 14:18:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:31,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:18:31,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:31,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:18:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:18:31,393 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-10 14:18:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:31,477 INFO L93 Difference]: Finished difference Result 333 states and 454 transitions. [2022-01-10 14:18:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 14:18:31,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-01-10 14:18:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:31,479 INFO L225 Difference]: With dead ends: 333 [2022-01-10 14:18:31,479 INFO L226 Difference]: Without dead ends: 206 [2022-01-10 14:18:31,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:18:31,482 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 45 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:31,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 178 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-01-10 14:18:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 141. [2022-01-10 14:18:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 140 states have internal predecessors, (192), 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-10 14:18:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2022-01-10 14:18:31,491 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 34 [2022-01-10 14:18:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:31,491 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2022-01-10 14:18:31,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-10 14:18:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2022-01-10 14:18:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 14:18:31,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:31,492 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:31,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:18:31,492 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:31,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash 45042657, now seen corresponding path program 1 times [2022-01-10 14:18:31,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:31,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750013234] [2022-01-10 14:18:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:31,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:18:31,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750013234] [2022-01-10 14:18:31,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750013234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:31,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:31,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:31,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549187877] [2022-01-10 14:18:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:31,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:31,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:31,567 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-10 14:18:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:31,595 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2022-01-10 14:18:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 14:18:31,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 35 [2022-01-10 14:18:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:31,597 INFO L225 Difference]: With dead ends: 146 [2022-01-10 14:18:31,597 INFO L226 Difference]: Without dead ends: 136 [2022-01-10 14:18:31,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:31,597 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:31,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 339 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-01-10 14:18:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-01-10 14:18:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 135 states have internal predecessors, (183), 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-10 14:18:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 183 transitions. [2022-01-10 14:18:31,606 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 183 transitions. Word has length 35 [2022-01-10 14:18:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:31,610 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 183 transitions. [2022-01-10 14:18:31,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-10 14:18:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 183 transitions. [2022-01-10 14:18:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 14:18:31,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:31,611 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:31,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:18:31,612 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:31,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:31,613 INFO L85 PathProgramCache]: Analyzing trace with hash -752397020, now seen corresponding path program 1 times [2022-01-10 14:18:31,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:31,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171673967] [2022-01-10 14:18:31,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:31,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:18:31,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:31,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171673967] [2022-01-10 14:18:31,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171673967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:31,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:31,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:31,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755723717] [2022-01-10 14:18:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:31,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:31,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:31,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:31,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:31,695 INFO L87 Difference]: Start difference. First operand 136 states and 183 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-10 14:18:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:31,786 INFO L93 Difference]: Finished difference Result 192 states and 247 transitions. [2022-01-10 14:18:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 36 [2022-01-10 14:18:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:31,787 INFO L225 Difference]: With dead ends: 192 [2022-01-10 14:18:31,787 INFO L226 Difference]: Without dead ends: 154 [2022-01-10 14:18:31,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 14:18:31,788 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:31,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 392 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-01-10 14:18:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2022-01-10 14:18:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 129 states have internal predecessors, (174), 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-10 14:18:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 174 transitions. [2022-01-10 14:18:31,794 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 174 transitions. Word has length 36 [2022-01-10 14:18:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:31,794 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 174 transitions. [2022-01-10 14:18:31,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-10 14:18:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 174 transitions. [2022-01-10 14:18:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 14:18:31,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:31,795 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:31,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 14:18:31,795 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1307598415, now seen corresponding path program 1 times [2022-01-10 14:18:31,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:31,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689303061] [2022-01-10 14:18:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:31,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:18:31,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689303061] [2022-01-10 14:18:31,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689303061] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:31,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:31,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:31,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851877787] [2022-01-10 14:18:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:31,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:31,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:31,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:31,829 INFO L87 Difference]: Start difference. First operand 130 states and 174 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-10 14:18:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:31,873 INFO L93 Difference]: Finished difference Result 189 states and 250 transitions. [2022-01-10 14:18:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:31,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 38 [2022-01-10 14:18:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:31,874 INFO L225 Difference]: With dead ends: 189 [2022-01-10 14:18:31,874 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 14:18:31,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:31,877 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:31,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 14:18:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-01-10 14:18:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 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-10 14:18:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2022-01-10 14:18:31,880 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 38 [2022-01-10 14:18:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:31,881 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2022-01-10 14:18:31,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-10 14:18:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2022-01-10 14:18:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 14:18:31,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:31,882 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:31,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 14:18:31,882 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1057113912, now seen corresponding path program 1 times [2022-01-10 14:18:31,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:31,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553254618] [2022-01-10 14:18:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:31,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:18:31,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:31,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553254618] [2022-01-10 14:18:31,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553254618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:31,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:31,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:31,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495305657] [2022-01-10 14:18:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:31,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:31,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:31,980 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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-10 14:18:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:32,080 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2022-01-10 14:18:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:18:32,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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 40 [2022-01-10 14:18:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:32,082 INFO L225 Difference]: With dead ends: 102 [2022-01-10 14:18:32,082 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 14:18:32,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-10 14:18:32,083 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:32,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 362 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 14:18:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-01-10 14:18:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 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-10 14:18:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-01-10 14:18:32,086 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 40 [2022-01-10 14:18:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:32,086 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-01-10 14:18:32,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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-10 14:18:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-01-10 14:18:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:18:32,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:32,087 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:32,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:18:32,087 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1430232027, now seen corresponding path program 1 times [2022-01-10 14:18:32,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:32,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276846598] [2022-01-10 14:18:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:32,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:18:32,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:32,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276846598] [2022-01-10 14:18:32,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276846598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:32,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:32,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 14:18:32,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027353120] [2022-01-10 14:18:32,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:32,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 14:18:32,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:32,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 14:18:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 14:18:32,166 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-10 14:18:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:32,296 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2022-01-10 14:18:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 14:18:32,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 44 [2022-01-10 14:18:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:32,297 INFO L225 Difference]: With dead ends: 165 [2022-01-10 14:18:32,297 INFO L226 Difference]: Without dead ends: 145 [2022-01-10 14:18:32,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-01-10 14:18:32,298 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 327 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:32,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 332 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-10 14:18:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 75. [2022-01-10 14:18:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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-10 14:18:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2022-01-10 14:18:32,303 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 44 [2022-01-10 14:18:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:32,303 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2022-01-10 14:18:32,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-10 14:18:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2022-01-10 14:18:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:18:32,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:32,304 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:32,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:18:32,304 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1357183460, now seen corresponding path program 1 times [2022-01-10 14:18:32,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:32,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662580034] [2022-01-10 14:18:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:32,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:18:32,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:32,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662580034] [2022-01-10 14:18:32,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662580034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:32,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:32,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:18:32,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211044428] [2022-01-10 14:18:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:32,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:18:32,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:18:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:18:32,338 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-10 14:18:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:32,353 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2022-01-10 14:18:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 14:18:32,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 44 [2022-01-10 14:18:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:32,353 INFO L225 Difference]: With dead ends: 95 [2022-01-10 14:18:32,354 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 14:18:32,354 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-10 14:18:32,354 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:32,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 14:18:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-01-10 14:18:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 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-10 14:18:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2022-01-10 14:18:32,358 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 44 [2022-01-10 14:18:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:32,358 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2022-01-10 14:18:32,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-10 14:18:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-01-10 14:18:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:18:32,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:32,358 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:32,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 14:18:32,359 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:32,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:32,359 INFO L85 PathProgramCache]: Analyzing trace with hash -778816080, now seen corresponding path program 1 times [2022-01-10 14:18:32,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:32,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803095884] [2022-01-10 14:18:32,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:32,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:18:32,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:32,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803095884] [2022-01-10 14:18:32,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803095884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:32,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:32,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 14:18:32,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863296659] [2022-01-10 14:18:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:32,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 14:18:32,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:32,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 14:18:32,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 14:18:32,446 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-10 14:18:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:32,543 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-01-10 14:18:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 14:18:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 44 [2022-01-10 14:18:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:32,544 INFO L225 Difference]: With dead ends: 63 [2022-01-10 14:18:32,544 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 14:18:32,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-01-10 14:18:32,545 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:32,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 230 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 14:18:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 14:18:32,546 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-10 14:18:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 14:18:32,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2022-01-10 14:18:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:32,546 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 14:18:32,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-10 14:18:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 14:18:32,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 14:18:32,548 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 14:18:32,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:18:32,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 14:18:33,066 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 14:18:33,066 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 14:18:33,066 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-01-10 14:18:33,066 INFO L854 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_base2flt_~m#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_base2flt_~__retres4~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_base2flt_~m#1Int| 1))) [2022-01-10 14:18:33,066 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2022-01-10 14:18:33,066 INFO L854 garLoopResultBuilder]: At program point L80(lines 24 82) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_base2flt_~m#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_base2flt_#res#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_base2flt_~__retres4~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_base2flt_~m#1Int| 1))) [2022-01-10 14:18:33,067 INFO L854 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: false [2022-01-10 14:18:33,067 INFO L854 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: false [2022-01-10 14:18:33,067 INFO L858 garLoopResultBuilder]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2022-01-10 14:18:33,067 INFO L854 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: false [2022-01-10 14:18:33,067 INFO L858 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2022-01-10 14:18:33,067 INFO L858 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2022-01-10 14:18:33,067 INFO L854 garLoopResultBuilder]: At program point L79-1(lines 28 81) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,067 INFO L858 garLoopResultBuilder]: For program point L35-1(lines 35 75) no Hoare annotation was computed. [2022-01-10 14:18:33,067 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L858 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L80-1(lines 24 82) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L47-3(lines 37 52) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L57-5(lines 57 72) the Hoare annotation is: false [2022-01-10 14:18:33,068 INFO L858 garLoopResultBuilder]: For program point L29-2(lines 29 34) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L73-1(lines 35 75) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,068 INFO L858 garLoopResultBuilder]: For program point L38-1(lines 37 52) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L858 garLoopResultBuilder]: For program point L58-1(lines 57 72) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L79-2(lines 28 81) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,068 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 35 75) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L858 garLoopResultBuilder]: For program point L47-2(lines 47 51) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 57 72) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L80-2(lines 24 82) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L47-5(lines 37 52) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L57-8(lines 57 72) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,068 INFO L858 garLoopResultBuilder]: For program point L29-3(lines 29 34) no Hoare annotation was computed. [2022-01-10 14:18:33,068 INFO L854 garLoopResultBuilder]: At program point L73-2(lines 35 75) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 37 52) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L58-2(lines 57 72) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L854 garLoopResultBuilder]: At program point L79-3(lines 28 81) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L35-3(lines 35 75) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L47-4(lines 47 51) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L59-2(lines 57 72) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L854 garLoopResultBuilder]: At program point L80-3(lines 24 82) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,069 INFO L854 garLoopResultBuilder]: At program point L47-7(lines 37 52) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,069 INFO L854 garLoopResultBuilder]: At program point L57-11(lines 57 72) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 252) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L854 garLoopResultBuilder]: At program point L73-3(lines 35 75) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L38-3(lines 37 52) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L58-3(lines 57 72) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L243-2(lines 243 252) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L246(lines 246 250) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L47-6(lines 47 51) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L59-3(lines 57 72) no Hoare annotation was computed. [2022-01-10 14:18:33,069 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L854 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_mulflt_~b#1Int| |ULTIMATE.start_ULTIMATE.start_mulflt_~a#1Int|)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_mulflt_~__retres10~1#1Int| |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|) .cse2) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~sa~0#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~tmp~2#1Int|) .cse2) (<= 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~sa~0#1Int|))) [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L854 garLoopResultBuilder]: At program point L217(lines 147 219) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_mulflt_~b#1Int| |ULTIMATE.start_ULTIMATE.start_mulflt_~a#1Int|)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_mulflt_#res#1Int| |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_mulflt_~__retres10~1#1Int| |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|) .cse2) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~sa~0#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~tmp~2#1Int|) .cse2) (<= 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~sa~0#1Int|))) [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L256(lines 256 272) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L256-2(lines 256 272) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L257-2(lines 257 266) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L861 garLoopResultBuilder]: At program point L274(lines 220 276) the Hoare annotation is: true [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2022-01-10 14:18:33,070 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2022-01-10 14:18:33,071 INFO L858 garLoopResultBuilder]: For program point L260-2(lines 260 264) no Hoare annotation was computed. [2022-01-10 14:18:33,071 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 14:18:33,071 INFO L858 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-01-10 14:18:33,071 INFO L861 garLoopResultBuilder]: At program point L16-2(lines 15 20) the Hoare annotation is: true [2022-01-10 14:18:33,071 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 14:18:33,071 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-01-10 14:18:33,073 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:33,074 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 14:18:33,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:18:33 BasicIcfg [2022-01-10 14:18:33,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 14:18:33,097 INFO L158 Benchmark]: Toolchain (without parser) took 3992.78ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 135.4MB in the beginning and 120.6MB in the end (delta: 14.8MB). Peak memory consumption was 100.5MB. Max. memory is 8.0GB. [2022-01-10 14:18:33,097 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 14:18:33,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.11ms. Allocated memory is still 185.6MB. Free memory was 135.2MB in the beginning and 159.2MB in the end (delta: -24.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 14:18:33,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.44ms. Allocated memory is still 185.6MB. Free memory was 159.2MB in the beginning and 157.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 14:18:33,098 INFO L158 Benchmark]: Boogie Preprocessor took 21.61ms. Allocated memory is still 185.6MB. Free memory was 157.2MB in the beginning and 155.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 14:18:33,098 INFO L158 Benchmark]: RCFGBuilder took 405.99ms. Allocated memory is still 185.6MB. Free memory was 155.1MB in the beginning and 138.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-10 14:18:33,098 INFO L158 Benchmark]: IcfgTransformer took 93.48ms. Allocated memory is still 185.6MB. Free memory was 138.8MB in the beginning and 130.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-10 14:18:33,098 INFO L158 Benchmark]: TraceAbstraction took 3208.32ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 129.9MB in the beginning and 120.6MB in the end (delta: 9.3MB). Peak memory consumption was 94.8MB. Max. memory is 8.0GB. [2022-01-10 14:18:33,099 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.12ms. Allocated memory is still 185.6MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.11ms. Allocated memory is still 185.6MB. Free memory was 135.2MB in the beginning and 159.2MB in the end (delta: -24.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.44ms. Allocated memory is still 185.6MB. Free memory was 159.2MB in the beginning and 157.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.61ms. Allocated memory is still 185.6MB. Free memory was 157.2MB in the beginning and 155.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 405.99ms. Allocated memory is still 185.6MB. Free memory was 155.1MB in the beginning and 138.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 93.48ms. Allocated memory is still 185.6MB. Free memory was 138.8MB in the beginning and 130.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3208.32ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 129.9MB in the beginning and 120.6MB in the end (delta: 9.3MB). Peak memory consumption was 94.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1005 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1005 mSDsluCounter, 3775 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2690 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 675 IncrementalHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 1085 mSDtfsCounter, 675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 88, 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, 14 MinimizatonAttempts, 286 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 67 NumberOfFragments, 200 HoareAnnotationTreeSize, 24 FomulaSimplifications, 3707 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 24 FomulaSimplificationsInter, 2327 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 484 ConstructedInterpolants, 0 QuantifiedInterpolants, 886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0bv32 == __retres4 && ~bvule32(m, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To64(m), 1bv33)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((~bvule32(0bv32, zero) && ~bvule32(1bv32, sa)) && ~bvule32(1bv32, tmp)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a)) || ~bvule32(4294967295bv32, sa)) || (((~bvule32(__retres10, zero) && ~bvule32(0bv32, zero)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((~bvule32(0bv32, zero) && ~bvule32(1bv32, sa)) && ~bvule32(1bv32, tmp)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a)) || ((((~bvule32(__retres10, zero) && ~bvule32(0bv32, zero)) && ~bvule32(\result, zero)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a))) || ~bvule32(4294967295bv32, sa) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((0bv32 == __retres4 && ~bvule32(\result, 0bv32)) && ~bvule32(m, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To64(m), 1bv33)) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 14:18:33,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...