/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/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:23:01,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:23:01,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:23:01,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:23:01,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:23:01,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:23:01,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:23:01,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:23:01,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:23:01,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:23:01,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:23:01,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:23:01,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:23:01,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:23:01,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:23:01,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:23:01,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:23:01,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:23:01,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:23:01,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:23:01,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:23:01,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:23:01,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:23:01,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:23:01,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:23:01,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:23:01,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:23:01,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:23:01,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:23:01,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:23:01,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:23:01,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:23:01,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:23:01,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:23:01,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:23:01,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:23:01,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:23:01,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:23:01,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:23:01,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:23:01,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:23:01,431 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:23:01,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:23:01,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:23:01,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:23:01,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:23:01,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:23:01,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:23:01,472 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:23:01,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:23:01,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:23:01,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:23:01,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:23:01,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:23:01,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:23:01,473 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:23:01,473 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:23:01,473 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:23:01,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:23:01,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:23:01,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:23:01,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:23:01,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:23:01,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:23:01,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:23:01,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:23:01,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:23:01,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:23:01,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:23:01,475 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:23:01,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:23:01,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:23:01,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:23:01,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:23:01,476 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:23:01,476 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:23:01,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:23:01,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:23:01,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:23:01,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:23:01,682 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:23:01,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2022-01-11 00:23:01,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa3efb46/2a6fd516f68c4e3bb338f421f2da68ca/FLAG27fb45b3b [2022-01-11 00:23:02,121 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:23:02,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2022-01-11 00:23:02,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa3efb46/2a6fd516f68c4e3bb338f421f2da68ca/FLAG27fb45b3b [2022-01-11 00:23:02,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa3efb46/2a6fd516f68c4e3bb338f421f2da68ca [2022-01-11 00:23:02,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:23:02,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:23:02,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:23:02,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:23:02,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:23:02,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50232bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02, skipping insertion in model container [2022-01-11 00:23:02,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:23:02,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:23:02,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c[28192,28205] [2022-01-11 00:23:02,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:23:02,498 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:23:02,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c[28192,28205] [2022-01-11 00:23:02,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:23:02,575 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:23:02,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02 WrapperNode [2022-01-11 00:23:02,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:23:02,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:23:02,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:23:02,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:23:02,582 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:23:02" (1/1) ... [2022-01-11 00:23:02,595 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:23:02" (1/1) ... [2022-01-11 00:23:02,635 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 925 [2022-01-11 00:23:02,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:23:02,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:23:02,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:23:02,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:23:02,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:23:02,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:23:02,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:23:02,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:23:02,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (1/1) ... [2022-01-11 00:23:02,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:23:02,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:23:02,720 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:23:02,739 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:23:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:23:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:23:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:23:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:23:02,922 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:23:02,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:23:03,594 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:23:03,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:23:03,604 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 00:23:03,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:23:03 BoogieIcfgContainer [2022-01-11 00:23:03,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:23:03,607 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:23:03,607 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:23:03,608 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:23:03,610 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:23:03" (1/1) ... [2022-01-11 00:23:04,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:23:04 BasicIcfg [2022-01-11 00:23:04,098 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:23:04,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:23:04,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:23:04,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:23:04,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:23:02" (1/4) ... [2022-01-11 00:23:04,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e09bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:23:04, skipping insertion in model container [2022-01-11 00:23:04,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:23:02" (2/4) ... [2022-01-11 00:23:04,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e09bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:23:04, skipping insertion in model container [2022-01-11 00:23:04,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:23:03" (3/4) ... [2022-01-11 00:23:04,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e09bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:23:04, skipping insertion in model container [2022-01-11 00:23:04,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:23:04" (4/4) ... [2022-01-11 00:23:04,103 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.cTransformedIcfg [2022-01-11 00:23:04,107 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:23:04,107 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:23:04,145 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:23:04,150 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:23:04,151 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:23:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 302 states have (on average 1.8079470198675496) internal successors, (546), 303 states have internal predecessors, (546), 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:23:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-11 00:23:04,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:04,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:04,182 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash 970465804, now seen corresponding path program 1 times [2022-01-11 00:23:04,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:04,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487687257] [2022-01-11 00:23:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:04,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:04,504 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:23:04,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:04,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487687257] [2022-01-11 00:23:04,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487687257] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:04,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:04,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:23:04,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87404977] [2022-01-11 00:23:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:04,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 00:23:04,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:04,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 00:23:04,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 00:23:04,531 INFO L87 Difference]: Start difference. First operand has 304 states, 302 states have (on average 1.8079470198675496) internal successors, (546), 303 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:23:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:04,557 INFO L93 Difference]: Finished difference Result 417 states and 738 transitions. [2022-01-11 00:23:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 00:23:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-01-11 00:23:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:04,567 INFO L225 Difference]: With dead ends: 417 [2022-01-11 00:23:04,567 INFO L226 Difference]: Without dead ends: 300 [2022-01-11 00:23:04,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 00:23:04,571 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:04,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:23:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-11 00:23:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-01-11 00:23:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.8026755852842808) internal successors, (539), 299 states have internal predecessors, (539), 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:23:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 539 transitions. [2022-01-11 00:23:04,605 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 539 transitions. Word has length 77 [2022-01-11 00:23:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:04,605 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 539 transitions. [2022-01-11 00:23:04,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:23:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 539 transitions. [2022-01-11 00:23:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-11 00:23:04,607 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:04,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:04,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:23:04,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash 903459051, now seen corresponding path program 1 times [2022-01-11 00:23:04,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:04,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405188837] [2022-01-11 00:23:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:04,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:04,804 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:23:04,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405188837] [2022-01-11 00:23:04,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405188837] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:04,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:04,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:23:04,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022285924] [2022-01-11 00:23:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:04,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:23:04,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:23:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:23:04,807 INFO L87 Difference]: Start difference. First operand 300 states and 539 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:23:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:04,971 INFO L93 Difference]: Finished difference Result 412 states and 728 transitions. [2022-01-11 00:23:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:23:04,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-01-11 00:23:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:04,979 INFO L225 Difference]: With dead ends: 412 [2022-01-11 00:23:04,979 INFO L226 Difference]: Without dead ends: 300 [2022-01-11 00:23:04,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:23:04,980 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 3 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:04,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 2103 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:23:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-11 00:23:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-01-11 00:23:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.6622073578595318) internal successors, (497), 299 states have internal predecessors, (497), 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:23:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 497 transitions. [2022-01-11 00:23:05,000 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 497 transitions. Word has length 77 [2022-01-11 00:23:05,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:05,001 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 497 transitions. [2022-01-11 00:23:05,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:23:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 497 transitions. [2022-01-11 00:23:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-11 00:23:05,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:05,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:05,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:23:05,005 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash -629722573, now seen corresponding path program 1 times [2022-01-11 00:23:05,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:05,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304499448] [2022-01-11 00:23:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:05,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:05,319 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:23:05,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304499448] [2022-01-11 00:23:05,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304499448] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:05,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:05,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:23:05,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355907619] [2022-01-11 00:23:05,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:05,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:23:05,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:05,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:23:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:05,324 INFO L87 Difference]: Start difference. First operand 300 states and 497 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:23:07,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:23:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:07,589 INFO L93 Difference]: Finished difference Result 505 states and 846 transitions. [2022-01-11 00:23:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:23:07,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-01-11 00:23:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:07,592 INFO L225 Difference]: With dead ends: 505 [2022-01-11 00:23:07,592 INFO L226 Difference]: Without dead ends: 397 [2022-01-11 00:23:07,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:07,593 INFO L933 BasicCegarLoop]: 630 mSDtfsCounter, 156 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:07,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 1076 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-11 00:23:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-01-11 00:23:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2022-01-11 00:23:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.6624365482233503) internal successors, (655), 394 states have internal predecessors, (655), 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:23:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 655 transitions. [2022-01-11 00:23:07,622 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 655 transitions. Word has length 118 [2022-01-11 00:23:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:07,624 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 655 transitions. [2022-01-11 00:23:07,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:23:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 655 transitions. [2022-01-11 00:23:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 00:23:07,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:07,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:07,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:23:07,630 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1973866257, now seen corresponding path program 1 times [2022-01-11 00:23:07,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:07,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719375662] [2022-01-11 00:23:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:07,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:07,786 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:23:07,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:07,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719375662] [2022-01-11 00:23:07,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719375662] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:07,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:07,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:23:07,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697505004] [2022-01-11 00:23:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:07,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:23:07,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:07,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:23:07,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:07,788 INFO L87 Difference]: Start difference. First operand 395 states and 655 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:23:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:07,817 INFO L93 Difference]: Finished difference Result 593 states and 993 transitions. [2022-01-11 00:23:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:23:07,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-11 00:23:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:07,821 INFO L225 Difference]: With dead ends: 593 [2022-01-11 00:23:07,821 INFO L226 Difference]: Without dead ends: 485 [2022-01-11 00:23:07,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:07,831 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 165 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:07,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 1101 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:23:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-01-11 00:23:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 483. [2022-01-11 00:23:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.670124481327801) internal successors, (805), 482 states have internal predecessors, (805), 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:23:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 805 transitions. [2022-01-11 00:23:07,852 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 805 transitions. Word has length 121 [2022-01-11 00:23:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:07,853 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 805 transitions. [2022-01-11 00:23:07,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:23:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 805 transitions. [2022-01-11 00:23:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 00:23:07,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:07,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:07,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:23:07,855 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:07,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1238876495, now seen corresponding path program 1 times [2022-01-11 00:23:07,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286562605] [2022-01-11 00:23:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:07,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:08,002 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:23:08,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:08,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286562605] [2022-01-11 00:23:08,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286562605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:08,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:08,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:23:08,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066786472] [2022-01-11 00:23:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:08,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:23:08,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:08,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:23:08,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:23:08,004 INFO L87 Difference]: Start difference. First operand 483 states and 805 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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:23:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:08,107 INFO L93 Difference]: Finished difference Result 1386 states and 2302 transitions. [2022-01-11 00:23:08,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:23:08,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-11 00:23:08,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:08,111 INFO L225 Difference]: With dead ends: 1386 [2022-01-11 00:23:08,111 INFO L226 Difference]: Without dead ends: 950 [2022-01-11 00:23:08,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:23:08,116 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 1335 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:08,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1335 Valid, 960 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:23:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-01-11 00:23:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2022-01-11 00:23:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 947 states have (on average 1.6599788806758184) internal successors, (1572), 947 states have internal predecessors, (1572), 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:23:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1572 transitions. [2022-01-11 00:23:08,144 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1572 transitions. Word has length 121 [2022-01-11 00:23:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:08,145 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1572 transitions. [2022-01-11 00:23:08,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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:23:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1572 transitions. [2022-01-11 00:23:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-11 00:23:08,151 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:08,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:08,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:23:08,151 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -153075355, now seen corresponding path program 1 times [2022-01-11 00:23:08,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:08,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965125757] [2022-01-11 00:23:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:08,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:08,281 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:23:08,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:08,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965125757] [2022-01-11 00:23:08,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965125757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:08,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:08,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:23:08,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419060174] [2022-01-11 00:23:08,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:08,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:23:08,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:08,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:23:08,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:23:08,282 INFO L87 Difference]: Start difference. First operand 948 states and 1572 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:23:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:08,384 INFO L93 Difference]: Finished difference Result 2802 states and 4643 transitions. [2022-01-11 00:23:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:23:08,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-01-11 00:23:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:08,390 INFO L225 Difference]: With dead ends: 2802 [2022-01-11 00:23:08,390 INFO L226 Difference]: Without dead ends: 1866 [2022-01-11 00:23:08,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:23:08,392 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 1317 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:08,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1317 Valid, 965 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:23:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-01-11 00:23:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1864. [2022-01-11 00:23:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 1.6473429951690821) internal successors, (3069), 1863 states have internal predecessors, (3069), 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:23:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 3069 transitions. [2022-01-11 00:23:08,440 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 3069 transitions. Word has length 123 [2022-01-11 00:23:08,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:08,441 INFO L470 AbstractCegarLoop]: Abstraction has 1864 states and 3069 transitions. [2022-01-11 00:23:08,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:23:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 3069 transitions. [2022-01-11 00:23:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-11 00:23:08,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:08,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:08,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:23:08,444 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1767457265, now seen corresponding path program 1 times [2022-01-11 00:23:08,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:08,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478273034] [2022-01-11 00:23:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:08,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:08,572 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:23:08,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:08,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478273034] [2022-01-11 00:23:08,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478273034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:08,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:08,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:23:08,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600375174] [2022-01-11 00:23:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:08,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:23:08,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:08,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:23:08,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:23:08,574 INFO L87 Difference]: Start difference. First operand 1864 states and 3069 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:23:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:08,747 INFO L93 Difference]: Finished difference Result 5441 states and 8943 transitions. [2022-01-11 00:23:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:23:08,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-01-11 00:23:08,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:08,758 INFO L225 Difference]: With dead ends: 5441 [2022-01-11 00:23:08,758 INFO L226 Difference]: Without dead ends: 3683 [2022-01-11 00:23:08,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:23:08,761 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 1311 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:08,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1311 Valid, 976 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:23:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2022-01-11 00:23:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3681. [2022-01-11 00:23:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.6366847826086957) internal successors, (6023), 3680 states have internal predecessors, (6023), 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:23:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6023 transitions. [2022-01-11 00:23:08,895 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6023 transitions. Word has length 125 [2022-01-11 00:23:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:08,896 INFO L470 AbstractCegarLoop]: Abstraction has 3681 states and 6023 transitions. [2022-01-11 00:23:08,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:23:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6023 transitions. [2022-01-11 00:23:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-01-11 00:23:08,900 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:08,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:08,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:23:08,900 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash 609613960, now seen corresponding path program 1 times [2022-01-11 00:23:08,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:08,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090282217] [2022-01-11 00:23:08,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:08,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:09,116 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:23:09,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090282217] [2022-01-11 00:23:09,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090282217] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:09,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:09,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:23:09,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584344948] [2022-01-11 00:23:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:09,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:23:09,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:09,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:23:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:09,118 INFO L87 Difference]: Start difference. First operand 3681 states and 6023 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:23:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:09,271 INFO L93 Difference]: Finished difference Result 7905 states and 13085 transitions. [2022-01-11 00:23:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:23:09,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-01-11 00:23:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:09,288 INFO L225 Difference]: With dead ends: 7905 [2022-01-11 00:23:09,288 INFO L226 Difference]: Without dead ends: 5691 [2022-01-11 00:23:09,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:09,295 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 151 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:09,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 959 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:23:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5691 states. [2022-01-11 00:23:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5691 to 5689. [2022-01-11 00:23:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5689 states, 5688 states have (on average 1.6425808720112518) internal successors, (9343), 5688 states have internal predecessors, (9343), 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:23:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 9343 transitions. [2022-01-11 00:23:09,518 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 9343 transitions. Word has length 127 [2022-01-11 00:23:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:09,518 INFO L470 AbstractCegarLoop]: Abstraction has 5689 states and 9343 transitions. [2022-01-11 00:23:09,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:23:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 9343 transitions. [2022-01-11 00:23:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-11 00:23:09,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:09,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:09,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:23:09,522 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -753355142, now seen corresponding path program 1 times [2022-01-11 00:23:09,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:09,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693158120] [2022-01-11 00:23:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:09,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:09,642 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:23:09,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:09,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693158120] [2022-01-11 00:23:09,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693158120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:09,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:09,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:23:09,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191855748] [2022-01-11 00:23:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:09,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:23:09,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:09,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:23:09,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:23:09,644 INFO L87 Difference]: Start difference. First operand 5689 states and 9343 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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:23:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:10,039 INFO L93 Difference]: Finished difference Result 16581 states and 27201 transitions. [2022-01-11 00:23:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:23:10,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-11 00:23:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:10,085 INFO L225 Difference]: With dead ends: 16581 [2022-01-11 00:23:10,085 INFO L226 Difference]: Without dead ends: 11135 [2022-01-11 00:23:10,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:23:10,096 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 1269 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:10,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1269 Valid, 947 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:23:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2022-01-11 00:23:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 11133. [2022-01-11 00:23:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11133 states, 11132 states have (on average 1.6337585339561624) internal successors, (18187), 11132 states have internal predecessors, (18187), 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:23:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11133 states to 11133 states and 18187 transitions. [2022-01-11 00:23:10,582 INFO L78 Accepts]: Start accepts. Automaton has 11133 states and 18187 transitions. Word has length 130 [2022-01-11 00:23:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:10,582 INFO L470 AbstractCegarLoop]: Abstraction has 11133 states and 18187 transitions. [2022-01-11 00:23:10,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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:23:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 11133 states and 18187 transitions. [2022-01-11 00:23:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-11 00:23:10,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:10,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:10,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:23:10,626 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:10,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:10,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1756406923, now seen corresponding path program 1 times [2022-01-11 00:23:10,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:10,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424354947] [2022-01-11 00:23:10,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:10,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:10,733 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:23:10,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:10,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424354947] [2022-01-11 00:23:10,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424354947] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:10,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:10,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:23:10,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553644141] [2022-01-11 00:23:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:10,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:23:10,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:23:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:10,734 INFO L87 Difference]: Start difference. First operand 11133 states and 18187 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:23:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:11,111 INFO L93 Difference]: Finished difference Result 19145 states and 31525 transitions. [2022-01-11 00:23:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:23:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-11 00:23:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:11,140 INFO L225 Difference]: With dead ends: 19145 [2022-01-11 00:23:11,140 INFO L226 Difference]: Without dead ends: 14775 [2022-01-11 00:23:11,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:11,149 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 154 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:11,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 1091 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:23:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14775 states. [2022-01-11 00:23:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14775 to 14773. [2022-01-11 00:23:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14773 states, 14772 states have (on average 1.634646628757108) internal successors, (24147), 14772 states have internal predecessors, (24147), 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:23:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14773 states to 14773 states and 24147 transitions. [2022-01-11 00:23:11,634 INFO L78 Accepts]: Start accepts. Automaton has 14773 states and 24147 transitions. Word has length 130 [2022-01-11 00:23:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:11,634 INFO L470 AbstractCegarLoop]: Abstraction has 14773 states and 24147 transitions. [2022-01-11 00:23:11,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:23:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 14773 states and 24147 transitions. [2022-01-11 00:23:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 00:23:11,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:11,642 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:11,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:23:11,642 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:11,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 356468432, now seen corresponding path program 1 times [2022-01-11 00:23:11,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:11,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707613921] [2022-01-11 00:23:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:11,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:11,809 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:23:11,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:11,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707613921] [2022-01-11 00:23:11,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707613921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:11,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:11,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:23:11,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252662564] [2022-01-11 00:23:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:11,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:23:11,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:23:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:23:11,811 INFO L87 Difference]: Start difference. First operand 14773 states and 24147 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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:23:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:12,725 INFO L93 Difference]: Finished difference Result 43009 states and 70155 transitions. [2022-01-11 00:23:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:23:12,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-01-11 00:23:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:12,776 INFO L225 Difference]: With dead ends: 43009 [2022-01-11 00:23:12,776 INFO L226 Difference]: Without dead ends: 29103 [2022-01-11 00:23:12,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:23:12,789 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 1263 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:12,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 990 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:23:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29103 states. [2022-01-11 00:23:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29103 to 29101. [2022-01-11 00:23:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29101 states, 29100 states have (on average 1.6234020618556702) internal successors, (47241), 29100 states have internal predecessors, (47241), 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:23:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29101 states to 29101 states and 47241 transitions. [2022-01-11 00:23:13,945 INFO L78 Accepts]: Start accepts. Automaton has 29101 states and 47241 transitions. Word has length 132 [2022-01-11 00:23:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:13,945 INFO L470 AbstractCegarLoop]: Abstraction has 29101 states and 47241 transitions. [2022-01-11 00:23:13,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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:23:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 29101 states and 47241 transitions. [2022-01-11 00:23:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-11 00:23:13,959 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:13,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:13,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:23:13,960 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -53416518, now seen corresponding path program 1 times [2022-01-11 00:23:13,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994948882] [2022-01-11 00:23:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:13,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:14,082 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:23:14,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:14,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994948882] [2022-01-11 00:23:14,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994948882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:14,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:14,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:23:14,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548343405] [2022-01-11 00:23:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:14,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:23:14,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:14,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:23:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:23:14,085 INFO L87 Difference]: Start difference. First operand 29101 states and 47241 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:23:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:15,786 INFO L93 Difference]: Finished difference Result 85403 states and 138403 transitions. [2022-01-11 00:23:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:23:15,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-01-11 00:23:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:15,918 INFO L225 Difference]: With dead ends: 85403 [2022-01-11 00:23:15,919 INFO L226 Difference]: Without dead ends: 57353 [2022-01-11 00:23:15,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:23:15,944 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 1238 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:15,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1238 Valid, 987 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:23:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57353 states. [2022-01-11 00:23:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57353 to 57351. [2022-01-11 00:23:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57351 states, 57350 states have (on average 1.611734960767219) internal successors, (92433), 57350 states have internal predecessors, (92433), 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:23:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57351 states to 57351 states and 92433 transitions. [2022-01-11 00:23:18,281 INFO L78 Accepts]: Start accepts. Automaton has 57351 states and 92433 transitions. Word has length 134 [2022-01-11 00:23:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:18,281 INFO L470 AbstractCegarLoop]: Abstraction has 57351 states and 92433 transitions. [2022-01-11 00:23:18,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:23:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 57351 states and 92433 transitions. [2022-01-11 00:23:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-01-11 00:23:18,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:18,307 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:23:18,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:23:18,307 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:18,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:18,308 INFO L85 PathProgramCache]: Analyzing trace with hash 962994164, now seen corresponding path program 1 times [2022-01-11 00:23:18,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:18,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116617751] [2022-01-11 00:23:18,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:18,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:18,502 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:23:18,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:18,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116617751] [2022-01-11 00:23:18,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116617751] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:18,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:18,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:23:18,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264162061] [2022-01-11 00:23:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:18,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:23:18,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:23:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:18,504 INFO L87 Difference]: Start difference. First operand 57351 states and 92433 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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:23:20,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:23:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:24,182 INFO L93 Difference]: Finished difference Result 144523 states and 234515 transitions. [2022-01-11 00:23:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:23:24,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-01-11 00:23:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:24,397 INFO L225 Difference]: With dead ends: 144523 [2022-01-11 00:23:24,397 INFO L226 Difference]: Without dead ends: 98633 [2022-01-11 00:23:24,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:24,455 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 138 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:24,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 961 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-11 00:23:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98633 states. [2022-01-11 00:23:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98633 to 98631. [2022-01-11 00:23:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98631 states, 98630 states have (on average 1.6107168204400284) internal successors, (158865), 98630 states have internal predecessors, (158865), 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:23:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98631 states to 98631 states and 158865 transitions. [2022-01-11 00:23:28,641 INFO L78 Accepts]: Start accepts. Automaton has 98631 states and 158865 transitions. Word has length 136 [2022-01-11 00:23:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:28,641 INFO L470 AbstractCegarLoop]: Abstraction has 98631 states and 158865 transitions. [2022-01-11 00:23:28,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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:23:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 98631 states and 158865 transitions. [2022-01-11 00:23:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-11 00:23:28,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:28,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:28,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:23:28,672 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1425543378, now seen corresponding path program 1 times [2022-01-11 00:23:28,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:28,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709288576] [2022-01-11 00:23:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:28,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:28,800 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:23:28,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:28,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709288576] [2022-01-11 00:23:28,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709288576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:28,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:28,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:23:28,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104728478] [2022-01-11 00:23:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:28,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:23:28,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:28,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:23:28,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:23:28,802 INFO L87 Difference]: Start difference. First operand 98631 states and 158865 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:23:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:36,275 INFO L93 Difference]: Finished difference Result 290049 states and 466903 transitions. [2022-01-11 00:23:36,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:23:36,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-01-11 00:23:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:36,623 INFO L225 Difference]: With dead ends: 290049 [2022-01-11 00:23:36,624 INFO L226 Difference]: Without dead ends: 193727 [2022-01-11 00:23:36,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:23:36,716 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 1225 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:36,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1225 Valid, 977 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:23:36,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193727 states. [2022-01-11 00:23:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193727 to 193725. [2022-01-11 00:23:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193725 states, 193724 states have (on average 1.6018923829778449) internal successors, (310325), 193724 states have internal predecessors, (310325), 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:23:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193725 states to 193725 states and 310325 transitions. [2022-01-11 00:23:45,727 INFO L78 Accepts]: Start accepts. Automaton has 193725 states and 310325 transitions. Word has length 139 [2022-01-11 00:23:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:23:45,728 INFO L470 AbstractCegarLoop]: Abstraction has 193725 states and 310325 transitions. [2022-01-11 00:23:45,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:23:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 193725 states and 310325 transitions. [2022-01-11 00:23:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-11 00:23:45,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:23:45,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:23:45,797 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:23:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:23:45,798 INFO L85 PathProgramCache]: Analyzing trace with hash -560575424, now seen corresponding path program 1 times [2022-01-11 00:23:45,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:23:45,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683657947] [2022-01-11 00:23:45,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:23:45,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:23:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:23:45,843 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:23:45,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:23:45,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683657947] [2022-01-11 00:23:45,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683657947] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:23:45,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:23:45,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:23:45,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23476581] [2022-01-11 00:23:45,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:23:45,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:23:45,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:23:45,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:23:45,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:45,845 INFO L87 Difference]: Start difference. First operand 193725 states and 310325 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:23:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:23:56,912 INFO L93 Difference]: Finished difference Result 387798 states and 619526 transitions. [2022-01-11 00:23:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:23:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-01-11 00:23:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:23:57,661 INFO L225 Difference]: With dead ends: 387798 [2022-01-11 00:23:57,662 INFO L226 Difference]: Without dead ends: 289919 [2022-01-11 00:23:57,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:23:57,765 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 475 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:23:57,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 1099 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:23:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289919 states. [2022-01-11 00:24:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289919 to 193725. [2022-01-11 00:24:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193725 states, 193724 states have (on average 1.6018614110796803) internal successors, (310319), 193724 states have internal predecessors, (310319), 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:24:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193725 states to 193725 states and 310319 transitions. [2022-01-11 00:24:07,399 INFO L78 Accepts]: Start accepts. Automaton has 193725 states and 310319 transitions. Word has length 139 [2022-01-11 00:24:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:24:07,400 INFO L470 AbstractCegarLoop]: Abstraction has 193725 states and 310319 transitions. [2022-01-11 00:24:07,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:24:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 193725 states and 310319 transitions. [2022-01-11 00:24:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-11 00:24:07,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:24:07,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:07,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:24:07,442 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:24:07,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:24:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash -116095727, now seen corresponding path program 1 times [2022-01-11 00:24:07,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:24:07,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113023786] [2022-01-11 00:24:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:24:07,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:24:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:24:07,484 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:24:07,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:24:07,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113023786] [2022-01-11 00:24:07,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113023786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:24:07,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:24:07,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:24:07,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515076580] [2022-01-11 00:24:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:24:07,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:24:07,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:24:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:24:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:24:07,486 INFO L87 Difference]: Start difference. First operand 193725 states and 310319 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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)