/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_BITWISE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:11:49,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:11:49,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:11:49,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:11:49,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:11:49,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:11:49,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:11:49,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:11:49,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:11:49,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:11:49,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:11:49,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:11:49,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:11:49,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:11:49,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:11:49,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:11:49,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:11:49,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:11:49,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:11:49,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:11:49,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:11:49,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:11:49,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:11:49,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:11:49,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:11:49,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:11:49,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:11:49,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:11:49,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:11:49,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:11:49,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:11:49,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:11:49,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:11:49,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:11:49,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:11:49,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:11:49,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:11:49,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:11:49,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:11:49,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:11:49,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:11:49,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 14:11:49,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:11:49,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:11:49,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:11:49,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:11:49,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:11:49,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:11:49,518 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:11:49,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:11:49,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:11:49,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:11:49,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:11:49,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:11:49,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:11:49,519 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:11:49,519 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:11:49,519 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:11:49,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:11:49,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:11:49,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:11:49,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:11:49,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:11:49,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:11:49,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:11:49,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:11:49,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:11:49,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:11:49,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:11:49,520 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:11:49,520 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:11:49,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:11:49,521 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:11:49,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:11:49,521 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:11:49,521 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 14:11:49,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:11:49,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:11:49,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:11:49,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:11:49,703 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:11:49,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-01-10 14:11:49,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf666a6b3/38e5b7e0c5d642c694dcf2a74e53bcb1/FLAGcb406cde6 [2022-01-10 14:11:50,090 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:11:50,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-01-10 14:11:50,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf666a6b3/38e5b7e0c5d642c694dcf2a74e53bcb1/FLAGcb406cde6 [2022-01-10 14:11:50,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf666a6b3/38e5b7e0c5d642c694dcf2a74e53bcb1 [2022-01-10 14:11:50,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:11:50,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:11:50,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:11:50,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:11:50,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:11:50,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3838603e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50, skipping insertion in model container [2022-01-10 14:11:50,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:11:50,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:11:50,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2022-01-10 14:11:50,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2022-01-10 14:11:50,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:11:50,371 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:11:50,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2022-01-10 14:11:50,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2022-01-10 14:11:50,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:11:50,420 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:11:50,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50 WrapperNode [2022-01-10 14:11:50,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:11:50,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:11:50,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:11:50,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:11:50,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,482 INFO L137 Inliner]: procedures = 58, calls = 64, calls flagged for inlining = 59, calls inlined = 77, statements flattened = 907 [2022-01-10 14:11:50,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:11:50,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:11:50,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:11:50,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:11:50,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:11:50,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:11:50,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:11:50,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:11:50,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (1/1) ... [2022-01-10 14:11:50,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:11:50,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:11:50,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 14:11:50,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 14:11:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:11:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:11:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:11:50,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:11:50,719 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:11:50,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:11:51,306 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:11:51,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:11:51,314 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-01-10 14:11:51,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:11:51 BoogieIcfgContainer [2022-01-10 14:11:51,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:11:51,316 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:11:51,316 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:11:51,317 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:11:51,319 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:11:51" (1/1) ... [2022-01-10 14:11:51,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:11:51 BasicIcfg [2022-01-10 14:11:51,476 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:11:51,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:11:51,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:11:51,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:11:51,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:11:50" (1/4) ... [2022-01-10 14:11:51,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d033d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:11:51, skipping insertion in model container [2022-01-10 14:11:51,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:50" (2/4) ... [2022-01-10 14:11:51,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d033d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:11:51, skipping insertion in model container [2022-01-10 14:11:51,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:11:51" (3/4) ... [2022-01-10 14:11:51,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d033d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:11:51, skipping insertion in model container [2022-01-10 14:11:51,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:11:51" (4/4) ... [2022-01-10 14:11:51,481 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.cTransformedIcfg [2022-01-10 14:11:51,485 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:11:51,485 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 14:11:51,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:11:51,530 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 14:11:51,530 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 14:11:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 338 states have (on average 1.5562130177514792) internal successors, (526), 342 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:51,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:51,556 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] [2022-01-10 14:11:51,557 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1181170379, now seen corresponding path program 1 times [2022-01-10 14:11:51,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:51,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023432395] [2022-01-10 14:11:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:51,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:51,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023432395] [2022-01-10 14:11:51,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023432395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:51,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:51,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:51,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82792221] [2022-01-10 14:11:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:51,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:51,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:51,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:51,808 INFO L87 Difference]: Start difference. First operand has 343 states, 338 states have (on average 1.5562130177514792) internal successors, (526), 342 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:51,947 INFO L93 Difference]: Finished difference Result 726 states and 1113 transitions. [2022-01-10 14:11:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:51,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:51,962 INFO L225 Difference]: With dead ends: 726 [2022-01-10 14:11:51,962 INFO L226 Difference]: Without dead ends: 426 [2022-01-10 14:11:51,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:51,966 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 124 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:51,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 962 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:11:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-01-10 14:11:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 422. [2022-01-10 14:11:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 418 states have (on average 1.4688995215311005) internal successors, (614), 421 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 614 transitions. [2022-01-10 14:11:52,021 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 614 transitions. Word has length 44 [2022-01-10 14:11:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:52,022 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 614 transitions. [2022-01-10 14:11:52,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 614 transitions. [2022-01-10 14:11:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:52,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:52,027 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] [2022-01-10 14:11:52,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:11:52,028 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1541911629, now seen corresponding path program 1 times [2022-01-10 14:11:52,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:52,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312059025] [2022-01-10 14:11:52,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:52,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:52,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-10 14:11:52,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312059025] [2022-01-10 14:11:52,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312059025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:52,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:52,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:52,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343698710] [2022-01-10 14:11:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:52,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:52,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:52,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:52,119 INFO L87 Difference]: Start difference. First operand 422 states and 614 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:52,162 INFO L93 Difference]: Finished difference Result 708 states and 1012 transitions. [2022-01-10 14:11:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:52,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:52,165 INFO L225 Difference]: With dead ends: 708 [2022-01-10 14:11:52,166 INFO L226 Difference]: Without dead ends: 578 [2022-01-10 14:11:52,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:52,170 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 452 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:52,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 607 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-01-10 14:11:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 574. [2022-01-10 14:11:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 570 states have (on average 1.4385964912280702) internal successors, (820), 573 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 820 transitions. [2022-01-10 14:11:52,200 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 820 transitions. Word has length 44 [2022-01-10 14:11:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:52,200 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 820 transitions. [2022-01-10 14:11:52,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 820 transitions. [2022-01-10 14:11:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 14:11:52,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:52,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:52,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:11:52,202 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:52,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:52,202 INFO L85 PathProgramCache]: Analyzing trace with hash -850262075, now seen corresponding path program 1 times [2022-01-10 14:11:52,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:52,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336598753] [2022-01-10 14:11:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:52,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:52,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336598753] [2022-01-10 14:11:52,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336598753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:52,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:52,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:52,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276987011] [2022-01-10 14:11:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:52,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:52,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:52,301 INFO L87 Difference]: Start difference. First operand 574 states and 820 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:52,338 INFO L93 Difference]: Finished difference Result 1122 states and 1580 transitions. [2022-01-10 14:11:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2022-01-10 14:11:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:52,341 INFO L225 Difference]: With dead ends: 1122 [2022-01-10 14:11:52,341 INFO L226 Difference]: Without dead ends: 787 [2022-01-10 14:11:52,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:52,342 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 94 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:52,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 912 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-01-10 14:11:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 773. [2022-01-10 14:11:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 769 states have (on average 1.4148244473342002) internal successors, (1088), 772 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1088 transitions. [2022-01-10 14:11:52,390 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1088 transitions. Word has length 45 [2022-01-10 14:11:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:52,391 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1088 transitions. [2022-01-10 14:11:52,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,391 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1088 transitions. [2022-01-10 14:11:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 14:11:52,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:52,392 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] [2022-01-10 14:11:52,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:11:52,392 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:52,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash -820679612, now seen corresponding path program 1 times [2022-01-10 14:11:52,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:52,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685934199] [2022-01-10 14:11:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:52,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:52,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:52,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685934199] [2022-01-10 14:11:52,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685934199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:52,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:52,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:52,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940400413] [2022-01-10 14:11:52,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:52,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:52,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:52,447 INFO L87 Difference]: Start difference. First operand 773 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:52,493 INFO L93 Difference]: Finished difference Result 1661 states and 2300 transitions. [2022-01-10 14:11:52,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2022-01-10 14:11:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:52,498 INFO L225 Difference]: With dead ends: 1661 [2022-01-10 14:11:52,498 INFO L226 Difference]: Without dead ends: 1185 [2022-01-10 14:11:52,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:52,506 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 440 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:52,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 573 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2022-01-10 14:11:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1153. [2022-01-10 14:11:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1149 states have (on average 1.3820713664055702) internal successors, (1588), 1152 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1588 transitions. [2022-01-10 14:11:52,539 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1588 transitions. Word has length 45 [2022-01-10 14:11:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:52,540 INFO L470 AbstractCegarLoop]: Abstraction has 1153 states and 1588 transitions. [2022-01-10 14:11:52,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1588 transitions. [2022-01-10 14:11:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 14:11:52,541 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:52,541 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] [2022-01-10 14:11:52,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:11:52,541 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash -383186623, now seen corresponding path program 1 times [2022-01-10 14:11:52,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:52,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743555757] [2022-01-10 14:11:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:52,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:52,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:52,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743555757] [2022-01-10 14:11:52,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743555757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:52,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:52,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:52,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384071968] [2022-01-10 14:11:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:52,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:52,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:52,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:52,595 INFO L87 Difference]: Start difference. First operand 1153 states and 1588 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:52,640 INFO L93 Difference]: Finished difference Result 2356 states and 3201 transitions. [2022-01-10 14:11:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2022-01-10 14:11:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:52,644 INFO L225 Difference]: With dead ends: 2356 [2022-01-10 14:11:52,644 INFO L226 Difference]: Without dead ends: 1472 [2022-01-10 14:11:52,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:52,647 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 437 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:52,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 577 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-01-10 14:11:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1450. [2022-01-10 14:11:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1446 states have (on average 1.3644536652835408) internal successors, (1973), 1449 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1973 transitions. [2022-01-10 14:11:52,684 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1973 transitions. Word has length 51 [2022-01-10 14:11:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:52,686 INFO L470 AbstractCegarLoop]: Abstraction has 1450 states and 1973 transitions. [2022-01-10 14:11:52,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1973 transitions. [2022-01-10 14:11:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 14:11:52,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:52,688 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:52,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:11:52,688 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:52,688 INFO L85 PathProgramCache]: Analyzing trace with hash 970498707, now seen corresponding path program 1 times [2022-01-10 14:11:52,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:52,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492381860] [2022-01-10 14:11:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:52,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:11:52,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:52,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492381860] [2022-01-10 14:11:52,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492381860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:52,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:52,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:52,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879865920] [2022-01-10 14:11:52,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:52,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:52,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:52,733 INFO L87 Difference]: Start difference. First operand 1450 states and 1973 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:52,817 INFO L93 Difference]: Finished difference Result 3076 states and 4177 transitions. [2022-01-10 14:11:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:11:52,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2022-01-10 14:11:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:52,823 INFO L225 Difference]: With dead ends: 3076 [2022-01-10 14:11:52,823 INFO L226 Difference]: Without dead ends: 2125 [2022-01-10 14:11:52,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:11:52,824 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 395 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:52,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 2017 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2022-01-10 14:11:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1474. [2022-01-10 14:11:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1470 states have (on average 1.3462585034013606) internal successors, (1979), 1473 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1979 transitions. [2022-01-10 14:11:52,898 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1979 transitions. Word has length 52 [2022-01-10 14:11:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:52,898 INFO L470 AbstractCegarLoop]: Abstraction has 1474 states and 1979 transitions. [2022-01-10 14:11:52,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1979 transitions. [2022-01-10 14:11:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 14:11:52,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:52,899 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:52,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:11:52,899 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1374168334, now seen corresponding path program 1 times [2022-01-10 14:11:52,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:52,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918757275] [2022-01-10 14:11:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:52,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:11:52,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:52,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918757275] [2022-01-10 14:11:52,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918757275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:52,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:52,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:52,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843030545] [2022-01-10 14:11:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:52,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:52,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:52,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:52,938 INFO L87 Difference]: Start difference. First operand 1474 states and 1979 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:53,044 INFO L93 Difference]: Finished difference Result 3229 states and 4328 transitions. [2022-01-10 14:11:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:11:53,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2022-01-10 14:11:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:53,049 INFO L225 Difference]: With dead ends: 3229 [2022-01-10 14:11:53,050 INFO L226 Difference]: Without dead ends: 2064 [2022-01-10 14:11:53,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:11:53,053 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 354 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:53,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 2033 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2022-01-10 14:11:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1492. [2022-01-10 14:11:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1488 states have (on average 1.3286290322580645) internal successors, (1977), 1491 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1977 transitions. [2022-01-10 14:11:53,118 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1977 transitions. Word has length 52 [2022-01-10 14:11:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:53,118 INFO L470 AbstractCegarLoop]: Abstraction has 1492 states and 1977 transitions. [2022-01-10 14:11:53,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1977 transitions. [2022-01-10 14:11:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 14:11:53,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:53,134 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:53,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:11:53,134 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1362852207, now seen corresponding path program 1 times [2022-01-10 14:11:53,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:53,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025054660] [2022-01-10 14:11:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:53,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:53,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:53,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025054660] [2022-01-10 14:11:53,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025054660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:53,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:53,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:11:53,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238347399] [2022-01-10 14:11:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:53,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:11:53,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:11:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:11:53,214 INFO L87 Difference]: Start difference. First operand 1492 states and 1977 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:53,305 INFO L93 Difference]: Finished difference Result 1724 states and 2277 transitions. [2022-01-10 14:11:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 14:11:53,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-01-10 14:11:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:53,310 INFO L225 Difference]: With dead ends: 1724 [2022-01-10 14:11:53,310 INFO L226 Difference]: Without dead ends: 1722 [2022-01-10 14:11:53,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:53,311 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 1013 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:53,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1013 Valid, 573 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-01-10 14:11:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1490. [2022-01-10 14:11:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1487 states have (on average 1.3234700739744452) internal successors, (1968), 1489 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1968 transitions. [2022-01-10 14:11:53,393 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1968 transitions. Word has length 52 [2022-01-10 14:11:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:53,394 INFO L470 AbstractCegarLoop]: Abstraction has 1490 states and 1968 transitions. [2022-01-10 14:11:53,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1968 transitions. [2022-01-10 14:11:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 14:11:53,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:53,395 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:53,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:11:53,396 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 701255106, now seen corresponding path program 1 times [2022-01-10 14:11:53,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:53,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870190657] [2022-01-10 14:11:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:53,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:53,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:53,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870190657] [2022-01-10 14:11:53,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870190657] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:11:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895128394] [2022-01-10 14:11:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:53,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:11:53,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:11:53,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:11:53,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 14:11:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:53,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 14:11:53,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:11:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:53,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:11:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:54,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895128394] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:11:54,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:11:54,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 14:11:54,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939554455] [2022-01-10 14:11:54,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:11:54,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:11:54,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:54,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:11:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:11:54,199 INFO L87 Difference]: Start difference. First operand 1490 states and 1968 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:54,528 INFO L93 Difference]: Finished difference Result 3847 states and 5068 transitions. [2022-01-10 14:11:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:11:54,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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 53 [2022-01-10 14:11:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:54,539 INFO L225 Difference]: With dead ends: 3847 [2022-01-10 14:11:54,539 INFO L226 Difference]: Without dead ends: 3845 [2022-01-10 14:11:54,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:11:54,540 INFO L933 BasicCegarLoop]: 636 mSDtfsCounter, 1452 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:54,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1452 Valid, 2365 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2022-01-10 14:11:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 2465. [2022-01-10 14:11:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2462 states have (on average 1.3196588139723802) internal successors, (3249), 2464 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3249 transitions. [2022-01-10 14:11:54,731 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3249 transitions. Word has length 53 [2022-01-10 14:11:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:54,731 INFO L470 AbstractCegarLoop]: Abstraction has 2465 states and 3249 transitions. [2022-01-10 14:11:54,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3249 transitions. [2022-01-10 14:11:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:54,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:54,733 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] [2022-01-10 14:11:54,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 14:11:54,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:11:54,958 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:54,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1882862857, now seen corresponding path program 1 times [2022-01-10 14:11:54,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:54,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263984611] [2022-01-10 14:11:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:54,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:54,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:54,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263984611] [2022-01-10 14:11:54,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263984611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:54,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:54,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:54,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958528264] [2022-01-10 14:11:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:54,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:54,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:54,981 INFO L87 Difference]: Start difference. First operand 2465 states and 3249 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:55,303 INFO L93 Difference]: Finished difference Result 2858 states and 3834 transitions. [2022-01-10 14:11:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:55,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:55,310 INFO L225 Difference]: With dead ends: 2858 [2022-01-10 14:11:55,310 INFO L226 Difference]: Without dead ends: 2633 [2022-01-10 14:11:55,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:55,311 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 433 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:55,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 749 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2022-01-10 14:11:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2629. [2022-01-10 14:11:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2626 states have (on average 1.3297791317593297) internal successors, (3492), 2628 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3492 transitions. [2022-01-10 14:11:55,468 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3492 transitions. Word has length 55 [2022-01-10 14:11:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:55,468 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 3492 transitions. [2022-01-10 14:11:55,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3492 transitions. [2022-01-10 14:11:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:55,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:55,469 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] [2022-01-10 14:11:55,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 14:11:55,469 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1440108055, now seen corresponding path program 1 times [2022-01-10 14:11:55,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:55,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052476560] [2022-01-10 14:11:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:55,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:55,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:55,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052476560] [2022-01-10 14:11:55,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052476560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:55,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:55,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:55,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106536128] [2022-01-10 14:11:55,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:55,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:55,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:55,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:55,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:55,489 INFO L87 Difference]: Start difference. First operand 2629 states and 3492 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:55,661 INFO L93 Difference]: Finished difference Result 3017 states and 4070 transitions. [2022-01-10 14:11:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:55,667 INFO L225 Difference]: With dead ends: 3017 [2022-01-10 14:11:55,667 INFO L226 Difference]: Without dead ends: 2629 [2022-01-10 14:11:55,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:55,668 INFO L933 BasicCegarLoop]: 468 mSDtfsCounter, 463 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:55,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 468 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-01-10 14:11:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2629. [2022-01-10 14:11:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2626 states have (on average 1.3267326732673268) internal successors, (3484), 2628 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3484 transitions. [2022-01-10 14:11:55,807 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3484 transitions. Word has length 55 [2022-01-10 14:11:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:55,807 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 3484 transitions. [2022-01-10 14:11:55,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3484 transitions. [2022-01-10 14:11:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:55,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:55,808 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] [2022-01-10 14:11:55,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:11:55,808 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash -669456649, now seen corresponding path program 1 times [2022-01-10 14:11:55,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:55,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466499834] [2022-01-10 14:11:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:55,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:55,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:55,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466499834] [2022-01-10 14:11:55,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466499834] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:55,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:55,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:55,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983607925] [2022-01-10 14:11:55,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:55,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:55,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:55,836 INFO L87 Difference]: Start difference. First operand 2629 states and 3484 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:55,998 INFO L93 Difference]: Finished difference Result 3016 states and 4053 transitions. [2022-01-10 14:11:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:55,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:56,010 INFO L225 Difference]: With dead ends: 3016 [2022-01-10 14:11:56,010 INFO L226 Difference]: Without dead ends: 2629 [2022-01-10 14:11:56,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:56,011 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 457 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:56,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 463 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-01-10 14:11:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2629. [2022-01-10 14:11:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2626 states have (on average 1.3236862147753237) internal successors, (3476), 2628 states have internal predecessors, (3476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3476 transitions. [2022-01-10 14:11:56,169 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3476 transitions. Word has length 55 [2022-01-10 14:11:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:56,169 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 3476 transitions. [2022-01-10 14:11:56,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3476 transitions. [2022-01-10 14:11:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:56,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:56,170 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] [2022-01-10 14:11:56,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:11:56,171 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:56,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1756344855, now seen corresponding path program 1 times [2022-01-10 14:11:56,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:56,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006608676] [2022-01-10 14:11:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:56,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:56,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:56,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006608676] [2022-01-10 14:11:56,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006608676] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:56,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:56,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:56,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124542686] [2022-01-10 14:11:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:56,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:56,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:56,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:56,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:56,188 INFO L87 Difference]: Start difference. First operand 2629 states and 3476 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:56,334 INFO L93 Difference]: Finished difference Result 3015 states and 4036 transitions. [2022-01-10 14:11:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:56,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:56,340 INFO L225 Difference]: With dead ends: 3015 [2022-01-10 14:11:56,341 INFO L226 Difference]: Without dead ends: 2629 [2022-01-10 14:11:56,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:56,342 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 414 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:56,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 476 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-01-10 14:11:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2629. [2022-01-10 14:11:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2626 states have (on average 1.3175932977913176) internal successors, (3460), 2628 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3460 transitions. [2022-01-10 14:11:56,494 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3460 transitions. Word has length 55 [2022-01-10 14:11:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:56,494 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 3460 transitions. [2022-01-10 14:11:56,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3460 transitions. [2022-01-10 14:11:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:56,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:56,495 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] [2022-01-10 14:11:56,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 14:11:56,496 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1641467018, now seen corresponding path program 1 times [2022-01-10 14:11:56,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:56,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894273916] [2022-01-10 14:11:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:56,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:56,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894273916] [2022-01-10 14:11:56,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894273916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:56,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:56,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:56,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119318475] [2022-01-10 14:11:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:56,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:56,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:56,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:56,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:56,512 INFO L87 Difference]: Start difference. First operand 2629 states and 3460 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:56,702 INFO L93 Difference]: Finished difference Result 3014 states and 4003 transitions. [2022-01-10 14:11:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:56,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:56,709 INFO L225 Difference]: With dead ends: 3014 [2022-01-10 14:11:56,709 INFO L226 Difference]: Without dead ends: 2629 [2022-01-10 14:11:56,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:56,710 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 404 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:56,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-01-10 14:11:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2629. [2022-01-10 14:11:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2626 states have (on average 1.3115003808073116) internal successors, (3444), 2628 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3444 transitions. [2022-01-10 14:11:56,853 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3444 transitions. Word has length 55 [2022-01-10 14:11:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:56,853 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 3444 transitions. [2022-01-10 14:11:56,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3444 transitions. [2022-01-10 14:11:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:56,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:56,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] [2022-01-10 14:11:56,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:11:56,854 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2073001387, now seen corresponding path program 1 times [2022-01-10 14:11:56,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:56,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600258752] [2022-01-10 14:11:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:56,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:56,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:56,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600258752] [2022-01-10 14:11:56,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600258752] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:56,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:56,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:56,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470429701] [2022-01-10 14:11:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:56,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:56,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:56,873 INFO L87 Difference]: Start difference. First operand 2629 states and 3444 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:57,078 INFO L93 Difference]: Finished difference Result 3013 states and 3970 transitions. [2022-01-10 14:11:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:57,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:57,083 INFO L225 Difference]: With dead ends: 3013 [2022-01-10 14:11:57,083 INFO L226 Difference]: Without dead ends: 2629 [2022-01-10 14:11:57,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:57,085 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 394 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:57,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 454 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:57,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-01-10 14:11:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2629. [2022-01-10 14:11:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2626 states have (on average 1.3054074638233053) internal successors, (3428), 2628 states have internal predecessors, (3428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3428 transitions. [2022-01-10 14:11:57,233 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3428 transitions. Word has length 55 [2022-01-10 14:11:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:57,233 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 3428 transitions. [2022-01-10 14:11:57,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3428 transitions. [2022-01-10 14:11:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:57,234 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:57,234 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] [2022-01-10 14:11:57,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 14:11:57,234 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash 799425076, now seen corresponding path program 1 times [2022-01-10 14:11:57,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:57,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203308159] [2022-01-10 14:11:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:57,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:57,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:57,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203308159] [2022-01-10 14:11:57,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203308159] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:57,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:57,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:57,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181769570] [2022-01-10 14:11:57,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:57,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:57,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:57,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:57,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:57,278 INFO L87 Difference]: Start difference. First operand 2629 states and 3428 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:57,481 INFO L93 Difference]: Finished difference Result 3264 states and 4292 transitions. [2022-01-10 14:11:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:11:57,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:57,485 INFO L225 Difference]: With dead ends: 3264 [2022-01-10 14:11:57,485 INFO L226 Difference]: Without dead ends: 2887 [2022-01-10 14:11:57,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:11:57,487 INFO L933 BasicCegarLoop]: 458 mSDtfsCounter, 806 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:57,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 1406 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2022-01-10 14:11:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2635. [2022-01-10 14:11:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2632 states have (on average 1.3016717325227964) internal successors, (3426), 2634 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3426 transitions. [2022-01-10 14:11:57,657 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3426 transitions. Word has length 55 [2022-01-10 14:11:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:57,657 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 3426 transitions. [2022-01-10 14:11:57,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3426 transitions. [2022-01-10 14:11:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:57,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:57,659 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] [2022-01-10 14:11:57,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 14:11:57,659 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1770061323, now seen corresponding path program 1 times [2022-01-10 14:11:57,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:57,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957881803] [2022-01-10 14:11:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:57,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:57,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:57,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957881803] [2022-01-10 14:11:57,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957881803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:57,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:57,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:57,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685802794] [2022-01-10 14:11:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:57,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:57,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:57,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:57,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:57,687 INFO L87 Difference]: Start difference. First operand 2635 states and 3426 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:57,899 INFO L93 Difference]: Finished difference Result 3324 states and 4347 transitions. [2022-01-10 14:11:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:11:57,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:57,903 INFO L225 Difference]: With dead ends: 3324 [2022-01-10 14:11:57,903 INFO L226 Difference]: Without dead ends: 2955 [2022-01-10 14:11:57,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:11:57,904 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 652 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:57,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [652 Valid, 1564 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-01-10 14:11:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2641. [2022-01-10 14:11:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2638 states have (on average 1.2979529946929491) internal successors, (3424), 2640 states have internal predecessors, (3424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3424 transitions. [2022-01-10 14:11:58,088 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3424 transitions. Word has length 55 [2022-01-10 14:11:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:58,088 INFO L470 AbstractCegarLoop]: Abstraction has 2641 states and 3424 transitions. [2022-01-10 14:11:58,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3424 transitions. [2022-01-10 14:11:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:11:58,089 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:58,089 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] [2022-01-10 14:11:58,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 14:11:58,090 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -525296842, now seen corresponding path program 1 times [2022-01-10 14:11:58,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:58,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644650395] [2022-01-10 14:11:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:58,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:58,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:58,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644650395] [2022-01-10 14:11:58,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644650395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:58,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:58,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:58,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129131904] [2022-01-10 14:11:58,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:58,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:58,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:58,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:58,114 INFO L87 Difference]: Start difference. First operand 2641 states and 3424 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:58,333 INFO L93 Difference]: Finished difference Result 3366 states and 4350 transitions. [2022-01-10 14:11:58,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:58,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2022-01-10 14:11:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:58,337 INFO L225 Difference]: With dead ends: 3366 [2022-01-10 14:11:58,338 INFO L226 Difference]: Without dead ends: 2972 [2022-01-10 14:11:58,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:58,339 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 344 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:58,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 651 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2022-01-10 14:11:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2932. [2022-01-10 14:11:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2929 states have (on average 1.292591328098327) internal successors, (3786), 2931 states have internal predecessors, (3786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 3786 transitions. [2022-01-10 14:11:58,592 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 3786 transitions. Word has length 55 [2022-01-10 14:11:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:58,592 INFO L470 AbstractCegarLoop]: Abstraction has 2932 states and 3786 transitions. [2022-01-10 14:11:58,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3786 transitions. [2022-01-10 14:11:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 14:11:58,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:58,593 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:58,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 14:11:58,593 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:58,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1360126715, now seen corresponding path program 2 times [2022-01-10 14:11:58,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:58,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8623370] [2022-01-10 14:11:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:58,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:58,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:58,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8623370] [2022-01-10 14:11:58,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8623370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:58,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:58,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:58,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044528916] [2022-01-10 14:11:58,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:58,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:58,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:58,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:58,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:58,614 INFO L87 Difference]: Start difference. First operand 2932 states and 3786 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:58,757 INFO L93 Difference]: Finished difference Result 4026 states and 5231 transitions. [2022-01-10 14:11:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:58,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-01-10 14:11:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:58,760 INFO L225 Difference]: With dead ends: 4026 [2022-01-10 14:11:58,760 INFO L226 Difference]: Without dead ends: 2286 [2022-01-10 14:11:58,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:58,762 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 377 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:58,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 610 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-01-10 14:11:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2270. [2022-01-10 14:11:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2267 states have (on average 1.2712836347595942) internal successors, (2882), 2269 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 2882 transitions. [2022-01-10 14:11:58,930 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 2882 transitions. Word has length 56 [2022-01-10 14:11:58,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:58,930 INFO L470 AbstractCegarLoop]: Abstraction has 2270 states and 2882 transitions. [2022-01-10 14:11:58,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2882 transitions. [2022-01-10 14:11:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 14:11:58,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:58,931 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:58,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 14:11:58,932 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -273277246, now seen corresponding path program 1 times [2022-01-10 14:11:58,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:58,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744841017] [2022-01-10 14:11:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:58,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:58,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:58,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744841017] [2022-01-10 14:11:58,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744841017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:58,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:58,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:58,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725673825] [2022-01-10 14:11:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:58,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:58,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:58,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:58,956 INFO L87 Difference]: Start difference. First operand 2270 states and 2882 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:59,142 INFO L93 Difference]: Finished difference Result 4757 states and 6030 transitions. [2022-01-10 14:11:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:59,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2022-01-10 14:11:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:59,146 INFO L225 Difference]: With dead ends: 4757 [2022-01-10 14:11:59,146 INFO L226 Difference]: Without dead ends: 2655 [2022-01-10 14:11:59,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:59,149 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 89 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:59,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 930 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2022-01-10 14:11:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2655. [2022-01-10 14:11:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2652 states have (on average 1.2598039215686274) internal successors, (3341), 2654 states have internal predecessors, (3341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3341 transitions. [2022-01-10 14:11:59,320 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3341 transitions. Word has length 60 [2022-01-10 14:11:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:59,320 INFO L470 AbstractCegarLoop]: Abstraction has 2655 states and 3341 transitions. [2022-01-10 14:11:59,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3341 transitions. [2022-01-10 14:11:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 14:11:59,322 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:59,323 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:59,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 14:11:59,323 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:59,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash 647670013, now seen corresponding path program 1 times [2022-01-10 14:11:59,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:59,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305247723] [2022-01-10 14:11:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:59,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:11:59,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:59,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305247723] [2022-01-10 14:11:59,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305247723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:59,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:59,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:59,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489276870] [2022-01-10 14:11:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:59,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:59,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:59,350 INFO L87 Difference]: Start difference. First operand 2655 states and 3341 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:59,508 INFO L93 Difference]: Finished difference Result 4518 states and 5693 transitions. [2022-01-10 14:11:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:59,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 68 [2022-01-10 14:11:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:59,512 INFO L225 Difference]: With dead ends: 4518 [2022-01-10 14:11:59,512 INFO L226 Difference]: Without dead ends: 2655 [2022-01-10 14:11:59,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:59,515 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 369 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:59,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 510 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2022-01-10 14:11:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2655. [2022-01-10 14:11:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2652 states have (on average 1.2447209653092006) internal successors, (3301), 2654 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3301 transitions. [2022-01-10 14:11:59,694 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3301 transitions. Word has length 68 [2022-01-10 14:11:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:59,694 INFO L470 AbstractCegarLoop]: Abstraction has 2655 states and 3301 transitions. [2022-01-10 14:11:59,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3301 transitions. [2022-01-10 14:11:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 14:11:59,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:59,697 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:59,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 14:11:59,697 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 192964196, now seen corresponding path program 1 times [2022-01-10 14:11:59,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:59,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396792372] [2022-01-10 14:11:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:59,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:11:59,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:59,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396792372] [2022-01-10 14:11:59,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396792372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:59,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:59,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:59,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969998970] [2022-01-10 14:11:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:59,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:59,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:59,724 INFO L87 Difference]: Start difference. First operand 2655 states and 3301 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:59,872 INFO L93 Difference]: Finished difference Result 3954 states and 4935 transitions. [2022-01-10 14:11:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:59,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 69 [2022-01-10 14:11:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:59,875 INFO L225 Difference]: With dead ends: 3954 [2022-01-10 14:11:59,875 INFO L226 Difference]: Without dead ends: 2329 [2022-01-10 14:11:59,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:59,878 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 99 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:59,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 917 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2022-01-10 14:12:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2327. [2022-01-10 14:12:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2324 states have (on average 1.2336488812392428) internal successors, (2867), 2326 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2867 transitions. [2022-01-10 14:12:00,008 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2867 transitions. Word has length 69 [2022-01-10 14:12:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:00,008 INFO L470 AbstractCegarLoop]: Abstraction has 2327 states and 2867 transitions. [2022-01-10 14:12:00,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2867 transitions. [2022-01-10 14:12:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 14:12:00,019 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:00,019 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:00,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 14:12:00,020 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1572387046, now seen corresponding path program 1 times [2022-01-10 14:12:00,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:00,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799119695] [2022-01-10 14:12:00,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:00,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:12:00,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:00,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799119695] [2022-01-10 14:12:00,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799119695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:00,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:00,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:00,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054945858] [2022-01-10 14:12:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:00,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:00,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:00,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:00,058 INFO L87 Difference]: Start difference. First operand 2327 states and 2867 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:00,317 INFO L93 Difference]: Finished difference Result 3610 states and 4502 transitions. [2022-01-10 14:12:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-10 14:12:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:00,321 INFO L225 Difference]: With dead ends: 3610 [2022-01-10 14:12:00,321 INFO L226 Difference]: Without dead ends: 2931 [2022-01-10 14:12:00,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:00,323 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 360 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:00,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 647 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2022-01-10 14:12:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2855. [2022-01-10 14:12:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2855 states, 2852 states have (on average 1.2394810659186535) internal successors, (3535), 2854 states have internal predecessors, (3535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3535 transitions. [2022-01-10 14:12:00,559 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3535 transitions. Word has length 88 [2022-01-10 14:12:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:00,559 INFO L470 AbstractCegarLoop]: Abstraction has 2855 states and 3535 transitions. [2022-01-10 14:12:00,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3535 transitions. [2022-01-10 14:12:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 14:12:00,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:00,561 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:00,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 14:12:00,562 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:00,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:00,562 INFO L85 PathProgramCache]: Analyzing trace with hash 96104443, now seen corresponding path program 1 times [2022-01-10 14:12:00,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:00,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793185588] [2022-01-10 14:12:00,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:00,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:12:00,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:00,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793185588] [2022-01-10 14:12:00,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793185588] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:00,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:00,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:00,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991393962] [2022-01-10 14:12:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:00,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:00,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:00,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:00,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:00,587 INFO L87 Difference]: Start difference. First operand 2855 states and 3535 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:00,873 INFO L93 Difference]: Finished difference Result 5160 states and 6429 transitions. [2022-01-10 14:12:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-10 14:12:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:00,879 INFO L225 Difference]: With dead ends: 5160 [2022-01-10 14:12:00,879 INFO L226 Difference]: Without dead ends: 3972 [2022-01-10 14:12:00,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:00,881 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 372 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:00,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 745 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2022-01-10 14:12:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3912. [2022-01-10 14:12:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3909 states have (on average 1.2327961115374777) internal successors, (4819), 3911 states have internal predecessors, (4819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 4819 transitions. [2022-01-10 14:12:01,169 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 4819 transitions. Word has length 88 [2022-01-10 14:12:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:01,169 INFO L470 AbstractCegarLoop]: Abstraction has 3912 states and 4819 transitions. [2022-01-10 14:12:01,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 4819 transitions. [2022-01-10 14:12:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 14:12:01,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:01,172 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:01,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 14:12:01,172 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash -995370856, now seen corresponding path program 1 times [2022-01-10 14:12:01,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:01,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108064417] [2022-01-10 14:12:01,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:01,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:12:01,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108064417] [2022-01-10 14:12:01,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108064417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:01,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:01,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:01,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782707202] [2022-01-10 14:12:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:01,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:01,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:01,191 INFO L87 Difference]: Start difference. First operand 3912 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:01,397 INFO L93 Difference]: Finished difference Result 6137 states and 7589 transitions. [2022-01-10 14:12:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:01,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 88 [2022-01-10 14:12:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:01,403 INFO L225 Difference]: With dead ends: 6137 [2022-01-10 14:12:01,403 INFO L226 Difference]: Without dead ends: 3877 [2022-01-10 14:12:01,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:01,406 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 287 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:01,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 551 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2022-01-10 14:12:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3877. [2022-01-10 14:12:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 3874 states have (on average 1.233866804336603) internal successors, (4780), 3876 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 4780 transitions. [2022-01-10 14:12:01,624 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 4780 transitions. Word has length 88 [2022-01-10 14:12:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:01,624 INFO L470 AbstractCegarLoop]: Abstraction has 3877 states and 4780 transitions. [2022-01-10 14:12:01,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 4780 transitions. [2022-01-10 14:12:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-10 14:12:01,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:01,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:01,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 14:12:01,626 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:01,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:01,627 INFO L85 PathProgramCache]: Analyzing trace with hash 577943828, now seen corresponding path program 1 times [2022-01-10 14:12:01,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:01,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195480243] [2022-01-10 14:12:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:01,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:12:01,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:01,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195480243] [2022-01-10 14:12:01,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195480243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:01,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:01,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:01,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040379725] [2022-01-10 14:12:01,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:01,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:01,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:01,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:01,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:01,652 INFO L87 Difference]: Start difference. First operand 3877 states and 4780 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:02,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:02,013 INFO L93 Difference]: Finished difference Result 7859 states and 9740 transitions. [2022-01-10 14:12:02,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:02,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2022-01-10 14:12:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:02,019 INFO L225 Difference]: With dead ends: 7859 [2022-01-10 14:12:02,020 INFO L226 Difference]: Without dead ends: 5649 [2022-01-10 14:12:02,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:02,022 INFO L933 BasicCegarLoop]: 483 mSDtfsCounter, 306 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:02,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 754 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2022-01-10 14:12:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 5645. [2022-01-10 14:12:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5645 states, 5642 states have (on average 1.2307692307692308) internal successors, (6944), 5644 states have internal predecessors, (6944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5645 states to 5645 states and 6944 transitions. [2022-01-10 14:12:02,329 INFO L78 Accepts]: Start accepts. Automaton has 5645 states and 6944 transitions. Word has length 89 [2022-01-10 14:12:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:02,329 INFO L470 AbstractCegarLoop]: Abstraction has 5645 states and 6944 transitions. [2022-01-10 14:12:02,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 5645 states and 6944 transitions. [2022-01-10 14:12:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-10 14:12:02,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:02,332 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:02,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 14:12:02,332 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1361322803, now seen corresponding path program 1 times [2022-01-10 14:12:02,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:02,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341579526] [2022-01-10 14:12:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:02,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:12:02,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:02,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341579526] [2022-01-10 14:12:02,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341579526] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:02,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:02,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:02,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307619549] [2022-01-10 14:12:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:02,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:02,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:02,350 INFO L87 Difference]: Start difference. First operand 5645 states and 6944 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:02,691 INFO L93 Difference]: Finished difference Result 9589 states and 11826 transitions. [2022-01-10 14:12:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:02,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 89 [2022-01-10 14:12:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:02,697 INFO L225 Difference]: With dead ends: 9589 [2022-01-10 14:12:02,697 INFO L226 Difference]: Without dead ends: 5611 [2022-01-10 14:12:02,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:02,701 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 285 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:02,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 550 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5611 states. [2022-01-10 14:12:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5611 to 5611. [2022-01-10 14:12:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5611 states, 5608 states have (on average 1.2316333808844508) internal successors, (6907), 5610 states have internal predecessors, (6907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5611 states to 5611 states and 6907 transitions. [2022-01-10 14:12:03,011 INFO L78 Accepts]: Start accepts. Automaton has 5611 states and 6907 transitions. Word has length 89 [2022-01-10 14:12:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:03,011 INFO L470 AbstractCegarLoop]: Abstraction has 5611 states and 6907 transitions. [2022-01-10 14:12:03,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5611 states and 6907 transitions. [2022-01-10 14:12:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-10 14:12:03,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:03,013 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:03,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 14:12:03,013 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash -182183032, now seen corresponding path program 1 times [2022-01-10 14:12:03,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:03,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062353357] [2022-01-10 14:12:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:03,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:12:03,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:03,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062353357] [2022-01-10 14:12:03,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062353357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:03,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:03,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:03,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889768619] [2022-01-10 14:12:03,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:03,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:03,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:03,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:03,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:03,036 INFO L87 Difference]: Start difference. First operand 5611 states and 6907 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:03,628 INFO L93 Difference]: Finished difference Result 12915 states and 15867 transitions. [2022-01-10 14:12:03,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:03,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90 [2022-01-10 14:12:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:03,635 INFO L225 Difference]: With dead ends: 12915 [2022-01-10 14:12:03,636 INFO L226 Difference]: Without dead ends: 7303 [2022-01-10 14:12:03,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:03,642 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 224 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:03,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 1044 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2022-01-10 14:12:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7303. [2022-01-10 14:12:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7303 states, 7300 states have (on average 1.2216438356164383) internal successors, (8918), 7302 states have internal predecessors, (8918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 8918 transitions. [2022-01-10 14:12:04,195 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 8918 transitions. Word has length 90 [2022-01-10 14:12:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:04,195 INFO L470 AbstractCegarLoop]: Abstraction has 7303 states and 8918 transitions. [2022-01-10 14:12:04,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 8918 transitions. [2022-01-10 14:12:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-10 14:12:04,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:04,198 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:04,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 14:12:04,198 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash -634794227, now seen corresponding path program 1 times [2022-01-10 14:12:04,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:04,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738668924] [2022-01-10 14:12:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:04,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 14:12:04,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:04,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738668924] [2022-01-10 14:12:04,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738668924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:04,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:04,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:12:04,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429985312] [2022-01-10 14:12:04,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:04,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:04,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:04,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:04,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:04,216 INFO L87 Difference]: Start difference. First operand 7303 states and 8918 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:04,651 INFO L93 Difference]: Finished difference Result 8947 states and 11022 transitions. [2022-01-10 14:12:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 100 [2022-01-10 14:12:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:04,659 INFO L225 Difference]: With dead ends: 8947 [2022-01-10 14:12:04,659 INFO L226 Difference]: Without dead ends: 7579 [2022-01-10 14:12:04,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:04,661 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 395 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:04,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 503 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2022-01-10 14:12:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 7540. [2022-01-10 14:12:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7540 states, 7537 states have (on average 1.2280748308345495) internal successors, (9256), 7539 states have internal predecessors, (9256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7540 states to 7540 states and 9256 transitions. [2022-01-10 14:12:05,068 INFO L78 Accepts]: Start accepts. Automaton has 7540 states and 9256 transitions. Word has length 100 [2022-01-10 14:12:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:05,069 INFO L470 AbstractCegarLoop]: Abstraction has 7540 states and 9256 transitions. [2022-01-10 14:12:05,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7540 states and 9256 transitions. [2022-01-10 14:12:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 14:12:05,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:05,072 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:05,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 14:12:05,072 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash 937943008, now seen corresponding path program 1 times [2022-01-10 14:12:05,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054239879] [2022-01-10 14:12:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:05,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 14:12:05,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:05,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054239879] [2022-01-10 14:12:05,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054239879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:05,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:05,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:05,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538095091] [2022-01-10 14:12:05,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:05,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:05,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:05,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:05,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:05,096 INFO L87 Difference]: Start difference. First operand 7540 states and 9256 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:05,504 INFO L93 Difference]: Finished difference Result 9149 states and 11301 transitions. [2022-01-10 14:12:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 110 [2022-01-10 14:12:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:05,514 INFO L225 Difference]: With dead ends: 9149 [2022-01-10 14:12:05,514 INFO L226 Difference]: Without dead ends: 7548 [2022-01-10 14:12:05,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:05,518 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 69 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:05,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 696 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2022-01-10 14:12:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 7548. [2022-01-10 14:12:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7548 states, 7545 states have (on average 1.224387011265739) internal successors, (9238), 7547 states have internal predecessors, (9238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7548 states to 7548 states and 9238 transitions. [2022-01-10 14:12:05,985 INFO L78 Accepts]: Start accepts. Automaton has 7548 states and 9238 transitions. Word has length 110 [2022-01-10 14:12:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:05,985 INFO L470 AbstractCegarLoop]: Abstraction has 7548 states and 9238 transitions. [2022-01-10 14:12:05,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 7548 states and 9238 transitions. [2022-01-10 14:12:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 14:12:05,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:05,989 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:05,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 14:12:05,989 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 697402879, now seen corresponding path program 1 times [2022-01-10 14:12:05,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:05,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741628602] [2022-01-10 14:12:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:05,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 14:12:06,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:06,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741628602] [2022-01-10 14:12:06,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741628602] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:06,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:06,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:06,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910394207] [2022-01-10 14:12:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:06,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:06,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:06,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:06,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:06,026 INFO L87 Difference]: Start difference. First operand 7548 states and 9238 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:06,422 INFO L93 Difference]: Finished difference Result 8311 states and 10196 transitions. [2022-01-10 14:12:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:06,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 110 [2022-01-10 14:12:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:06,428 INFO L225 Difference]: With dead ends: 8311 [2022-01-10 14:12:06,428 INFO L226 Difference]: Without dead ends: 6702 [2022-01-10 14:12:06,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:06,431 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 368 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:06,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 427 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2022-01-10 14:12:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 6702. [2022-01-10 14:12:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6702 states, 6699 states have (on average 1.2173458725182864) internal successors, (8155), 6701 states have internal predecessors, (8155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 8155 transitions. [2022-01-10 14:12:06,872 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 8155 transitions. Word has length 110 [2022-01-10 14:12:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:06,874 INFO L470 AbstractCegarLoop]: Abstraction has 6702 states and 8155 transitions. [2022-01-10 14:12:06,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 8155 transitions. [2022-01-10 14:12:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 14:12:06,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:06,877 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:06,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 14:12:06,877 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:06,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1503561692, now seen corresponding path program 1 times [2022-01-10 14:12:06,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:06,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988926111] [2022-01-10 14:12:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:06,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 14:12:06,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:06,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988926111] [2022-01-10 14:12:06,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988926111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:06,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:06,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:06,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644386411] [2022-01-10 14:12:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:06,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:06,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:06,906 INFO L87 Difference]: Start difference. First operand 6702 states and 8155 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:07,289 INFO L93 Difference]: Finished difference Result 7474 states and 9099 transitions. [2022-01-10 14:12:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 113 [2022-01-10 14:12:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:07,296 INFO L225 Difference]: With dead ends: 7474 [2022-01-10 14:12:07,297 INFO L226 Difference]: Without dead ends: 6711 [2022-01-10 14:12:07,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:07,299 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 60 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:07,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 700 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6711 states. [2022-01-10 14:12:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6711 to 6711. [2022-01-10 14:12:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6711 states, 6708 states have (on average 1.2149672033392964) internal successors, (8150), 6710 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6711 states to 6711 states and 8150 transitions. [2022-01-10 14:12:07,685 INFO L78 Accepts]: Start accepts. Automaton has 6711 states and 8150 transitions. Word has length 113 [2022-01-10 14:12:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:07,686 INFO L470 AbstractCegarLoop]: Abstraction has 6711 states and 8150 transitions. [2022-01-10 14:12:07,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 6711 states and 8150 transitions. [2022-01-10 14:12:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 14:12:07,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:07,689 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:07,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 14:12:07,689 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1952258331, now seen corresponding path program 1 times [2022-01-10 14:12:07,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:07,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825408035] [2022-01-10 14:12:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:07,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 14:12:07,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:07,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825408035] [2022-01-10 14:12:07,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825408035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:07,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:07,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:07,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52390387] [2022-01-10 14:12:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:07,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:07,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:07,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:07,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:07,718 INFO L87 Difference]: Start difference. First operand 6711 states and 8150 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:08,213 INFO L93 Difference]: Finished difference Result 7106 states and 8613 transitions. [2022-01-10 14:12:08,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:08,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 113 [2022-01-10 14:12:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:08,220 INFO L225 Difference]: With dead ends: 7106 [2022-01-10 14:12:08,220 INFO L226 Difference]: Without dead ends: 5678 [2022-01-10 14:12:08,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:08,222 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 353 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:08,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 420 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2022-01-10 14:12:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5678. [2022-01-10 14:12:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5676 states have (on average 1.2223396758280478) internal successors, (6938), 5677 states have internal predecessors, (6938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 6938 transitions. [2022-01-10 14:12:08,558 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 6938 transitions. Word has length 113 [2022-01-10 14:12:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:08,559 INFO L470 AbstractCegarLoop]: Abstraction has 5678 states and 6938 transitions. [2022-01-10 14:12:08,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 6938 transitions. [2022-01-10 14:12:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 14:12:08,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:08,561 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:08,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 14:12:08,562 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash 147794623, now seen corresponding path program 1 times [2022-01-10 14:12:08,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:08,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997421327] [2022-01-10 14:12:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:08,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:12:08,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997421327] [2022-01-10 14:12:08,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997421327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:08,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:08,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:12:08,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792934977] [2022-01-10 14:12:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:08,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:08,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:08,589 INFO L87 Difference]: Start difference. First operand 5678 states and 6938 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:09,020 INFO L93 Difference]: Finished difference Result 12988 states and 15812 transitions. [2022-01-10 14:12:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:09,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2022-01-10 14:12:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:09,029 INFO L225 Difference]: With dead ends: 12988 [2022-01-10 14:12:09,029 INFO L226 Difference]: Without dead ends: 7339 [2022-01-10 14:12:09,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:09,035 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 144 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:09,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 515 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2022-01-10 14:12:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 7291. [2022-01-10 14:12:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7291 states, 7289 states have (on average 1.2078474413499793) internal successors, (8804), 7290 states have internal predecessors, (8804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7291 states to 7291 states and 8804 transitions. [2022-01-10 14:12:09,515 INFO L78 Accepts]: Start accepts. Automaton has 7291 states and 8804 transitions. Word has length 115 [2022-01-10 14:12:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:09,515 INFO L470 AbstractCegarLoop]: Abstraction has 7291 states and 8804 transitions. [2022-01-10 14:12:09,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 7291 states and 8804 transitions. [2022-01-10 14:12:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-10 14:12:09,519 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:09,519 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:09,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 14:12:09,519 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1882245316, now seen corresponding path program 1 times [2022-01-10 14:12:09,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:09,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670470080] [2022-01-10 14:12:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:09,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 14:12:09,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:09,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670470080] [2022-01-10 14:12:09,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670470080] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:09,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:09,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:09,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411563759] [2022-01-10 14:12:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:09,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:09,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:09,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:09,542 INFO L87 Difference]: Start difference. First operand 7291 states and 8804 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:09,956 INFO L93 Difference]: Finished difference Result 14361 states and 17302 transitions. [2022-01-10 14:12:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-10 14:12:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:09,963 INFO L225 Difference]: With dead ends: 14361 [2022-01-10 14:12:09,963 INFO L226 Difference]: Without dead ends: 7111 [2022-01-10 14:12:09,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:09,970 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 178 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:09,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 530 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7111 states. [2022-01-10 14:12:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7111 to 7111. [2022-01-10 14:12:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7111 states, 7109 states have (on average 1.1787874525249684) internal successors, (8380), 7110 states have internal predecessors, (8380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7111 states to 7111 states and 8380 transitions. [2022-01-10 14:12:10,386 INFO L78 Accepts]: Start accepts. Automaton has 7111 states and 8380 transitions. Word has length 130 [2022-01-10 14:12:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:10,386 INFO L470 AbstractCegarLoop]: Abstraction has 7111 states and 8380 transitions. [2022-01-10 14:12:10,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7111 states and 8380 transitions. [2022-01-10 14:12:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-10 14:12:10,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:10,390 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:10,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 14:12:10,390 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1033113215, now seen corresponding path program 1 times [2022-01-10 14:12:10,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:10,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717289720] [2022-01-10 14:12:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:10,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:12:10,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:10,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717289720] [2022-01-10 14:12:10,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717289720] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:10,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:10,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:10,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259236010] [2022-01-10 14:12:10,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:10,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:10,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:10,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:10,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:10,418 INFO L87 Difference]: Start difference. First operand 7111 states and 8380 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:10,852 INFO L93 Difference]: Finished difference Result 12607 states and 14932 transitions. [2022-01-10 14:12:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:10,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2022-01-10 14:12:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:10,861 INFO L225 Difference]: With dead ends: 12607 [2022-01-10 14:12:10,862 INFO L226 Difference]: Without dead ends: 7115 [2022-01-10 14:12:10,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:10,867 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 194 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:10,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 732 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2022-01-10 14:12:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7111. [2022-01-10 14:12:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7111 states, 7109 states have (on average 1.173723449148966) internal successors, (8344), 7110 states have internal predecessors, (8344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7111 states to 7111 states and 8344 transitions. [2022-01-10 14:12:11,297 INFO L78 Accepts]: Start accepts. Automaton has 7111 states and 8344 transitions. Word has length 131 [2022-01-10 14:12:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:11,297 INFO L470 AbstractCegarLoop]: Abstraction has 7111 states and 8344 transitions. [2022-01-10 14:12:11,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7111 states and 8344 transitions. [2022-01-10 14:12:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 14:12:11,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:11,303 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:11,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 14:12:11,303 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash -724915020, now seen corresponding path program 1 times [2022-01-10 14:12:11,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:11,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259046467] [2022-01-10 14:12:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:11,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 14:12:11,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:11,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259046467] [2022-01-10 14:12:11,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259046467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:11,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:11,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:11,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389220831] [2022-01-10 14:12:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:11,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:11,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:11,332 INFO L87 Difference]: Start difference. First operand 7111 states and 8344 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:11,833 INFO L93 Difference]: Finished difference Result 14185 states and 16648 transitions. [2022-01-10 14:12:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 160 [2022-01-10 14:12:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:11,842 INFO L225 Difference]: With dead ends: 14185 [2022-01-10 14:12:11,842 INFO L226 Difference]: Without dead ends: 7115 [2022-01-10 14:12:11,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:11,847 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 192 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:11,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 717 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2022-01-10 14:12:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7111. [2022-01-10 14:12:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7111 states, 7109 states have (on average 1.1641581094387397) internal successors, (8276), 7110 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7111 states to 7111 states and 8276 transitions. [2022-01-10 14:12:12,277 INFO L78 Accepts]: Start accepts. Automaton has 7111 states and 8276 transitions. Word has length 160 [2022-01-10 14:12:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:12,278 INFO L470 AbstractCegarLoop]: Abstraction has 7111 states and 8276 transitions. [2022-01-10 14:12:12,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 7111 states and 8276 transitions. [2022-01-10 14:12:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 14:12:12,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:12,281 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:12,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 14:12:12,282 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1931575491, now seen corresponding path program 1 times [2022-01-10 14:12:12,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:12,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072217734] [2022-01-10 14:12:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:12,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:12:12,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:12,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072217734] [2022-01-10 14:12:12,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072217734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:12,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:12,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:12,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062476179] [2022-01-10 14:12:12,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:12,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:12,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:12,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:12,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:12,312 INFO L87 Difference]: Start difference. First operand 7111 states and 8276 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:12,756 INFO L93 Difference]: Finished difference Result 12635 states and 14774 transitions. [2022-01-10 14:12:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:12,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 160 [2022-01-10 14:12:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:12,766 INFO L225 Difference]: With dead ends: 12635 [2022-01-10 14:12:12,766 INFO L226 Difference]: Without dead ends: 7143 [2022-01-10 14:12:12,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:12,772 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 215 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:12,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 671 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7143 states. [2022-01-10 14:12:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7143 to 7111. [2022-01-10 14:12:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7111 states, 7109 states have (on average 1.1399634266422844) internal successors, (8104), 7110 states have internal predecessors, (8104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7111 states to 7111 states and 8104 transitions. [2022-01-10 14:12:13,247 INFO L78 Accepts]: Start accepts. Automaton has 7111 states and 8104 transitions. Word has length 160 [2022-01-10 14:12:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:13,247 INFO L470 AbstractCegarLoop]: Abstraction has 7111 states and 8104 transitions. [2022-01-10 14:12:13,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 7111 states and 8104 transitions. [2022-01-10 14:12:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 14:12:13,251 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:13,251 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:13,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 14:12:13,251 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -171296680, now seen corresponding path program 1 times [2022-01-10 14:12:13,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:13,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260921440] [2022-01-10 14:12:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:13,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 14:12:13,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:13,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260921440] [2022-01-10 14:12:13,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260921440] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:13,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:13,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:13,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500686528] [2022-01-10 14:12:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:13,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:13,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:13,284 INFO L87 Difference]: Start difference. First operand 7111 states and 8104 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:13,766 INFO L93 Difference]: Finished difference Result 12039 states and 13776 transitions. [2022-01-10 14:12:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:13,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 162 [2022-01-10 14:12:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:13,775 INFO L225 Difference]: With dead ends: 12039 [2022-01-10 14:12:13,776 INFO L226 Difference]: Without dead ends: 7423 [2022-01-10 14:12:13,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:13,780 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 230 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:13,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 651 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7423 states. [2022-01-10 14:12:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7423 to 7111. [2022-01-10 14:12:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7111 states, 7109 states have (on average 1.1211140807427205) internal successors, (7970), 7110 states have internal predecessors, (7970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7111 states to 7111 states and 7970 transitions. [2022-01-10 14:12:14,225 INFO L78 Accepts]: Start accepts. Automaton has 7111 states and 7970 transitions. Word has length 162 [2022-01-10 14:12:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:14,225 INFO L470 AbstractCegarLoop]: Abstraction has 7111 states and 7970 transitions. [2022-01-10 14:12:14,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 7111 states and 7970 transitions. [2022-01-10 14:12:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 14:12:14,230 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:14,230 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:14,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 14:12:14,231 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1940935817, now seen corresponding path program 1 times [2022-01-10 14:12:14,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:14,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816139560] [2022-01-10 14:12:14,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:14,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:12:14,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:14,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816139560] [2022-01-10 14:12:14,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816139560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:14,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:14,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:14,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086040620] [2022-01-10 14:12:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:14,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:14,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:14,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:14,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:14,263 INFO L87 Difference]: Start difference. First operand 7111 states and 7970 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:14,609 INFO L93 Difference]: Finished difference Result 11671 states and 13112 transitions. [2022-01-10 14:12:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:14,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2022-01-10 14:12:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:14,614 INFO L225 Difference]: With dead ends: 11671 [2022-01-10 14:12:14,614 INFO L226 Difference]: Without dead ends: 4601 [2022-01-10 14:12:14,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:14,620 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 185 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:14,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 601 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2022-01-10 14:12:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4585. [2022-01-10 14:12:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4585 states, 4583 states have (on average 1.1014619245036004) internal successors, (5048), 4584 states have internal predecessors, (5048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 5048 transitions. [2022-01-10 14:12:14,920 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 5048 transitions. Word has length 163 [2022-01-10 14:12:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:14,920 INFO L470 AbstractCegarLoop]: Abstraction has 4585 states and 5048 transitions. [2022-01-10 14:12:14,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 5048 transitions. [2022-01-10 14:12:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 14:12:14,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:14,923 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:14,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 14:12:14,923 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:14,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash 966695014, now seen corresponding path program 1 times [2022-01-10 14:12:14,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:14,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195692259] [2022-01-10 14:12:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:14,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-10 14:12:14,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:14,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195692259] [2022-01-10 14:12:14,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195692259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:14,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:14,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:12:14,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367294121] [2022-01-10 14:12:14,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:14,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:12:14,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:12:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:12:14,965 INFO L87 Difference]: Start difference. First operand 4585 states and 5048 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:15,271 INFO L93 Difference]: Finished difference Result 7386 states and 8097 transitions. [2022-01-10 14:12:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:12:15,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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 165 [2022-01-10 14:12:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:15,273 INFO L225 Difference]: With dead ends: 7386 [2022-01-10 14:12:15,273 INFO L226 Difference]: Without dead ends: 1716 [2022-01-10 14:12:15,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:12:15,277 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 666 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:15,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [666 Valid, 653 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-01-10 14:12:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1578. [2022-01-10 14:12:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1576 states have (on average 1.0685279187817258) internal successors, (1684), 1577 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1684 transitions. [2022-01-10 14:12:15,390 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1684 transitions. Word has length 165 [2022-01-10 14:12:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:15,390 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 1684 transitions. [2022-01-10 14:12:15,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1684 transitions. [2022-01-10 14:12:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 14:12:15,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:15,392 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:15,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 14:12:15,392 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash 364984745, now seen corresponding path program 1 times [2022-01-10 14:12:15,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:15,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904939467] [2022-01-10 14:12:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:15,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 14:12:15,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:15,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904939467] [2022-01-10 14:12:15,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904939467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:15,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:15,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:12:15,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638844522] [2022-01-10 14:12:15,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:15,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:12:15,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:12:15,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:12:15,549 INFO L87 Difference]: Start difference. First operand 1578 states and 1684 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:15,851 INFO L93 Difference]: Finished difference Result 1578 states and 1684 transitions. [2022-01-10 14:12:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 14:12:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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 165 [2022-01-10 14:12:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:15,853 INFO L225 Difference]: With dead ends: 1578 [2022-01-10 14:12:15,853 INFO L226 Difference]: Without dead ends: 1576 [2022-01-10 14:12:15,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:12:15,854 INFO L933 BasicCegarLoop]: 460 mSDtfsCounter, 371 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:15,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 1374 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-01-10 14:12:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2022-01-10 14:12:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.0673015873015872) internal successors, (1681), 1575 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1681 transitions. [2022-01-10 14:12:16,093 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1681 transitions. Word has length 165 [2022-01-10 14:12:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:16,093 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1681 transitions. [2022-01-10 14:12:16,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1681 transitions. [2022-01-10 14:12:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-10 14:12:16,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:16,095 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:16,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 14:12:16,095 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2125839326, now seen corresponding path program 1 times [2022-01-10 14:12:16,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:16,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82433912] [2022-01-10 14:12:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:16,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:12:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-10 14:12:16,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:12:16,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82433912] [2022-01-10 14:12:16,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82433912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:12:16,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:12:16,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:12:16,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297670172] [2022-01-10 14:12:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:12:16,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:12:16,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:12:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:12:16,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:16,171 INFO L87 Difference]: Start difference. First operand 1576 states and 1681 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:12:16,495 INFO L93 Difference]: Finished difference Result 2886 states and 3068 transitions. [2022-01-10 14:12:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:12:16,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 169 [2022-01-10 14:12:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:12:16,498 INFO L225 Difference]: With dead ends: 2886 [2022-01-10 14:12:16,498 INFO L226 Difference]: Without dead ends: 2223 [2022-01-10 14:12:16,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:12:16,505 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 194 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:12:16,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 702 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:12:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2022-01-10 14:12:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1578. [2022-01-10 14:12:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.0672162333544706) internal successors, (1683), 1577 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1683 transitions. [2022-01-10 14:12:16,736 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1683 transitions. Word has length 169 [2022-01-10 14:12:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:12:16,737 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 1683 transitions. [2022-01-10 14:12:16,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:12:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1683 transitions. [2022-01-10 14:12:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-10 14:12:16,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:12:16,739 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:16,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 14:12:16,739 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:12:16,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:12:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1445725444, now seen corresponding path program 1 times [2022-01-10 14:12:16,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:12:16,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615292548] [2022-01-10 14:12:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:12:16,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:12:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 14:12:16,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 14:12:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 14:12:16,843 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 14:12:16,843 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 14:12:16,843 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-10 14:12:16,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-10 14:12:16,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-10 14:12:16,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-10 14:12:16,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-10 14:12:16,848 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:12:16,850 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 14:12:17,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:12:17 BasicIcfg [2022-01-10 14:12:17,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 14:12:17,225 INFO L158 Benchmark]: Toolchain (without parser) took 27110.79ms. Allocated memory was 209.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 157.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 621.6MB. Max. memory is 8.0GB. [2022-01-10 14:12:17,225 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 209.7MB. Free memory was 175.3MB in the beginning and 175.3MB in the end (delta: 72.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 14:12:17,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.76ms. Allocated memory was 209.7MB in the beginning and 289.4MB in the end (delta: 79.7MB). Free memory was 157.5MB in the beginning and 260.0MB in the end (delta: -102.5MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-01-10 14:12:17,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.50ms. Allocated memory is still 289.4MB. Free memory was 260.0MB in the beginning and 255.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 14:12:17,225 INFO L158 Benchmark]: Boogie Preprocessor took 48.54ms. Allocated memory is still 289.4MB. Free memory was 255.8MB in the beginning and 252.7MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 14:12:17,225 INFO L158 Benchmark]: RCFGBuilder took 783.21ms. Allocated memory is still 289.4MB. Free memory was 252.2MB in the beginning and 217.0MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-01-10 14:12:17,225 INFO L158 Benchmark]: IcfgTransformer took 160.32ms. Allocated memory is still 289.4MB. Free memory was 217.0MB in the beginning and 199.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-10 14:12:17,225 INFO L158 Benchmark]: TraceAbstraction took 25746.33ms. Allocated memory was 289.4MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 199.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 582.2MB. Max. memory is 8.0GB. [2022-01-10 14:12:17,229 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 209.7MB. Free memory was 175.3MB in the beginning and 175.3MB in the end (delta: 72.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.76ms. Allocated memory was 209.7MB in the beginning and 289.4MB in the end (delta: 79.7MB). Free memory was 157.5MB in the beginning and 260.0MB in the end (delta: -102.5MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.50ms. Allocated memory is still 289.4MB. Free memory was 260.0MB in the beginning and 255.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.54ms. Allocated memory is still 289.4MB. Free memory was 255.8MB in the beginning and 252.7MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 783.21ms. Allocated memory is still 289.4MB. Free memory was 252.2MB in the beginning and 217.0MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * IcfgTransformer took 160.32ms. Allocated memory is still 289.4MB. Free memory was 217.0MB in the beginning and 199.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 25746.33ms. Allocated memory was 289.4MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 199.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 582.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1099] COND FALSE !(__VERIFIER_nondet_int()) [L1102] CALL main2() [L1086] int __retres1 ; [L1090] CALL init_model2() [L1000] m_i = 1 [L1001] t1_i = 1 [L1002] t2_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1090] RET init_model2() [L1091] CALL start_simulation2() [L1027] int kernel_st ; [L1028] int tmp ; [L1029] int tmp___0 ; [L1033] kernel_st = 0 [L1034] FCALL update_channels2() [L1035] CALL init_threads2() [L719] COND TRUE m_i == 1 [L720] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L724] COND TRUE t1_i == 1 [L725] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L729] COND TRUE t2_i == 1 [L730] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] RET init_threads2() [L1036] CALL fire_delta_events2() [L832] COND FALSE !(M_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L837] COND FALSE !(T1_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] COND FALSE !(T2_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L847] COND FALSE !(E_M == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L852] COND FALSE !(E_1 == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L857] COND FALSE !(E_2 == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1036] RET fire_delta_events2() [L1037] CALL activate_threads2() [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] COND FALSE !(m_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L664] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L673] COND FALSE !(t1_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L683] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L685] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L692] COND FALSE !(t2_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L702] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L704] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1037] RET activate_threads2() [L1038] CALL reset_delta_events2() [L870] COND FALSE !(M_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] COND FALSE !(T1_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L880] COND FALSE !(T2_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L885] COND FALSE !(E_M == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L890] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L895] COND FALSE !(E_2 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] RET reset_delta_events2() [L1041] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1044] kernel_st = 1 [L1045] CALL eval2() [L765] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] CALL, EXPR exists_runnable_thread2() [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L760] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] RET, EXPR exists_runnable_thread2() [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L593] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L595] t1_pc = 1 [L596] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L629] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L631] t2_pc = 1 [L632] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET transmit2() [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] CALL, EXPR exists_runnable_thread2() [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L760] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L772] RET, EXPR exists_runnable_thread2() [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L537] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L540] token = __VERIFIER_nondet_int() [L541] local = token [L542] E_1 = 1 [L543] CALL immediate_notify() [L943] CALL activate_threads2() [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] COND FALSE !(m_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L664] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L673] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L674] COND TRUE E_1 == 1 [L675] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L685] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L692] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L693] COND FALSE !(E_2 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L702] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L943] RET activate_threads2() [L543] RET immediate_notify() [L544] E_1 = 2 [L545] m_pc = 1 [L546] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L785] RET master() [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L585] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L601] token += 1 [L602] E_2 = 1 [L603] CALL immediate_notify() [L943] CALL activate_threads2() [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L654] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L655] COND FALSE !(E_M == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L664] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L666] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L673] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L674] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L683] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L685] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L692] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L693] COND TRUE E_2 == 1 [L694] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L704] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L943] RET activate_threads2() [L603] RET immediate_notify() [L604] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L593] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L595] t1_pc = 1 [L596] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L621] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L637] token += 1 [L638] E_M = 1 [L639] CALL immediate_notify() [L943] CALL activate_threads2() [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L654] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L655] COND TRUE E_M == 1 [L656] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L666] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L673] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L674] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L683] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L685] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L692] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L693] COND FALSE !(E_2 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L702] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L704] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L943] RET activate_threads2() [L639] RET immediate_notify() [L640] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L629] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L631] t2_pc = 1 [L632] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L813] RET transmit2() [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=4, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] CALL, EXPR exists_runnable_thread2() [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L760] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L772] RET, EXPR exists_runnable_thread2() [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=4, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L529] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L551] COND FALSE !(token != local + 2) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L562] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L563] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L564] COND TRUE tmp_var == 5 [L565] CALL error2() [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 343 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 44, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15710 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15710 mSDsluCounter, 34465 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15143 mSDsCounter, 287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 684 IncrementalHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 287 mSolverCounterUnsat, 19322 mSDtfsCounter, 684 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7548occurred in iteration=30, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 4917 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 4007 NumberOfCodeBlocks, 4007 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3845 ConstructedInterpolants, 0 QuantifiedInterpolants, 11118 SizeOfPredicates, 2 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 45 InterpolantComputations, 42 PerfectInterpolantSequences, 598/604 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 14:12:17,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...