/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_NONE.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:11:56,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:11:56,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:11:56,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:11:56,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:11:56,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:11:56,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:11:56,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:11:56,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:11:56,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:11:56,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:11:56,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:11:56,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:11:56,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:11:56,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:11:56,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:11:56,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:11:56,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:11:56,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:11:56,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:11:56,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:11:56,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:11:56,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:11:56,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:11:56,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:11:56,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:11:56,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:11:56,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:11:56,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:11:56,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:11:56,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:11:56,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:11:56,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:11:56,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:11:56,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:11:56,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:11:56,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:11:56,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:11:56,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:11:56,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:11:56,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:11:56,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:11:56,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:11:56,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:11:56,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:11:56,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:11:56,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:11:56,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:11:56,325 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:11:56,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:11:56,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:11:56,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:11:56,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:11:56,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:11:56,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:11:56,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:11:56,326 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:11:56,326 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:11:56,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:11:56,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:11:56,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:11:56,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:11:56,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:11:56,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:11:56,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:11:56,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:11:56,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:11:56,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:11:56,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:11:56,328 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:11:56,328 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:11:56,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:11:56,328 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:11:56,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:11:56,329 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:11:56,329 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 00:11:56,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:11:56,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:11:56,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:11:56,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:11:56,554 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:11:56,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2022-01-11 00:11:56,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19a5ea67/bb732a756ed24834b236067f0f1e6116/FLAGf248d7d3c [2022-01-11 00:11:56,882 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:11:56,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2022-01-11 00:11:56,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19a5ea67/bb732a756ed24834b236067f0f1e6116/FLAGf248d7d3c [2022-01-11 00:11:57,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19a5ea67/bb732a756ed24834b236067f0f1e6116 [2022-01-11 00:11:57,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:11:57,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:11:57,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:11:57,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:11:57,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:11:57,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fcf232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57, skipping insertion in model container [2022-01-11 00:11:57,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:11:57,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:11:57,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c[946,959] [2022-01-11 00:11:57,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:11:57,504 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:11:57,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c[946,959] [2022-01-11 00:11:57,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:11:57,559 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:11:57,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57 WrapperNode [2022-01-11 00:11:57,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:11:57,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:11:57,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:11:57,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:11:57,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,582 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-01-11 00:11:57,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:11:57,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:11:57,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:11:57,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:11:57,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:11:57,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:11:57,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:11:57,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:11:57,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:11:57,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:11:57,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 00:11:57,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 00:11:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:11:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:11:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-01-11 00:11:57,673 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-01-11 00:11:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-01-11 00:11:57,673 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-01-11 00:11:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:11:57,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:11:57,719 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:11:57,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:11:57,803 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:11:57,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:11:57,807 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 00:11:57,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:11:57 BoogieIcfgContainer [2022-01-11 00:11:57,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:11:57,811 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:11:57,811 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:11:57,814 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:11:57,816 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:11:57" (1/1) ... [2022-01-11 00:11:57,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:11:57 BasicIcfg [2022-01-11 00:11:57,875 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:11:57,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:11:57,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:11:57,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:11:57,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:11:57" (1/4) ... [2022-01-11 00:11:57,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f08126a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:11:57, skipping insertion in model container [2022-01-11 00:11:57,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:11:57" (2/4) ... [2022-01-11 00:11:57,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f08126a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:11:57, skipping insertion in model container [2022-01-11 00:11:57,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:11:57" (3/4) ... [2022-01-11 00:11:57,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f08126a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:11:57, skipping insertion in model container [2022-01-11 00:11:57,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:11:57" (4/4) ... [2022-01-11 00:11:57,881 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.cTransformedIcfg [2022-01-11 00:11:57,900 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:11:57,901 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:11:57,929 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:11:57,945 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 00:11:57,945 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:11:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-11 00:11:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-11 00:11:57,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:11:57,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:11:57,958 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:11:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:11:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 409070419, now seen corresponding path program 1 times [2022-01-11 00:11:57,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:11:57,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536800622] [2022-01-11 00:11:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:11:57,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:11:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:11:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:11:58,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:11:58,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536800622] [2022-01-11 00:11:58,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536800622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:11:58,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:11:58,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:11:58,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272323175] [2022-01-11 00:11:58,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:11:58,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:11:58,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:11:58,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:11:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:11:58,224 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-11 00:11:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:11:58,306 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-01-11 00:11:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:11:58,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-01-11 00:11:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:11:58,314 INFO L225 Difference]: With dead ends: 37 [2022-01-11 00:11:58,314 INFO L226 Difference]: Without dead ends: 25 [2022-01-11 00:11:58,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:11:58,319 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:11:58,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:11:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-11 00:11:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-11 00:11:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-11 00:11:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-01-11 00:11:58,350 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 10 [2022-01-11 00:11:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:11:58,350 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-01-11 00:11:58,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-11 00:11:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-01-11 00:11:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-11 00:11:58,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:11:58,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:11:58,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:11:58,354 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:11:58,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:11:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 697486659, now seen corresponding path program 1 times [2022-01-11 00:11:58,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:11:58,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338373812] [2022-01-11 00:11:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:11:58,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:11:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:11:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:11:58,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:11:58,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338373812] [2022-01-11 00:11:58,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338373812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:11:58,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:11:58,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:11:58,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747961195] [2022-01-11 00:11:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:11:58,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:11:58,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:11:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:11:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:11:58,419 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-11 00:11:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:11:58,484 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-01-11 00:11:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:11:58,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-11 00:11:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:11:58,485 INFO L225 Difference]: With dead ends: 31 [2022-01-11 00:11:58,485 INFO L226 Difference]: Without dead ends: 27 [2022-01-11 00:11:58,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:11:58,491 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:11:58,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 72 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:11:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-11 00:11:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-01-11 00:11:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-11 00:11:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-01-11 00:11:58,499 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 11 [2022-01-11 00:11:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:11:58,500 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-01-11 00:11:58,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-11 00:11:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-01-11 00:11:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 00:11:58,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:11:58,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:11:58,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:11:58,501 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:11:58,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:11:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash 63510830, now seen corresponding path program 1 times [2022-01-11 00:11:58,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:11:58,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565565922] [2022-01-11 00:11:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:11:58,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:11:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:11:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:11:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:11:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 00:11:58,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:11:58,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565565922] [2022-01-11 00:11:58,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565565922] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:11:58,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500378256] [2022-01-11 00:11:58,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:11:58,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:11:58,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:11:58,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:11:58,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 00:11:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:58,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-11 00:11:58,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:11:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 00:11:58,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 00:11:58,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500378256] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:11:58,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 00:11:58,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 9 [2022-01-11 00:11:58,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075195922] [2022-01-11 00:11:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:11:58,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 00:11:58,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:11:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 00:11:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-11 00:11:58,953 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-11 00:11:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:11:59,039 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-01-11 00:11:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 00:11:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-01-11 00:11:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:11:59,040 INFO L225 Difference]: With dead ends: 36 [2022-01-11 00:11:59,040 INFO L226 Difference]: Without dead ends: 32 [2022-01-11 00:11:59,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-11 00:11:59,041 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:11:59,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:11:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-11 00:11:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-01-11 00:11:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-11 00:11:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-01-11 00:11:59,046 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 22 [2022-01-11 00:11:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:11:59,046 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-01-11 00:11:59,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-11 00:11:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-01-11 00:11:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 00:11:59,047 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:11:59,047 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:11:59,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 00:11:59,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:11:59,256 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:11:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:11:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1726490069, now seen corresponding path program 1 times [2022-01-11 00:11:59,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:11:59,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150473551] [2022-01-11 00:11:59,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:11:59,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:11:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:11:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:11:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:11:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 00:11:59,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:11:59,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150473551] [2022-01-11 00:11:59,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150473551] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:11:59,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:11:59,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 00:11:59,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729536395] [2022-01-11 00:11:59,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:11:59,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 00:11:59,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:11:59,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 00:11:59,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:11:59,355 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-11 00:11:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:11:59,443 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-01-11 00:11:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 00:11:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-01-11 00:11:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:11:59,444 INFO L225 Difference]: With dead ends: 41 [2022-01-11 00:11:59,444 INFO L226 Difference]: Without dead ends: 37 [2022-01-11 00:11:59,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-11 00:11:59,445 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:11:59,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 90 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:11:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-11 00:11:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-01-11 00:11:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-01-11 00:11:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-01-11 00:11:59,451 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 23 [2022-01-11 00:11:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:11:59,451 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-01-11 00:11:59,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-11 00:11:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-01-11 00:11:59,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 00:11:59,452 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:11:59,452 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:11:59,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:11:59,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:11:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:11:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash -312577904, now seen corresponding path program 1 times [2022-01-11 00:11:59,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:11:59,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831167277] [2022-01-11 00:11:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:11:59,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:11:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:11:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:11:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:11:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:11:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:11:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 00:11:59,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:11:59,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831167277] [2022-01-11 00:11:59,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831167277] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:11:59,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82188395] [2022-01-11 00:11:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:11:59,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:11:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:11:59,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:11:59,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 00:11:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:11:59,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-11 00:11:59,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:12:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-11 00:12:00,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 00:12:00,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82188395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:12:00,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 00:12:00,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 17 [2022-01-11 00:12:00,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775373087] [2022-01-11 00:12:00,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:12:00,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 00:12:00,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:12:00,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 00:12:00,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-01-11 00:12:00,074 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-11 00:12:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:12:00,154 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-01-11 00:12:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 00:12:00,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2022-01-11 00:12:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:12:00,156 INFO L225 Difference]: With dead ends: 61 [2022-01-11 00:12:00,156 INFO L226 Difference]: Without dead ends: 33 [2022-01-11 00:12:00,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-01-11 00:12:00,157 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:12:00,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 82 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:12:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-11 00:12:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-11 00:12:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-01-11 00:12:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-01-11 00:12:00,162 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 34 [2022-01-11 00:12:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:12:00,162 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-01-11 00:12:00,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-11 00:12:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-01-11 00:12:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 00:12:00,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:12:00,163 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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-11 00:12:00,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 00:12:00,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:00,382 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:12:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:12:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash -340778112, now seen corresponding path program 1 times [2022-01-11 00:12:00,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:12:00,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114818827] [2022-01-11 00:12:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:00,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:12:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:00,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:12:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:00,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:12:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:00,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:00,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-11 00:12:00,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:12:00,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114818827] [2022-01-11 00:12:00,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114818827] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:12:00,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779952853] [2022-01-11 00:12:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:00,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:00,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:12:00,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:12:00,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 00:12:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:00,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-11 00:12:00,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:12:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-11 00:12:00,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:12:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-11 00:12:01,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779952853] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:12:01,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:12:01,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-01-11 00:12:01,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709411487] [2022-01-11 00:12:01,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:12:01,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-11 00:12:01,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:12:01,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-11 00:12:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-11 00:12:01,204 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2022-01-11 00:12:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:12:01,351 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-01-11 00:12:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 00:12:01,352 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 35 [2022-01-11 00:12:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:12:01,353 INFO L225 Difference]: With dead ends: 44 [2022-01-11 00:12:01,353 INFO L226 Difference]: Without dead ends: 40 [2022-01-11 00:12:01,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-01-11 00:12:01,354 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:12:01,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 97 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:12:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-11 00:12:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-01-11 00:12:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-11 00:12:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-01-11 00:12:01,359 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 35 [2022-01-11 00:12:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:12:01,359 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-01-11 00:12:01,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2022-01-11 00:12:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-01-11 00:12:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-11 00:12:01,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:12:01,361 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:12:01,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 00:12:01,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:01,562 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:12:01,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:12:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1907496380, now seen corresponding path program 1 times [2022-01-11 00:12:01,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:12:01,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73804670] [2022-01-11 00:12:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:01,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:12:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:12:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-11 00:12:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-11 00:12:01,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:12:01,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73804670] [2022-01-11 00:12:01,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73804670] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:12:01,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361465119] [2022-01-11 00:12:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:01,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:12:01,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:12:01,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-11 00:12:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:01,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-11 00:12:01,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:12:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-11 00:12:01,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:12:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-11 00:12:02,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361465119] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:12:02,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:12:02,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 19 [2022-01-11 00:12:02,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514566570] [2022-01-11 00:12:02,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:12:02,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-11 00:12:02,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:12:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-11 00:12:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-01-11 00:12:02,386 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 17 states have internal predecessors, (47), 13 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (16), 9 states have call predecessors, (16), 13 states have call successors, (16) [2022-01-11 00:12:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:12:02,803 INFO L93 Difference]: Finished difference Result 90 states and 150 transitions. [2022-01-11 00:12:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-11 00:12:02,804 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 17 states have internal predecessors, (47), 13 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (16), 9 states have call predecessors, (16), 13 states have call successors, (16) Word has length 48 [2022-01-11 00:12:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:12:02,805 INFO L225 Difference]: With dead ends: 90 [2022-01-11 00:12:02,805 INFO L226 Difference]: Without dead ends: 56 [2022-01-11 00:12:02,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-01-11 00:12:02,806 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:12:02,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 238 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 00:12:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-11 00:12:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-01-11 00:12:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 34 states have internal predecessors, (35), 9 states have call successors, (9), 4 states have call predecessors, (9), 10 states have return successors, (26), 11 states have call predecessors, (26), 9 states have call successors, (26) [2022-01-11 00:12:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2022-01-11 00:12:02,813 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 48 [2022-01-11 00:12:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:12:02,814 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2022-01-11 00:12:02,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 17 states have internal predecessors, (47), 13 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (16), 9 states have call predecessors, (16), 13 states have call successors, (16) [2022-01-11 00:12:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-01-11 00:12:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 00:12:02,815 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:12:02,815 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:12:02,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-11 00:12:03,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:03,044 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:12:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:12:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash -586002073, now seen corresponding path program 2 times [2022-01-11 00:12:03,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:12:03,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951623765] [2022-01-11 00:12:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:03,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:12:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:12:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:12:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-11 00:12:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-11 00:12:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-11 00:12:03,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:12:03,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951623765] [2022-01-11 00:12:03,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951623765] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:12:03,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641997123] [2022-01-11 00:12:03,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 00:12:03,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:03,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:12:03,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:12:03,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-11 00:12:03,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 00:12:03,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 00:12:03,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-11 00:12:03,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:12:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-11 00:12:03,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 00:12:03,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641997123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:12:03,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 00:12:03,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 17 [2022-01-11 00:12:03,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783694293] [2022-01-11 00:12:03,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:12:03,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 00:12:03,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:12:03,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 00:12:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-01-11 00:12:03,783 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 9 states, 7 states have (on average 4.0) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-11 00:12:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:12:03,855 INFO L93 Difference]: Finished difference Result 96 states and 139 transitions. [2022-01-11 00:12:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 00:12:03,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-01-11 00:12:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:12:03,856 INFO L225 Difference]: With dead ends: 96 [2022-01-11 00:12:03,857 INFO L226 Difference]: Without dead ends: 49 [2022-01-11 00:12:03,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-11 00:12:03,858 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:12:03,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 92 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:12:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-11 00:12:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-01-11 00:12:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 34 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) [2022-01-11 00:12:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-01-11 00:12:03,863 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 59 [2022-01-11 00:12:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:12:03,864 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-01-11 00:12:03,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-11 00:12:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-01-11 00:12:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-11 00:12:03,865 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:12:03,865 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:12:03,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 00:12:04,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:04,083 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:12:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:12:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash 648083016, now seen corresponding path program 1 times [2022-01-11 00:12:04,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:12:04,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252476125] [2022-01-11 00:12:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:04,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:12:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:12:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-11 00:12:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-11 00:12:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-11 00:12:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-11 00:12:04,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:12:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252476125] [2022-01-11 00:12:04,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252476125] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:12:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436559202] [2022-01-11 00:12:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:04,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:12:04,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:12:04,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-11 00:12:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:04,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-11 00:12:04,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:12:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 18 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-01-11 00:12:04,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:12:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-01-11 00:12:05,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436559202] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:12:05,521 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:12:05,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 11] total 29 [2022-01-11 00:12:05,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008876080] [2022-01-11 00:12:05,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:12:05,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-11 00:12:05,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:12:05,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-11 00:12:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2022-01-11 00:12:05,523 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 29 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 17 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (25), 12 states have call predecessors, (25), 17 states have call successors, (25) [2022-01-11 00:12:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:12:06,137 INFO L93 Difference]: Finished difference Result 114 states and 172 transitions. [2022-01-11 00:12:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-11 00:12:06,138 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 17 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (25), 12 states have call predecessors, (25), 17 states have call successors, (25) Word has length 72 [2022-01-11 00:12:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:12:06,139 INFO L225 Difference]: With dead ends: 114 [2022-01-11 00:12:06,139 INFO L226 Difference]: Without dead ends: 67 [2022-01-11 00:12:06,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2022-01-11 00:12:06,140 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 61 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 00:12:06,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 311 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 00:12:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-11 00:12:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-01-11 00:12:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 43 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (31), 15 states have call predecessors, (31), 10 states have call successors, (31) [2022-01-11 00:12:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2022-01-11 00:12:06,148 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 72 [2022-01-11 00:12:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:12:06,148 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2022-01-11 00:12:06,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 17 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (25), 12 states have call predecessors, (25), 17 states have call successors, (25) [2022-01-11 00:12:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-01-11 00:12:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-11 00:12:06,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:12:06,149 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:12:06,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-11 00:12:06,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:06,363 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:12:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:12:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash 757765418, now seen corresponding path program 1 times [2022-01-11 00:12:06,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:12:06,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905579270] [2022-01-11 00:12:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:06,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:12:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:12:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-11 00:12:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-11 00:12:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-11 00:12:06,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:12:06,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905579270] [2022-01-11 00:12:06,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905579270] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:12:06,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748685840] [2022-01-11 00:12:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:06,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:06,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:12:06,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:12:06,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-11 00:12:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:06,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-11 00:12:06,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:12:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-11 00:12:07,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:12:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-11 00:12:23,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748685840] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:12:23,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:12:23,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 38 [2022-01-11 00:12:23,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182676550] [2022-01-11 00:12:23,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:12:23,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-11 00:12:23,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:12:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-11 00:12:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-01-11 00:12:23,952 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 38 states, 32 states have (on average 1.5625) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (9), 1 states have call predecessors, (9), 16 states have return successors, (21), 19 states have call predecessors, (21), 7 states have call successors, (21) [2022-01-11 00:12:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:12:24,142 INFO L93 Difference]: Finished difference Result 96 states and 151 transitions. [2022-01-11 00:12:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-11 00:12:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 1.5625) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (9), 1 states have call predecessors, (9), 16 states have return successors, (21), 19 states have call predecessors, (21), 7 states have call successors, (21) Word has length 61 [2022-01-11 00:12:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:12:24,144 INFO L225 Difference]: With dead ends: 96 [2022-01-11 00:12:24,145 INFO L226 Difference]: Without dead ends: 92 [2022-01-11 00:12:24,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 108 SyntacticMatches, 15 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-01-11 00:12:24,146 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:12:24,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1248 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 00:12:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-11 00:12:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2022-01-11 00:12:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 49 states have internal predecessors, (50), 13 states have call successors, (13), 5 states have call predecessors, (13), 17 states have return successors, (59), 21 states have call predecessors, (59), 13 states have call successors, (59) [2022-01-11 00:12:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2022-01-11 00:12:24,156 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 61 [2022-01-11 00:12:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:12:24,156 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2022-01-11 00:12:24,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 1.5625) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (9), 1 states have call predecessors, (9), 16 states have return successors, (21), 19 states have call predecessors, (21), 7 states have call successors, (21) [2022-01-11 00:12:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2022-01-11 00:12:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-11 00:12:24,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:12:24,157 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:12:24,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-11 00:12:24,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:24,358 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:12:24,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:12:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash -16094237, now seen corresponding path program 2 times [2022-01-11 00:12:24,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:12:24,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118705389] [2022-01-11 00:12:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:24,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:12:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:12:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-11 00:12:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-11 00:12:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-11 00:12:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-11 00:12:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 76 proven. 47 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-11 00:12:25,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:12:25,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118705389] [2022-01-11 00:12:25,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118705389] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:12:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934971352] [2022-01-11 00:12:25,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 00:12:25,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:25,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:12:25,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:12:25,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-11 00:12:25,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 00:12:25,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 00:12:25,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-11 00:12:25,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:12:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 52 proven. 18 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-01-11 00:12:25,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:12:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 52 proven. 20 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-01-11 00:12:25,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934971352] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:12:25,876 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:12:25,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 9] total 30 [2022-01-11 00:12:25,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418284932] [2022-01-11 00:12:25,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:12:25,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-11 00:12:25,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:12:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-11 00:12:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2022-01-11 00:12:25,877 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. Second operand has 30 states, 22 states have (on average 3.090909090909091) internal successors, (68), 27 states have internal predecessors, (68), 14 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (25), 17 states have call predecessors, (25), 14 states have call successors, (25) [2022-01-11 00:12:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:12:26,977 INFO L93 Difference]: Finished difference Result 154 states and 275 transitions. [2022-01-11 00:12:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-11 00:12:26,977 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 22 states have (on average 3.090909090909091) internal successors, (68), 27 states have internal predecessors, (68), 14 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (25), 17 states have call predecessors, (25), 14 states have call successors, (25) Word has length 86 [2022-01-11 00:12:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:12:26,979 INFO L225 Difference]: With dead ends: 154 [2022-01-11 00:12:26,979 INFO L226 Difference]: Without dead ends: 77 [2022-01-11 00:12:26,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 182 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1777, Unknown=0, NotChecked=0, Total=2070 [2022-01-11 00:12:26,980 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 00:12:26,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 404 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 00:12:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-11 00:12:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-01-11 00:12:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 13 states have call successors, (13), 8 states have call predecessors, (13), 13 states have return successors, (32), 16 states have call predecessors, (32), 13 states have call successors, (32) [2022-01-11 00:12:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2022-01-11 00:12:27,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 86 [2022-01-11 00:12:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:12:27,001 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2022-01-11 00:12:27,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 22 states have (on average 3.090909090909091) internal successors, (68), 27 states have internal predecessors, (68), 14 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (25), 17 states have call predecessors, (25), 14 states have call successors, (25) [2022-01-11 00:12:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2022-01-11 00:12:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-11 00:12:27,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:12:27,002 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:12:27,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-11 00:12:27,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-11 00:12:27,205 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:12:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:12:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash 571189284, now seen corresponding path program 1 times [2022-01-11 00:12:27,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:12:27,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213417877] [2022-01-11 00:12:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:27,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:12:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:12:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-11 00:12:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-11 00:12:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-11 00:12:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-11 00:12:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-11 00:12:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-11 00:12:27,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:12:27,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213417877] [2022-01-11 00:12:27,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213417877] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:12:27,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897212428] [2022-01-11 00:12:27,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:12:27,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:27,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:12:27,671 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:12:27,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-11 00:12:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:12:27,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-11 00:12:27,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:12:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-01-11 00:12:28,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:12:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 22 proven. 45 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-01-11 00:12:28,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897212428] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:12:28,753 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:12:28,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 11] total 31 [2022-01-11 00:12:28,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407107764] [2022-01-11 00:12:28,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:12:28,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-11 00:12:28,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:12:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-11 00:12:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-01-11 00:12:28,755 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand has 31 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 29 states have internal predecessors, (67), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (24), 16 states have call predecessors, (24), 17 states have call successors, (24) [2022-01-11 00:12:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:12:29,739 INFO L93 Difference]: Finished difference Result 166 states and 286 transitions. [2022-01-11 00:12:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-11 00:12:29,741 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 29 states have internal predecessors, (67), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (24), 16 states have call predecessors, (24), 17 states have call successors, (24) Word has length 73 [2022-01-11 00:12:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:12:29,741 INFO L225 Difference]: With dead ends: 166 [2022-01-11 00:12:29,741 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 00:12:29,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=1695, Unknown=0, NotChecked=0, Total=1980 [2022-01-11 00:12:29,743 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 57 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 00:12:29,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 358 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 00:12:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 00:12:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 00:12:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:12:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 00:12:29,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-01-11 00:12:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:12:29,744 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 00:12:29,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 29 states have internal predecessors, (67), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (24), 16 states have call predecessors, (24), 17 states have call successors, (24) [2022-01-11 00:12:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 00:12:29,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 00:12:29,747 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 00:12:29,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-11 00:12:29,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:12:29,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 00:12:31,091 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 00:12:31,091 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 00:12:31,091 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~x~0#1Int| 4) (<= 4 |ULTIMATE.start_ULTIMATE.start_main_~x~0#1Int|)) [2022-01-11 00:12:31,091 INFO L858 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-01-11 00:12:31,091 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-01-11 00:12:31,091 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-01-11 00:12:31,091 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L854 garLoopResultBuilder]: At program point L43(lines 37 44) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~x~0#1Int| 4) (<= 4 |ULTIMATE.start_ULTIMATE.start_main_~x~0#1Int|)) [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L854 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 0 fibo2_fibo2_~nInt) (not (= fibo2_fibo2_~nInt 1)) (let ((.cse0 (= fibo2_fibo2_~nInt |fibo2_fibo2_#in~nInt|)) (.cse1 (<= (+ fibo2_fibo2_~nInt 1) (* 2 (mod fibo2_fibo2_~nInt 2147483648))))) (or (and .cse0 (<= (* (div (+ fibo2_fibo2_~nInt 4294967294) 4294967296) 4294967296) (+ 4294967292 fibo2_fibo2_~nInt)) .cse1) (and .cse0 (<= |fibo2_fibo2_#t~ret6Int| 1) (<= 1 |fibo2_fibo2_#t~ret6Int|) .cse1)))) [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point L25-2(line 25) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L861 garLoopResultBuilder]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 26) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_fibo2_~nInt |fibo2_fibo2_#in~nInt|) (< 1 fibo2_fibo2_~nInt) (<= (+ fibo2_fibo2_~nInt 1) (* 2 (mod fibo2_fibo2_~nInt 2147483648)))) [2022-01-11 00:12:31,092 INFO L861 garLoopResultBuilder]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 16) no Hoare annotation was computed. [2022-01-11 00:12:31,092 INFO L858 garLoopResultBuilder]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2022-01-11 00:12:31,093 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 16) no Hoare annotation was computed. [2022-01-11 00:12:31,093 INFO L858 garLoopResultBuilder]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2022-01-11 00:12:31,093 INFO L854 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (and (= fibo1_fibo1_~nInt |fibo1_fibo1_#in~nInt|) (<= (+ fibo1_fibo1_~nInt 1) (* 2 (mod fibo1_fibo1_~nInt 2147483648))) (not (<= fibo1_fibo1_~nInt 1))) [2022-01-11 00:12:31,093 INFO L854 garLoopResultBuilder]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse0 (<= |fibo1_fibo1_#t~ret4Int| 1))) (and (= fibo1_fibo1_~nInt |fibo1_fibo1_#in~nInt|) (<= (+ fibo1_fibo1_~nInt 1) (* 2 (mod fibo1_fibo1_~nInt 2147483648))) (or (and (<= (div (+ (- 2) |fibo1_fibo1_#t~ret4Int|) (- 4294967296)) (div (+ 2 (* (- 1) |fibo1_fibo1_#t~ret4Int|)) 4294967296)) (<= 0 |fibo1_fibo1_#t~ret4Int|) (< |fibo1_fibo1_#t~ret4Int| 4294967296)) (and .cse0 (<= 1 |fibo1_fibo1_#t~ret4Int|) (<= (mod (+ 4294967295 (mod (+ 4294967295 |fibo1_fibo1_#in~nInt|) 4294967296)) 4294967296) 1)) (<= 5 fibo1_fibo1_~nInt)) (not (<= fibo1_fibo1_~nInt 1)) (or .cse0 (not (<= |fibo1_fibo1_#in~nInt| 2))))) [2022-01-11 00:12:31,093 INFO L858 garLoopResultBuilder]: For program point L15-2(line 15) no Hoare annotation was computed. [2022-01-11 00:12:31,095 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:12:31,096 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 00:12:31,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:12:31 BasicIcfg [2022-01-11 00:12:31,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 00:12:31,107 INFO L158 Benchmark]: Toolchain (without parser) took 33777.27ms. Allocated memory was 172.0MB in the beginning and 282.1MB in the end (delta: 110.1MB). Free memory was 116.1MB in the beginning and 153.3MB in the end (delta: -37.2MB). Peak memory consumption was 139.3MB. Max. memory is 8.0GB. [2022-01-11 00:12:31,107 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory was 131.9MB in the beginning and 131.8MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 00:12:31,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.97ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 115.8MB in the beginning and 208.1MB in the end (delta: -92.3MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-01-11 00:12:31,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.59ms. Allocated memory is still 234.9MB. Free memory was 208.1MB in the beginning and 206.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 00:12:31,108 INFO L158 Benchmark]: Boogie Preprocessor took 26.17ms. Allocated memory is still 234.9MB. Free memory was 206.5MB in the beginning and 205.5MB in the end (delta: 997.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 00:12:31,108 INFO L158 Benchmark]: RCFGBuilder took 192.85ms. Allocated memory is still 234.9MB. Free memory was 205.3MB in the beginning and 195.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-11 00:12:31,108 INFO L158 Benchmark]: IcfgTransformer took 64.75ms. Allocated memory is still 234.9MB. Free memory was 195.0MB in the beginning and 191.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 00:12:31,108 INFO L158 Benchmark]: TraceAbstraction took 33229.95ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 191.3MB in the beginning and 153.3MB in the end (delta: 38.0MB). Peak memory consumption was 151.8MB. Max. memory is 8.0GB. [2022-01-11 00:12:31,109 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory was 131.9MB in the beginning and 131.8MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.97ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 115.8MB in the beginning and 208.1MB in the end (delta: -92.3MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.59ms. Allocated memory is still 234.9MB. Free memory was 208.1MB in the beginning and 206.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.17ms. Allocated memory is still 234.9MB. Free memory was 206.5MB in the beginning and 205.5MB in the end (delta: 997.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 192.85ms. Allocated memory is still 234.9MB. Free memory was 205.3MB in the beginning and 195.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 64.75ms. Allocated memory is still 234.9MB. Free memory was 195.0MB in the beginning and 191.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 33229.95ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 191.3MB in the beginning and 153.3MB in the end (delta: 38.0MB). Peak memory consumption was 151.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: 41]: 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 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 3152 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2855 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3304 IncrementalHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 297 mSDtfsCounter, 3304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1201 GetRequests, 901 SyntacticMatches, 46 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1943 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=10, InterpolantAutomatonStates: 149, 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, 12 MinimizatonAttempts, 49 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 209 PreInvPairs, 357 NumberOfFragments, 168 HoareAnnotationTreeSize, 209 FomulaSimplifications, 3133 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5828 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1372 ConstructedInterpolants, 0 QuantifiedInterpolants, 7720 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2791 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 1407/1941 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(x, 4bv32) && ~bvule32(4bv32, x) RESULT: Ultimate proved your program to be correct! [2022-01-11 00:12:31,130 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...