/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:16:57,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:16:57,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:16:57,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:16:57,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:16:57,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:16:57,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:16:57,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:16:57,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:16:57,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:16:57,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:16:57,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:16:57,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:16:57,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:16:57,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:16:57,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:16:57,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:16:57,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:16:57,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:16:57,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:16:57,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:16:57,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:16:57,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:16:57,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:16:57,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:16:57,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:16:57,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:16:57,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:16:57,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:16:57,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:16:57,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:16:57,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:16:57,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:16:57,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:16:57,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:16:57,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:16:57,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:16:57,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:16:57,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:16:57,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:16:57,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:16:57,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:16:57,497 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:16:57,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:16:57,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:16:57,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:16:57,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:16:57,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:16:57,499 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:16:57,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:16:57,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:16:57,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:16:57,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:16:57,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:16:57,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:16:57,503 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:16:57,504 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:16:57,504 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:16:57,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:16:57,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:16:57,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:16:57,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:16:57,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:16:57,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:16:57,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:16:57,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:16:57,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:16:57,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:16:57,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:16:57,506 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:16:57,506 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:16:57,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:16:57,507 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:16:57,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:16:57,508 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:16:57,508 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 00:16:57,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:16:57,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:16:57,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:16:57,740 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:16:57,741 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:16:57,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2022-01-11 00:16:57,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596a3e924/1c606b11840a43d7abdb53a14f61accb/FLAGe8116d2f4 [2022-01-11 00:16:58,104 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:16:58,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2022-01-11 00:16:58,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596a3e924/1c606b11840a43d7abdb53a14f61accb/FLAGe8116d2f4 [2022-01-11 00:16:58,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596a3e924/1c606b11840a43d7abdb53a14f61accb [2022-01-11 00:16:58,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:16:58,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:16:58,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:16:58,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:16:58,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:16:58,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66daf9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58, skipping insertion in model container [2022-01-11 00:16:58,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:16:58,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:16:58,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c[671,684] [2022-01-11 00:16:58,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:16:58,779 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:16:58,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c[671,684] [2022-01-11 00:16:58,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:16:58,830 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:16:58,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58 WrapperNode [2022-01-11 00:16:58,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:16:58,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:16:58,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:16:58,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:16:58,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,885 INFO L137 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 33, calls inlined = 50, statements flattened = 606 [2022-01-11 00:16:58,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:16:58,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:16:58,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:16:58,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:16:58,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:16:58,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:16:58,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:16:58,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:16:58,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (1/1) ... [2022-01-11 00:16:58,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:16:58,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:16:58,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 00:16:58,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 00:16:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:16:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:16:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:16:58,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:16:59,052 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:16:59,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:16:59,546 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:16:59,555 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:16:59,555 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-11 00:16:59,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:59 BoogieIcfgContainer [2022-01-11 00:16:59,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:16:59,558 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:16:59,558 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:16:59,559 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:16:59,561 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:59" (1/1) ... [2022-01-11 00:16:59,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:16:59 BasicIcfg [2022-01-11 00:16:59,697 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:16:59,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:16:59,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:16:59,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:16:59,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:16:58" (1/4) ... [2022-01-11 00:16:59,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642837bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:16:59, skipping insertion in model container [2022-01-11 00:16:59,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:58" (2/4) ... [2022-01-11 00:16:59,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642837bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:16:59, skipping insertion in model container [2022-01-11 00:16:59,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:59" (3/4) ... [2022-01-11 00:16:59,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642837bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:16:59, skipping insertion in model container [2022-01-11 00:16:59,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:16:59" (4/4) ... [2022-01-11 00:16:59,703 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.cTransformedIcfg [2022-01-11 00:16:59,707 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:16:59,707 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-11 00:16:59,746 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:16:59,751 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 00:16:59,751 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-11 00:16:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 239 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:16:59,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:59,782 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] [2022-01-11 00:16:59,782 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1802186733, now seen corresponding path program 1 times [2022-01-11 00:16:59,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:59,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956750650] [2022-01-11 00:16:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:59,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:00,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:00,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956750650] [2022-01-11 00:17:00,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956750650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:00,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:00,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:17:00,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153914518] [2022-01-11 00:17:00,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:00,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:00,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:00,064 INFO L87 Difference]: Start difference. First operand has 240 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 239 states have internal predecessors, (367), 0 states have call successors, (0), 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 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:00,169 INFO L93 Difference]: Finished difference Result 641 states and 984 transitions. [2022-01-11 00:17:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:00,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:17:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:00,185 INFO L225 Difference]: With dead ends: 641 [2022-01-11 00:17:00,185 INFO L226 Difference]: Without dead ends: 402 [2022-01-11 00:17:00,189 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-11 00:17:00,192 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 307 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 626 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-11 00:17:00,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 626 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-01-11 00:17:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2022-01-11 00:17:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 396 states have (on average 1.494949494949495) internal successors, (592), 397 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 592 transitions. [2022-01-11 00:17:00,272 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 592 transitions. Word has length 54 [2022-01-11 00:17:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:00,273 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 592 transitions. [2022-01-11 00:17:00,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 592 transitions. [2022-01-11 00:17:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:17:00,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:00,275 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] [2022-01-11 00:17:00,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:17:00,275 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash 830190349, now seen corresponding path program 1 times [2022-01-11 00:17:00,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:00,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626168051] [2022-01-11 00:17:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:00,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:00,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:00,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626168051] [2022-01-11 00:17:00,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626168051] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:00,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:00,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:17:00,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986779334] [2022-01-11 00:17:00,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:00,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:00,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:00,334 INFO L87 Difference]: Start difference. First operand 398 states and 592 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:00,369 INFO L93 Difference]: Finished difference Result 785 states and 1168 transitions. [2022-01-11 00:17:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:17:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:00,372 INFO L225 Difference]: With dead ends: 785 [2022-01-11 00:17:00,372 INFO L226 Difference]: Without dead ends: 398 [2022-01-11 00:17:00,374 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-11 00:17:00,375 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 337 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-11 00:17:00,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 337 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-01-11 00:17:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2022-01-11 00:17:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 396 states have (on average 1.4747474747474747) internal successors, (584), 397 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 584 transitions. [2022-01-11 00:17:00,405 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 584 transitions. Word has length 54 [2022-01-11 00:17:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:00,405 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 584 transitions. [2022-01-11 00:17:00,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 584 transitions. [2022-01-11 00:17:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:17:00,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:00,407 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] [2022-01-11 00:17:00,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:17:00,408 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1038975443, now seen corresponding path program 1 times [2022-01-11 00:17:00,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:00,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425707833] [2022-01-11 00:17:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:00,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:00,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:00,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425707833] [2022-01-11 00:17:00,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425707833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:00,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:00,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:17:00,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942938609] [2022-01-11 00:17:00,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:00,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:00,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:00,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:00,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:00,496 INFO L87 Difference]: Start difference. First operand 398 states and 584 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:00,545 INFO L93 Difference]: Finished difference Result 784 states and 1151 transitions. [2022-01-11 00:17:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:00,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:17:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:00,547 INFO L225 Difference]: With dead ends: 784 [2022-01-11 00:17:00,547 INFO L226 Difference]: Without dead ends: 398 [2022-01-11 00:17:00,548 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-11 00:17:00,549 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 289 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 350 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-11 00:17:00,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 350 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-01-11 00:17:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2022-01-11 00:17:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 396 states have (on average 1.4343434343434343) internal successors, (568), 397 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 568 transitions. [2022-01-11 00:17:00,584 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 568 transitions. Word has length 54 [2022-01-11 00:17:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:00,584 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 568 transitions. [2022-01-11 00:17:00,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 568 transitions. [2022-01-11 00:17:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:17:00,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:00,588 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] [2022-01-11 00:17:00,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:17:00,588 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -141820020, now seen corresponding path program 1 times [2022-01-11 00:17:00,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:00,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380668312] [2022-01-11 00:17:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:00,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:00,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:00,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380668312] [2022-01-11 00:17:00,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380668312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:00,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:00,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:17:00,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852079685] [2022-01-11 00:17:00,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:00,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:00,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:00,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:00,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:00,660 INFO L87 Difference]: Start difference. First operand 398 states and 568 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:00,710 INFO L93 Difference]: Finished difference Result 783 states and 1118 transitions. [2022-01-11 00:17:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:00,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:17:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:00,713 INFO L225 Difference]: With dead ends: 783 [2022-01-11 00:17:00,713 INFO L226 Difference]: Without dead ends: 398 [2022-01-11 00:17:00,714 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-11 00:17:00,716 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 279 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 339 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-11 00:17:00,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 339 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-01-11 00:17:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2022-01-11 00:17:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 396 states have (on average 1.393939393939394) internal successors, (552), 397 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 552 transitions. [2022-01-11 00:17:00,739 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 552 transitions. Word has length 54 [2022-01-11 00:17:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:00,741 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 552 transitions. [2022-01-11 00:17:00,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 552 transitions. [2022-01-11 00:17:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:17:00,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:00,746 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] [2022-01-11 00:17:00,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:17:00,747 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash -573354389, now seen corresponding path program 1 times [2022-01-11 00:17:00,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:00,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652695222] [2022-01-11 00:17:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:00,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:00,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:00,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652695222] [2022-01-11 00:17:00,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652695222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:00,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:00,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:17:00,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188411081] [2022-01-11 00:17:00,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:00,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:00,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:00,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:00,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:00,818 INFO L87 Difference]: Start difference. First operand 398 states and 552 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:00,875 INFO L93 Difference]: Finished difference Result 782 states and 1085 transitions. [2022-01-11 00:17:00,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:00,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:17:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:00,877 INFO L225 Difference]: With dead ends: 782 [2022-01-11 00:17:00,877 INFO L226 Difference]: Without dead ends: 398 [2022-01-11 00:17:00,878 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-11 00:17:00,886 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 269 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 328 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-11 00:17:00,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 328 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-01-11 00:17:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2022-01-11 00:17:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 396 states have (on average 1.3535353535353536) internal successors, (536), 397 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 536 transitions. [2022-01-11 00:17:00,906 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 536 transitions. Word has length 54 [2022-01-11 00:17:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:00,907 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 536 transitions. [2022-01-11 00:17:00,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 536 transitions. [2022-01-11 00:17:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:17:00,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:00,916 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] [2022-01-11 00:17:00,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:17:00,916 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1995895222, now seen corresponding path program 1 times [2022-01-11 00:17:00,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:00,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743691167] [2022-01-11 00:17:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:00,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:01,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:01,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743691167] [2022-01-11 00:17:01,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743691167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:01,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:01,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:17:01,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135621568] [2022-01-11 00:17:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:01,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:17:01,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:17:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:17:01,007 INFO L87 Difference]: Start difference. First operand 398 states and 536 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:01,133 INFO L93 Difference]: Finished difference Result 1058 states and 1444 transitions. [2022-01-11 00:17:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:17:01,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:17:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:01,136 INFO L225 Difference]: With dead ends: 1058 [2022-01-11 00:17:01,136 INFO L226 Difference]: Without dead ends: 688 [2022-01-11 00:17:01,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:17:01,139 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 746 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 994 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-11 00:17:01,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 994 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-01-11 00:17:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 404. [2022-01-11 00:17:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 402 states have (on average 1.328358208955224) internal successors, (534), 403 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 534 transitions. [2022-01-11 00:17:01,168 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 534 transitions. Word has length 54 [2022-01-11 00:17:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:01,169 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 534 transitions. [2022-01-11 00:17:01,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 534 transitions. [2022-01-11 00:17:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:17:01,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:01,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] [2022-01-11 00:17:01,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:17:01,170 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1302793525, now seen corresponding path program 1 times [2022-01-11 00:17:01,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:01,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344461688] [2022-01-11 00:17:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:01,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:01,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:01,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344461688] [2022-01-11 00:17:01,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344461688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:01,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:01,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:17:01,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053071947] [2022-01-11 00:17:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:01,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:01,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:01,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:01,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:01,250 INFO L87 Difference]: Start difference. First operand 404 states and 534 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:01,282 INFO L93 Difference]: Finished difference Result 798 states and 1054 transitions. [2022-01-11 00:17:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:17:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:01,285 INFO L225 Difference]: With dead ends: 798 [2022-01-11 00:17:01,285 INFO L226 Difference]: Without dead ends: 404 [2022-01-11 00:17:01,285 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-11 00:17:01,287 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 268 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 297 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-11 00:17:01,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 297 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-01-11 00:17:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2022-01-11 00:17:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 402 states have (on average 1.308457711442786) internal successors, (526), 403 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-11 00:17:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 526 transitions. [2022-01-11 00:17:01,312 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 526 transitions. Word has length 54 [2022-01-11 00:17:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:01,314 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 526 transitions. [2022-01-11 00:17:01,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 526 transitions. [2022-01-11 00:17:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:17:01,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:01,315 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] [2022-01-11 00:17:01,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:17:01,315 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:01,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1711617750, now seen corresponding path program 1 times [2022-01-11 00:17:01,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:01,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606666373] [2022-01-11 00:17:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:01,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:01,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:01,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606666373] [2022-01-11 00:17:01,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606666373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:01,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:01,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:17:01,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769017816] [2022-01-11 00:17:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:01,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:01,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:01,370 INFO L87 Difference]: Start difference. First operand 404 states and 526 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:01,452 INFO L93 Difference]: Finished difference Result 1123 states and 1463 transitions. [2022-01-11 00:17:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:01,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:17:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:01,456 INFO L225 Difference]: With dead ends: 1123 [2022-01-11 00:17:01,457 INFO L226 Difference]: Without dead ends: 735 [2022-01-11 00:17:01,457 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-11 00:17:01,458 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 220 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 529 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-11 00:17:01,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 529 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-01-11 00:17:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 689. [2022-01-11 00:17:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 687 states have (on average 1.2911208151382825) internal successors, (887), 688 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 887 transitions. [2022-01-11 00:17:01,510 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 887 transitions. Word has length 54 [2022-01-11 00:17:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:01,511 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 887 transitions. [2022-01-11 00:17:01,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 887 transitions. [2022-01-11 00:17:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-11 00:17:01,512 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:01,512 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] [2022-01-11 00:17:01,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:17:01,513 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1149316285, now seen corresponding path program 1 times [2022-01-11 00:17:01,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:01,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133815644] [2022-01-11 00:17:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:01,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:01,563 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-11 00:17:01,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:01,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133815644] [2022-01-11 00:17:01,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133815644] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:01,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:01,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:01,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559429927] [2022-01-11 00:17:01,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:01,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:01,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:01,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:01,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:01,566 INFO L87 Difference]: Start difference. First operand 689 states and 887 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:01,686 INFO L93 Difference]: Finished difference Result 1942 states and 2510 transitions. [2022-01-11 00:17:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-01-11 00:17:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:01,692 INFO L225 Difference]: With dead ends: 1942 [2022-01-11 00:17:01,692 INFO L226 Difference]: Without dead ends: 1275 [2022-01-11 00:17:01,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:01,695 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 233 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 526 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-11 00:17:01,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 526 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-01-11 00:17:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1211. [2022-01-11 00:17:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1209 states have (on average 1.2894954507857734) internal successors, (1559), 1210 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1559 transitions. [2022-01-11 00:17:01,819 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1559 transitions. Word has length 87 [2022-01-11 00:17:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:01,820 INFO L470 AbstractCegarLoop]: Abstraction has 1211 states and 1559 transitions. [2022-01-11 00:17:01,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1559 transitions. [2022-01-11 00:17:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-11 00:17:01,825 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:01,825 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] [2022-01-11 00:17:01,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:17:01,825 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash 452168451, now seen corresponding path program 1 times [2022-01-11 00:17:01,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:01,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190815883] [2022-01-11 00:17:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:01,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:01,893 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-11 00:17:01,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:01,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190815883] [2022-01-11 00:17:01,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190815883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:01,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:01,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:01,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788192978] [2022-01-11 00:17:01,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:01,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:01,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:01,895 INFO L87 Difference]: Start difference. First operand 1211 states and 1559 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:02,052 INFO L93 Difference]: Finished difference Result 3436 states and 4406 transitions. [2022-01-11 00:17:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:02,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-01-11 00:17:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:02,062 INFO L225 Difference]: With dead ends: 3436 [2022-01-11 00:17:02,062 INFO L226 Difference]: Without dead ends: 2266 [2022-01-11 00:17:02,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:02,066 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 180 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 643 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-11 00:17:02,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 643 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-01-11 00:17:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2262. [2022-01-11 00:17:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 2260 states have (on average 1.2654867256637168) internal successors, (2860), 2261 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2860 transitions. [2022-01-11 00:17:02,256 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2860 transitions. Word has length 87 [2022-01-11 00:17:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:02,257 INFO L470 AbstractCegarLoop]: Abstraction has 2262 states and 2860 transitions. [2022-01-11 00:17:02,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2860 transitions. [2022-01-11 00:17:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-11 00:17:02,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:02,259 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] [2022-01-11 00:17:02,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:17:02,259 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1235547426, now seen corresponding path program 1 times [2022-01-11 00:17:02,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:02,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650904044] [2022-01-11 00:17:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:02,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:02,291 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-11 00:17:02,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650904044] [2022-01-11 00:17:02,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650904044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:02,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:02,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:02,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802477866] [2022-01-11 00:17:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:02,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:02,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:02,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:02,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:02,294 INFO L87 Difference]: Start difference. First operand 2262 states and 2860 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:02,445 INFO L93 Difference]: Finished difference Result 4448 states and 5634 transitions. [2022-01-11 00:17:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:02,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-01-11 00:17:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:02,454 INFO L225 Difference]: With dead ends: 4448 [2022-01-11 00:17:02,454 INFO L226 Difference]: Without dead ends: 2227 [2022-01-11 00:17:02,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:02,459 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 292 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 296 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-11 00:17:02,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 296 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2022-01-11 00:17:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2227. [2022-01-11 00:17:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2225 states have (on average 1.2674157303370785) internal successors, (2820), 2226 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 2820 transitions. [2022-01-11 00:17:02,642 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 2820 transitions. Word has length 87 [2022-01-11 00:17:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:02,642 INFO L470 AbstractCegarLoop]: Abstraction has 2227 states and 2820 transitions. [2022-01-11 00:17:02,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2820 transitions. [2022-01-11 00:17:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-11 00:17:02,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:02,644 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-11 00:17:02,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:17:02,645 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1278837985, now seen corresponding path program 1 times [2022-01-11 00:17:02,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:02,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902959777] [2022-01-11 00:17:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:02,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:02,692 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-11 00:17:02,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:02,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902959777] [2022-01-11 00:17:02,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902959777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:02,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:02,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:02,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125833489] [2022-01-11 00:17:02,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:02,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:02,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:02,694 INFO L87 Difference]: Start difference. First operand 2227 states and 2820 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-11 00:17:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:02,972 INFO L93 Difference]: Finished difference Result 6249 states and 7901 transitions. [2022-01-11 00:17:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:02,973 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-11 00:17:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:02,987 INFO L225 Difference]: With dead ends: 6249 [2022-01-11 00:17:02,988 INFO L226 Difference]: Without dead ends: 4063 [2022-01-11 00:17:02,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:02,992 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 245 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 624 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-11 00:17:02,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 624 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2022-01-11 00:17:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 3995. [2022-01-11 00:17:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3993 states have (on average 1.257450538442274) internal successors, (5021), 3994 states have internal predecessors, (5021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 5021 transitions. [2022-01-11 00:17:03,262 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 5021 transitions. Word has length 88 [2022-01-11 00:17:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:03,262 INFO L470 AbstractCegarLoop]: Abstraction has 3995 states and 5021 transitions. [2022-01-11 00:17:03,262 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-11 00:17:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 5021 transitions. [2022-01-11 00:17:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-11 00:17:03,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:03,264 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-11 00:17:03,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:17:03,265 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:03,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash -709472256, now seen corresponding path program 1 times [2022-01-11 00:17:03,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:03,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252397894] [2022-01-11 00:17:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:03,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:03,286 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-11 00:17:03,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:03,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252397894] [2022-01-11 00:17:03,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252397894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:03,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:03,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:03,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118678489] [2022-01-11 00:17:03,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:03,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:03,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:03,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:03,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:03,288 INFO L87 Difference]: Start difference. First operand 3995 states and 5021 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-11 00:17:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:03,510 INFO L93 Difference]: Finished difference Result 7923 states and 9967 transitions. [2022-01-11 00:17:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:03,511 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-11 00:17:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:03,525 INFO L225 Difference]: With dead ends: 7923 [2022-01-11 00:17:03,525 INFO L226 Difference]: Without dead ends: 3961 [2022-01-11 00:17:03,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:03,531 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 290 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 295 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-11 00:17:03,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2022-01-11 00:17:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3961. [2022-01-11 00:17:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3959 states have (on average 1.258651174539025) internal successors, (4983), 3960 states have internal predecessors, (4983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 4983 transitions. [2022-01-11 00:17:03,774 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 4983 transitions. Word has length 88 [2022-01-11 00:17:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:03,774 INFO L470 AbstractCegarLoop]: Abstraction has 3961 states and 4983 transitions. [2022-01-11 00:17:03,775 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-11 00:17:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 4983 transitions. [2022-01-11 00:17:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-11 00:17:03,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:03,777 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-11 00:17:03,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:17:03,777 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:03,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1037499539, now seen corresponding path program 1 times [2022-01-11 00:17:03,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:03,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541602311] [2022-01-11 00:17:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:03,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:03,809 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-11 00:17:03,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:03,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541602311] [2022-01-11 00:17:03,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541602311] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:03,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:03,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:03,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347844125] [2022-01-11 00:17:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:03,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:03,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:03,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:03,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:03,811 INFO L87 Difference]: Start difference. First operand 3961 states and 4983 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-11 00:17:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:04,204 INFO L93 Difference]: Finished difference Result 11193 states and 14008 transitions. [2022-01-11 00:17:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:04,205 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-11 00:17:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:04,229 INFO L225 Difference]: With dead ends: 11193 [2022-01-11 00:17:04,229 INFO L226 Difference]: Without dead ends: 7273 [2022-01-11 00:17:04,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:04,236 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 223 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:17:04,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 795 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2022-01-11 00:17:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 7273. [2022-01-11 00:17:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7273 states, 7271 states have (on average 1.2298170815568699) internal successors, (8942), 7272 states have internal predecessors, (8942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 8942 transitions. [2022-01-11 00:17:04,621 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 8942 transitions. Word has length 89 [2022-01-11 00:17:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:04,622 INFO L470 AbstractCegarLoop]: Abstraction has 7273 states and 8942 transitions. [2022-01-11 00:17:04,622 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-11 00:17:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 8942 transitions. [2022-01-11 00:17:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-11 00:17:04,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:04,627 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] [2022-01-11 00:17:04,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:17:04,627 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -866332630, now seen corresponding path program 1 times [2022-01-11 00:17:04,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192318184] [2022-01-11 00:17:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:04,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:04,666 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-11 00:17:04,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:04,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192318184] [2022-01-11 00:17:04,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192318184] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:04,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:04,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:17:04,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200012131] [2022-01-11 00:17:04,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:04,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:04,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:04,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:04,668 INFO L87 Difference]: Start difference. First operand 7273 states and 8942 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:05,137 INFO L93 Difference]: Finished difference Result 17709 states and 21768 transitions. [2022-01-11 00:17:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:05,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-01-11 00:17:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:05,167 INFO L225 Difference]: With dead ends: 17709 [2022-01-11 00:17:05,167 INFO L226 Difference]: Without dead ends: 10487 [2022-01-11 00:17:05,179 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-11 00:17:05,180 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 170 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 524 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-11 00:17:05,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 524 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10487 states. [2022-01-11 00:17:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10487 to 10419. [2022-01-11 00:17:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10419 states, 10417 states have (on average 1.2208889315541902) internal successors, (12718), 10418 states have internal predecessors, (12718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10419 states to 10419 states and 12718 transitions. [2022-01-11 00:17:05,751 INFO L78 Accepts]: Start accepts. Automaton has 10419 states and 12718 transitions. Word has length 114 [2022-01-11 00:17:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:05,752 INFO L470 AbstractCegarLoop]: Abstraction has 10419 states and 12718 transitions. [2022-01-11 00:17:05,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 10419 states and 12718 transitions. [2022-01-11 00:17:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-11 00:17:05,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:05,762 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] [2022-01-11 00:17:05,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:17:05,762 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1388668522, now seen corresponding path program 1 times [2022-01-11 00:17:05,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210478050] [2022-01-11 00:17:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:05,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:05,807 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-11 00:17:05,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:05,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210478050] [2022-01-11 00:17:05,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210478050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:05,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:05,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:05,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473419816] [2022-01-11 00:17:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:05,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:05,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:05,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:05,810 INFO L87 Difference]: Start difference. First operand 10419 states and 12718 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:06,256 INFO L93 Difference]: Finished difference Result 18625 states and 22792 transitions. [2022-01-11 00:17:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:06,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 129 [2022-01-11 00:17:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:06,276 INFO L225 Difference]: With dead ends: 18625 [2022-01-11 00:17:06,276 INFO L226 Difference]: Without dead ends: 10603 [2022-01-11 00:17:06,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:06,289 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 211 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:17:06,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 568 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10603 states. [2022-01-11 00:17:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10603 to 10203. [2022-01-11 00:17:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10201 states have (on average 1.1973335947456132) internal successors, (12214), 10202 states have internal predecessors, (12214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 12214 transitions. [2022-01-11 00:17:06,864 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 12214 transitions. Word has length 129 [2022-01-11 00:17:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:06,865 INFO L470 AbstractCegarLoop]: Abstraction has 10203 states and 12214 transitions. [2022-01-11 00:17:06,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 12214 transitions. [2022-01-11 00:17:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-11 00:17:06,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:06,874 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] [2022-01-11 00:17:06,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:17:06,874 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:06,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash -40087270, now seen corresponding path program 1 times [2022-01-11 00:17:06,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:06,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779915541] [2022-01-11 00:17:06,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:06,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 00:17:06,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:06,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779915541] [2022-01-11 00:17:06,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779915541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:06,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:06,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:06,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735968498] [2022-01-11 00:17:06,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:06,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:06,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:06,912 INFO L87 Difference]: Start difference. First operand 10203 states and 12214 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:07,223 INFO L93 Difference]: Finished difference Result 18983 states and 22748 transitions. [2022-01-11 00:17:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-11 00:17:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:07,239 INFO L225 Difference]: With dead ends: 18983 [2022-01-11 00:17:07,240 INFO L226 Difference]: Without dead ends: 8855 [2022-01-11 00:17:07,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:07,254 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 203 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 753 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-11 00:17:07,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 753 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8855 states. [2022-01-11 00:17:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8855 to 8851. [2022-01-11 00:17:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 8849 states have (on average 1.185670697253927) internal successors, (10492), 8850 states have internal predecessors, (10492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 10492 transitions. [2022-01-11 00:17:07,700 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 10492 transitions. Word has length 130 [2022-01-11 00:17:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:07,701 INFO L470 AbstractCegarLoop]: Abstraction has 8851 states and 10492 transitions. [2022-01-11 00:17:07,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 10492 transitions. [2022-01-11 00:17:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-11 00:17:07,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:07,708 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] [2022-01-11 00:17:07,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:17:07,708 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1732193671, now seen corresponding path program 1 times [2022-01-11 00:17:07,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:07,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220976130] [2022-01-11 00:17:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:07,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:07,747 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-11 00:17:07,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:07,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220976130] [2022-01-11 00:17:07,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220976130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:07,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:07,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:07,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468873193] [2022-01-11 00:17:07,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:07,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:07,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:07,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:07,750 INFO L87 Difference]: Start difference. First operand 8851 states and 10492 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:08,161 INFO L93 Difference]: Finished difference Result 14967 states and 17804 transitions. [2022-01-11 00:17:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-11 00:17:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:08,177 INFO L225 Difference]: With dead ends: 14967 [2022-01-11 00:17:08,177 INFO L226 Difference]: Without dead ends: 8855 [2022-01-11 00:17:08,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:08,187 INFO L933 BasicCegarLoop]: 491 mSDtfsCounter, 195 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:17:08,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 766 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8855 states. [2022-01-11 00:17:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8855 to 8851. [2022-01-11 00:17:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 8849 states have (on average 1.1797943270426037) internal successors, (10440), 8850 states have internal predecessors, (10440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 10440 transitions. [2022-01-11 00:17:08,660 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 10440 transitions. Word has length 130 [2022-01-11 00:17:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:08,660 INFO L470 AbstractCegarLoop]: Abstraction has 8851 states and 10440 transitions. [2022-01-11 00:17:08,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 10440 transitions. [2022-01-11 00:17:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-11 00:17:08,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:08,667 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 00:17:08,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:17:08,667 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash -590102444, now seen corresponding path program 1 times [2022-01-11 00:17:08,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:08,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894355481] [2022-01-11 00:17:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:08,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:08,707 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-11 00:17:08,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:08,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894355481] [2022-01-11 00:17:08,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894355481] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:08,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:08,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:08,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509402251] [2022-01-11 00:17:08,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:08,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:08,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:08,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:08,709 INFO L87 Difference]: Start difference. First operand 8851 states and 10440 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:09,269 INFO L93 Difference]: Finished difference Result 14789 states and 17584 transitions. [2022-01-11 00:17:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:09,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-11 00:17:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:09,288 INFO L225 Difference]: With dead ends: 14789 [2022-01-11 00:17:09,288 INFO L226 Difference]: Without dead ends: 9245 [2022-01-11 00:17:09,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:09,301 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 237 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 675 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-11 00:17:09,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 675 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9245 states. [2022-01-11 00:17:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9245 to 8833. [2022-01-11 00:17:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8833 states, 8831 states have (on average 1.1606839542520666) internal successors, (10250), 8832 states have internal predecessors, (10250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8833 states to 8833 states and 10250 transitions. [2022-01-11 00:17:09,688 INFO L78 Accepts]: Start accepts. Automaton has 8833 states and 10250 transitions. Word has length 130 [2022-01-11 00:17:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:09,688 INFO L470 AbstractCegarLoop]: Abstraction has 8833 states and 10250 transitions. [2022-01-11 00:17:09,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 8833 states and 10250 transitions. [2022-01-11 00:17:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-11 00:17:09,694 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:09,694 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 00:17:09,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:17:09,695 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:09,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1744024069, now seen corresponding path program 1 times [2022-01-11 00:17:09,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:09,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317273697] [2022-01-11 00:17:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:09,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:09,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:09,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317273697] [2022-01-11 00:17:09,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317273697] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:09,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:09,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:09,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197958474] [2022-01-11 00:17:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:09,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:09,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:09,731 INFO L87 Difference]: Start difference. First operand 8833 states and 10250 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:10,150 INFO L93 Difference]: Finished difference Result 14993 states and 17434 transitions. [2022-01-11 00:17:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-11 00:17:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:10,169 INFO L225 Difference]: With dead ends: 14993 [2022-01-11 00:17:10,169 INFO L226 Difference]: Without dead ends: 8893 [2022-01-11 00:17:10,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:10,181 INFO L933 BasicCegarLoop]: 481 mSDtfsCounter, 217 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 719 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-11 00:17:10,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 719 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8893 states. [2022-01-11 00:17:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8893 to 8833. [2022-01-11 00:17:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8833 states, 8831 states have (on average 1.1389423621333938) internal successors, (10058), 8832 states have internal predecessors, (10058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8833 states to 8833 states and 10058 transitions. [2022-01-11 00:17:10,661 INFO L78 Accepts]: Start accepts. Automaton has 8833 states and 10058 transitions. Word has length 130 [2022-01-11 00:17:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:10,662 INFO L470 AbstractCegarLoop]: Abstraction has 8833 states and 10058 transitions. [2022-01-11 00:17:10,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8833 states and 10058 transitions. [2022-01-11 00:17:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-11 00:17:10,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:10,666 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-11 00:17:10,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:17:10,666 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -349355114, now seen corresponding path program 1 times [2022-01-11 00:17:10,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:10,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692466846] [2022-01-11 00:17:10,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:10,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:17:10,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:10,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692466846] [2022-01-11 00:17:10,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692466846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:10,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:10,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:10,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983724886] [2022-01-11 00:17:10,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:10,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:10,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:10,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:10,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:10,708 INFO L87 Difference]: Start difference. First operand 8833 states and 10058 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-11 00:17:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:10,988 INFO L93 Difference]: Finished difference Result 13075 states and 14972 transitions. [2022-01-11 00:17:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:10,989 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-11 00:17:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:10,996 INFO L225 Difference]: With dead ends: 13075 [2022-01-11 00:17:10,996 INFO L226 Difference]: Without dead ends: 6533 [2022-01-11 00:17:11,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:11,003 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 193 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:17:11,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 685 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6533 states. [2022-01-11 00:17:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6533 to 6505. [2022-01-11 00:17:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6505 states, 6503 states have (on average 1.1287098262340458) internal successors, (7340), 6504 states have internal predecessors, (7340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6505 states to 6505 states and 7340 transitions. [2022-01-11 00:17:11,331 INFO L78 Accepts]: Start accepts. Automaton has 6505 states and 7340 transitions. Word has length 131 [2022-01-11 00:17:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:11,332 INFO L470 AbstractCegarLoop]: Abstraction has 6505 states and 7340 transitions. [2022-01-11 00:17:11,332 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-11 00:17:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6505 states and 7340 transitions. [2022-01-11 00:17:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 00:17:11,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:11,336 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 00:17:11,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 00:17:11,336 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1461473907, now seen corresponding path program 1 times [2022-01-11 00:17:11,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:11,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925586235] [2022-01-11 00:17:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:11,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-11 00:17:11,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925586235] [2022-01-11 00:17:11,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925586235] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:11,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:11,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:17:11,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456921156] [2022-01-11 00:17:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:11,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:17:11,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:11,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:17:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:17:11,398 INFO L87 Difference]: Start difference. First operand 6505 states and 7340 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:11,891 INFO L93 Difference]: Finished difference Result 12121 states and 13715 transitions. [2022-01-11 00:17:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:17:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-01-11 00:17:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:11,897 INFO L225 Difference]: With dead ends: 12121 [2022-01-11 00:17:11,897 INFO L226 Difference]: Without dead ends: 5636 [2022-01-11 00:17:11,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:17:11,902 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 757 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 786 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-11 00:17:11,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [757 Valid, 786 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2022-01-11 00:17:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 4768. [2022-01-11 00:17:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4768 states, 4766 states have (on average 1.1076374318086446) internal successors, (5279), 4767 states have internal predecessors, (5279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 5279 transitions. [2022-01-11 00:17:12,106 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 5279 transitions. Word has length 132 [2022-01-11 00:17:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:12,106 INFO L470 AbstractCegarLoop]: Abstraction has 4768 states and 5279 transitions. [2022-01-11 00:17:12,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 5279 transitions. [2022-01-11 00:17:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 00:17:12,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:12,108 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 00:17:12,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 00:17:12,108 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:12,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1144007112, now seen corresponding path program 1 times [2022-01-11 00:17:12,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:12,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588299699] [2022-01-11 00:17:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:12,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-11 00:17:12,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:12,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588299699] [2022-01-11 00:17:12,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588299699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:12,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:12,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:17:12,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800063312] [2022-01-11 00:17:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:12,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:17:12,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:12,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:17:12,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:17:12,163 INFO L87 Difference]: Start difference. First operand 4768 states and 5279 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:12,422 INFO L93 Difference]: Finished difference Result 7453 states and 8208 transitions. [2022-01-11 00:17:12,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:17:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-01-11 00:17:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:12,425 INFO L225 Difference]: With dead ends: 7453 [2022-01-11 00:17:12,425 INFO L226 Difference]: Without dead ends: 1679 [2022-01-11 00:17:12,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:17:12,429 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 591 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 679 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-11 00:17:12,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 679 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-01-11 00:17:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1577. [2022-01-11 00:17:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1575 states have (on average 1.0685714285714285) internal successors, (1683), 1576 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-11 00:17:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1683 transitions. [2022-01-11 00:17:12,520 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1683 transitions. Word has length 132 [2022-01-11 00:17:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:12,520 INFO L470 AbstractCegarLoop]: Abstraction has 1577 states and 1683 transitions. [2022-01-11 00:17:12,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1683 transitions. [2022-01-11 00:17:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-11 00:17:12,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:12,522 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] [2022-01-11 00:17:12,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 00:17:12,522 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:12,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash 594170086, now seen corresponding path program 1 times [2022-01-11 00:17:12,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:12,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65565665] [2022-01-11 00:17:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:12,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:12,686 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-11 00:17:12,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:12,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65565665] [2022-01-11 00:17:12,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65565665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:12,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:12,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:17:12,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330423330] [2022-01-11 00:17:12,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:12,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:17:12,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:12,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:17:12,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:17:12,688 INFO L87 Difference]: Start difference. First operand 1577 states and 1683 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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-11 00:17:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:12,940 INFO L93 Difference]: Finished difference Result 1577 states and 1683 transitions. [2022-01-11 00:17:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:17:12,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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 164 [2022-01-11 00:17:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:12,943 INFO L225 Difference]: With dead ends: 1577 [2022-01-11 00:17:12,943 INFO L226 Difference]: Without dead ends: 1575 [2022-01-11 00:17:12,943 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-11 00:17:12,944 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 370 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1371 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-11 00:17:12,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 1371 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-01-11 00:17:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2022-01-11 00:17:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.0673443456162643) internal successors, (1680), 1574 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1680 transitions. [2022-01-11 00:17:13,136 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1680 transitions. Word has length 164 [2022-01-11 00:17:13,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:13,136 INFO L470 AbstractCegarLoop]: Abstraction has 1575 states and 1680 transitions. [2022-01-11 00:17:13,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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-11 00:17:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1680 transitions. [2022-01-11 00:17:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-01-11 00:17:13,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:13,139 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] [2022-01-11 00:17:13,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 00:17:13,139 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash -699717126, now seen corresponding path program 1 times [2022-01-11 00:17:13,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:13,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737237937] [2022-01-11 00:17:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:13,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:13,198 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-11 00:17:13,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:13,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737237937] [2022-01-11 00:17:13,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737237937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:17:13,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:17:13,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:17:13,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938669892] [2022-01-11 00:17:13,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:17:13,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:17:13,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:17:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:13,200 INFO L87 Difference]: Start difference. First operand 1575 states and 1680 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:13,513 INFO L93 Difference]: Finished difference Result 2885 states and 3067 transitions. [2022-01-11 00:17:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:17:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 168 [2022-01-11 00:17:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:13,516 INFO L225 Difference]: With dead ends: 2885 [2022-01-11 00:17:13,516 INFO L226 Difference]: Without dead ends: 2222 [2022-01-11 00:17:13,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:17:13,518 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 194 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 700 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-11 00:17:13,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 700 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:17:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2022-01-11 00:17:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1577. [2022-01-11 00:17:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1576 states have (on average 1.0672588832487309) internal successors, (1682), 1576 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1682 transitions. [2022-01-11 00:17:13,734 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1682 transitions. Word has length 168 [2022-01-11 00:17:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:13,735 INFO L470 AbstractCegarLoop]: Abstraction has 1577 states and 1682 transitions. [2022-01-11 00:17:13,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:17:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1682 transitions. [2022-01-11 00:17:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-11 00:17:13,737 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:13,737 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-11 00:17:13,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 00:17:13,737 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:17:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash -247147508, now seen corresponding path program 1 times [2022-01-11 00:17:13,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:13,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872690842] [2022-01-11 00:17:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:13,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 00:17:13,772 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 00:17:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 00:17:13,866 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 00:17:13,866 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 00:17:13,867 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-11 00:17:13,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-11 00:17:13,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 00:17:13,874 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-11 00:17:13,877 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 00:17:14,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:17:14 BasicIcfg [2022-01-11 00:17:14,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 00:17:14,218 INFO L158 Benchmark]: Toolchain (without parser) took 15684.39ms. Allocated memory was 191.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 134.7MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 372.5MB. Max. memory is 8.0GB. [2022-01-11 00:17:14,218 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 00:17:14,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.60ms. Allocated memory was 191.9MB in the beginning and 309.3MB in the end (delta: 117.4MB). Free memory was 134.4MB in the beginning and 277.9MB in the end (delta: -143.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-11 00:17:14,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.39ms. Allocated memory is still 309.3MB. Free memory was 277.9MB in the beginning and 274.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 00:17:14,219 INFO L158 Benchmark]: Boogie Preprocessor took 34.65ms. Allocated memory is still 309.3MB. Free memory was 274.8MB in the beginning and 272.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 00:17:14,219 INFO L158 Benchmark]: RCFGBuilder took 635.51ms. Allocated memory is still 309.3MB. Free memory was 272.1MB in the beginning and 244.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-11 00:17:14,219 INFO L158 Benchmark]: IcfgTransformer took 139.53ms. Allocated memory is still 309.3MB. Free memory was 244.9MB in the beginning and 232.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-11 00:17:14,221 INFO L158 Benchmark]: TraceAbstraction took 14519.03ms. Allocated memory was 309.3MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 231.8MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 352.5MB. Max. memory is 8.0GB. [2022-01-11 00:17:14,228 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.11ms. Allocated memory is still 191.9MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.60ms. Allocated memory was 191.9MB in the beginning and 309.3MB in the end (delta: 117.4MB). Free memory was 134.4MB in the beginning and 277.9MB in the end (delta: -143.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.39ms. Allocated memory is still 309.3MB. Free memory was 277.9MB in the beginning and 274.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.65ms. Allocated memory is still 309.3MB. Free memory was 274.8MB in the beginning and 272.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 635.51ms. Allocated memory is still 309.3MB. Free memory was 272.1MB in the beginning and 244.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * IcfgTransformer took 139.53ms. Allocated memory is still 309.3MB. Free memory was 244.9MB in the beginning and 232.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14519.03ms. Allocated memory was 309.3MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 231.8MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 352.5MB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=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] [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 [L558] FCALL update_channels() [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L559] RET init_threads() [L560] CALL fire_delta_events() [L356] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L361] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L366] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L371] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L376] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L381] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L560] RET fire_delta_events() [L561] CALL activate_threads() [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L178] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L188] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L190] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L197] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L207] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L209] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L216] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L226] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L228] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L561] RET activate_threads() [L562] CALL reset_delta_events() [L394] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L399] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L404] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L409] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L414] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L419] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L562] RET reset_delta_events() [L565] COND TRUE 1 VAL [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, 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] [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L296] CALL, EXPR exists_runnable_thread() [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L284] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L296] RET, EXPR exists_runnable_thread() [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L117] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND TRUE \read(tmp_ndt_3) [L336] t2_st = 1 [L337] CALL transmit2() [L142] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L153] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L155] t2_pc = 1 [L156] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L337] RET transmit2() [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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=4, tmp_ndt_3=1, token=0] [L296] CALL, EXPR exists_runnable_thread() [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L284] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L296] RET, EXPR exists_runnable_thread() [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=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=4, tmp_ndt_3=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L61] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 [L67] CALL immediate_notify() [L467] CALL activate_threads() [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L178] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L188] __retres1 = 0 VAL [__retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L190] return (__retres1); VAL [\result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L197] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [__retres1=1, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L209] return (__retres1); VAL [\result=-1, __retres1=1, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L216] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L217] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L226] __retres1 = 0 VAL [__retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L228] return (__retres1); VAL [\result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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] [L467] RET activate_threads() [L67] RET immediate_notify() [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L125] token += 1 [L126] E_2 = 1 [L127] CALL immediate_notify() [L467] CALL activate_threads() [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L178] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L179] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L188] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L190] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L197] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L198] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L207] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L209] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L216] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L217] COND TRUE E_2 == 1 [L218] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L228] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND TRUE \read(tmp___1) [L454] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L467] RET activate_threads() [L127] RET immediate_notify() [L128] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L117] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND TRUE \read(tmp_ndt_3) [L336] t2_st = 1 [L337] CALL transmit2() [L142] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L145] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L161] token += 1 [L162] E_M = 1 [L163] CALL immediate_notify() [L467] CALL activate_threads() [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L178] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L179] COND TRUE E_M == 1 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L190] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND TRUE \read(tmp) [L438] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L197] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L198] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L207] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L209] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L216] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L217] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L226] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L228] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L467] RET activate_threads() [L163] RET immediate_notify() [L164] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L153] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L155] t2_pc = 1 [L156] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L337] RET transmit2() [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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=1, tmp_ndt_2=5, tmp_ndt_3=1, token=2] [L296] CALL, EXPR exists_runnable_thread() [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L284] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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] [L296] RET, EXPR exists_runnable_thread() [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=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=1, tmp_ndt_2=5, tmp_ndt_3=1, token=2] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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] [L53] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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] [L75] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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] [L86] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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] [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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] [L88] COND TRUE tmp_var == 5 [L89] CALL error() [L20] reach_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, 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: 20]: 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, 240 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7511 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7511 mSDsluCounter, 15205 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6116 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 9089 mSDtfsCounter, 429 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10419occurred in iteration=15, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 3061 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2617 NumberOfCodeBlocks, 2617 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2423 ConstructedInterpolants, 0 QuantifiedInterpolants, 5840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 395/395 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-11 00:17:14,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...