/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:51:52,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:51:52,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:51:52,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:51:52,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:51:52,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:51:52,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:51:52,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:51:52,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:51:52,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:51:52,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:51:52,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:51:52,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:51:52,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:51:52,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:51:52,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:51:52,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:51:52,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:51:52,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:51:52,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:51:52,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:51:52,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:51:52,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:51:52,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:51:52,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:51:52,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:51:52,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:51:52,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:51:52,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:51:52,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:51:52,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:51:52,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:51:52,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:51:52,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:51:52,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:51:52,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:51:52,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:51:52,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:51:52,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:51:52,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:51:52,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:51:52,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:51:52,600 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:51:52,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:51:52,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:51:52,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:51:52,604 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:51:52,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:51:52,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:51:52,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:51:52,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:51:52,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:51:52,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:51:52,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:51:52,607 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:51:52,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:51:52,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:51:52,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:51:52,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:51:52,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:51:52,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:51:52,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:51:52,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:51:52,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:51:52,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:51:52,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:51:52,611 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:51:52,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/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 [2020-12-23 09:51:53,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:51:53,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:51:53,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:51:53,094 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:51:53,095 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:51:53,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:51:53,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d18806849/8947d5185d044a6584e4603ae73dfa58/FLAGabf9ee593 [2020-12-23 09:51:54,166 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:51:54,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:51:54,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d18806849/8947d5185d044a6584e4603ae73dfa58/FLAGabf9ee593 [2020-12-23 09:51:54,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d18806849/8947d5185d044a6584e4603ae73dfa58 [2020-12-23 09:51:54,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:51:54,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:51:54,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:51:54,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:51:54,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:51:54,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:51:54" (1/1) ... [2020-12-23 09:51:54,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f894ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:54, skipping insertion in model container [2020-12-23 09:51:54,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:51:54" (1/1) ... [2020-12-23 09:51:54,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:51:54,519 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 09:51:54,800 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c[12820,12833] [2020-12-23 09:51:54,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:51:54,850 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 09:51:55,027 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c[12820,12833] [2020-12-23 09:51:55,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:51:55,056 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:51:55,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55 WrapperNode [2020-12-23 09:51:55,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:51:55,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:51:55,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:51:55,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:51:55,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:51:55,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:51:55,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:51:55,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:51:55,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... [2020-12-23 09:51:55,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:51:55,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:51:55,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:51:55,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:51:55,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:51:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:51:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:51:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:51:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:51:56,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:51:56,348 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2020-12-23 09:51:56,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:51:56 BoogieIcfgContainer [2020-12-23 09:51:56,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:51:56,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:51:56,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:51:56,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:51:56,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:51:54" (1/3) ... [2020-12-23 09:51:56,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238c4767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:51:56, skipping insertion in model container [2020-12-23 09:51:56,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:51:55" (2/3) ... [2020-12-23 09:51:56,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238c4767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:51:56, skipping insertion in model container [2020-12-23 09:51:56,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:51:56" (3/3) ... [2020-12-23 09:51:56,361 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:51:56,368 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:51:56,374 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:51:56,393 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:51:56,422 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:51:56,422 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:51:56,422 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:51:56,422 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:51:56,422 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:51:56,423 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:51:56,423 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:51:56,423 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:51:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2020-12-23 09:51:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 09:51:56,453 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:51:56,454 INFO L422 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] [2020-12-23 09:51:56,455 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:51:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:51:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1522683097, now seen corresponding path program 1 times [2020-12-23 09:51:56,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:51:56,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306222617] [2020-12-23 09:51:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:51:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:51:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:51:56,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306222617] [2020-12-23 09:51:56,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:51:56,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:51:56,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754999039] [2020-12-23 09:51:56,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 09:51:56,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:51:56,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 09:51:56,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:51:56,743 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2020-12-23 09:51:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:51:56,775 INFO L93 Difference]: Finished difference Result 205 states and 341 transitions. [2020-12-23 09:51:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 09:51:56,777 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2020-12-23 09:51:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:51:56,792 INFO L225 Difference]: With dead ends: 205 [2020-12-23 09:51:56,793 INFO L226 Difference]: Without dead ends: 119 [2020-12-23 09:51:56,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:51:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-23 09:51:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-12-23 09:51:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-23 09:51:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 200 transitions. [2020-12-23 09:51:56,850 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 200 transitions. Word has length 34 [2020-12-23 09:51:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:51:56,850 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 200 transitions. [2020-12-23 09:51:56,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 09:51:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 200 transitions. [2020-12-23 09:51:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 09:51:56,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:51:56,853 INFO L422 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] [2020-12-23 09:51:56,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:51:56,854 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:51:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:51:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash -136479703, now seen corresponding path program 1 times [2020-12-23 09:51:56,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:51:56,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866878087] [2020-12-23 09:51:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:51:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:51:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:51:57,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866878087] [2020-12-23 09:51:57,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:51:57,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:51:57,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28768782] [2020-12-23 09:51:57,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:51:57,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:51:57,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:51:57,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:51:57,013 INFO L87 Difference]: Start difference. First operand 119 states and 200 transitions. Second operand 5 states. [2020-12-23 09:51:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:51:57,229 INFO L93 Difference]: Finished difference Result 204 states and 334 transitions. [2020-12-23 09:51:57,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:51:57,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-12-23 09:51:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:51:57,234 INFO L225 Difference]: With dead ends: 204 [2020-12-23 09:51:57,234 INFO L226 Difference]: Without dead ends: 119 [2020-12-23 09:51:57,238 INFO L677 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 [2020-12-23 09:51:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-23 09:51:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-12-23 09:51:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-23 09:51:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2020-12-23 09:51:57,253 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 34 [2020-12-23 09:51:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:51:57,254 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2020-12-23 09:51:57,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:51:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2020-12-23 09:51:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 09:51:57,262 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:51:57,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:51:57,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:51:57,263 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:51:57,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:51:57,264 INFO L82 PathProgramCache]: Analyzing trace with hash 958823668, now seen corresponding path program 1 times [2020-12-23 09:51:57,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:51:57,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640597955] [2020-12-23 09:51:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:51:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:51:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:51:57,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640597955] [2020-12-23 09:51:57,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:51:57,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:51:57,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836718605] [2020-12-23 09:51:57,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:51:57,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:51:57,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:51:57,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:51:57,470 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand 3 states. [2020-12-23 09:51:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:51:57,507 INFO L93 Difference]: Finished difference Result 269 states and 408 transitions. [2020-12-23 09:51:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:51:57,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-12-23 09:51:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:51:57,514 INFO L225 Difference]: With dead ends: 269 [2020-12-23 09:51:57,515 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 09:51:57,517 INFO L677 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 [2020-12-23 09:51:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 09:51:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2020-12-23 09:51:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-23 09:51:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 276 transitions. [2020-12-23 09:51:57,547 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 276 transitions. Word has length 65 [2020-12-23 09:51:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:51:57,547 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 276 transitions. [2020-12-23 09:51:57,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:51:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 276 transitions. [2020-12-23 09:51:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:51:57,549 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:51:57,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:51:57,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:51:57,550 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:51:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:51:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1904004827, now seen corresponding path program 1 times [2020-12-23 09:51:57,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:51:57,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32095853] [2020-12-23 09:51:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:51:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:51:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:51:57,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32095853] [2020-12-23 09:51:57,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:51:57,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:51:57,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344839471] [2020-12-23 09:51:57,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:51:57,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:51:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:51:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:51:57,679 INFO L87 Difference]: Start difference. First operand 186 states and 276 transitions. Second operand 3 states. [2020-12-23 09:51:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:51:57,714 INFO L93 Difference]: Finished difference Result 458 states and 712 transitions. [2020-12-23 09:51:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:51:57,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 09:51:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:51:57,721 INFO L225 Difference]: With dead ends: 458 [2020-12-23 09:51:57,721 INFO L226 Difference]: Without dead ends: 310 [2020-12-23 09:51:57,723 INFO L677 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 [2020-12-23 09:51:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-12-23 09:51:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2020-12-23 09:51:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-12-23 09:51:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 471 transitions. [2020-12-23 09:51:57,747 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 471 transitions. Word has length 66 [2020-12-23 09:51:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:51:57,748 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 471 transitions. [2020-12-23 09:51:57,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:51:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 471 transitions. [2020-12-23 09:51:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 09:51:57,750 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:51:57,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:51:57,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:51:57,751 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:51:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:51:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1896694372, now seen corresponding path program 1 times [2020-12-23 09:51:57,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:51:57,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542936147] [2020-12-23 09:51:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:51:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:51:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:51:57,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542936147] [2020-12-23 09:51:57,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:51:57,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:51:57,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611802180] [2020-12-23 09:51:57,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:51:57,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:51:57,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:51:57,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:51:57,883 INFO L87 Difference]: Start difference. First operand 308 states and 471 transitions. Second operand 3 states. [2020-12-23 09:51:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:51:57,919 INFO L93 Difference]: Finished difference Result 800 states and 1257 transitions. [2020-12-23 09:51:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:51:57,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-12-23 09:51:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:51:57,924 INFO L225 Difference]: With dead ends: 800 [2020-12-23 09:51:57,924 INFO L226 Difference]: Without dead ends: 530 [2020-12-23 09:51:57,926 INFO L677 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 [2020-12-23 09:51:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-12-23 09:51:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2020-12-23 09:51:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-12-23 09:51:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 819 transitions. [2020-12-23 09:51:57,963 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 819 transitions. Word has length 67 [2020-12-23 09:51:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:51:57,963 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 819 transitions. [2020-12-23 09:51:57,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:51:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 819 transitions. [2020-12-23 09:51:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 09:51:57,965 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:51:57,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:51:57,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:51:57,966 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:51:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:51:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1528655733, now seen corresponding path program 1 times [2020-12-23 09:51:57,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:51:57,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722331795] [2020-12-23 09:51:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:51:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:51:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:51:58,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722331795] [2020-12-23 09:51:58,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:51:58,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:51:58,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902487397] [2020-12-23 09:51:58,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:51:58,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:51:58,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:51:58,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:51:58,074 INFO L87 Difference]: Start difference. First operand 528 states and 819 transitions. Second operand 3 states. [2020-12-23 09:51:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:51:58,174 INFO L93 Difference]: Finished difference Result 1412 states and 2221 transitions. [2020-12-23 09:51:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:51:58,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-23 09:51:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:51:58,181 INFO L225 Difference]: With dead ends: 1412 [2020-12-23 09:51:58,181 INFO L226 Difference]: Without dead ends: 922 [2020-12-23 09:51:58,185 INFO L677 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 [2020-12-23 09:51:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2020-12-23 09:51:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 920. [2020-12-23 09:51:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-12-23 09:51:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1431 transitions. [2020-12-23 09:51:58,242 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1431 transitions. Word has length 68 [2020-12-23 09:51:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:51:58,246 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1431 transitions. [2020-12-23 09:51:58,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:51:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1431 transitions. [2020-12-23 09:51:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 09:51:58,255 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:51:58,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:51:58,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:51:58,256 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:51:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:51:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -571662380, now seen corresponding path program 1 times [2020-12-23 09:51:58,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:51:58,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437593492] [2020-12-23 09:51:58,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:51:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:51:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:51:58,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437593492] [2020-12-23 09:51:58,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:51:58,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:51:58,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235137126] [2020-12-23 09:51:58,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:51:58,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:51:58,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:51:58,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:51:58,569 INFO L87 Difference]: Start difference. First operand 920 states and 1431 transitions. Second operand 7 states. [2020-12-23 09:51:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:51:58,915 INFO L93 Difference]: Finished difference Result 4866 states and 7596 transitions. [2020-12-23 09:51:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:51:58,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2020-12-23 09:51:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:51:58,939 INFO L225 Difference]: With dead ends: 4866 [2020-12-23 09:51:58,939 INFO L226 Difference]: Without dead ends: 3984 [2020-12-23 09:51:58,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:51:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2020-12-23 09:51:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3976. [2020-12-23 09:51:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2020-12-23 09:51:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 6183 transitions. [2020-12-23 09:51:59,130 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 6183 transitions. Word has length 69 [2020-12-23 09:51:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:51:59,132 INFO L481 AbstractCegarLoop]: Abstraction has 3976 states and 6183 transitions. [2020-12-23 09:51:59,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:51:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 6183 transitions. [2020-12-23 09:51:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 09:51:59,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:51:59,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:51:59,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:51:59,135 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:51:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:51:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -238588952, now seen corresponding path program 1 times [2020-12-23 09:51:59,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:51:59,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747617439] [2020-12-23 09:51:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:51:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:51:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:51:59,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747617439] [2020-12-23 09:51:59,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:51:59,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:51:59,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348299595] [2020-12-23 09:51:59,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:51:59,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:51:59,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:51:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:51:59,240 INFO L87 Difference]: Start difference. First operand 3976 states and 6183 transitions. Second operand 3 states. [2020-12-23 09:51:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:51:59,544 INFO L93 Difference]: Finished difference Result 10780 states and 16713 transitions. [2020-12-23 09:51:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:51:59,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-23 09:51:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:51:59,579 INFO L225 Difference]: With dead ends: 10780 [2020-12-23 09:51:59,580 INFO L226 Difference]: Without dead ends: 6842 [2020-12-23 09:51:59,588 INFO L677 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 [2020-12-23 09:51:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6842 states. [2020-12-23 09:51:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6842 to 6840. [2020-12-23 09:51:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2020-12-23 09:52:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 10487 transitions. [2020-12-23 09:52:00,008 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 10487 transitions. Word has length 70 [2020-12-23 09:52:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:52:00,008 INFO L481 AbstractCegarLoop]: Abstraction has 6840 states and 10487 transitions. [2020-12-23 09:52:00,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:52:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 10487 transitions. [2020-12-23 09:52:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 09:52:00,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:52:00,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:52:00,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:52:00,012 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:52:00,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:52:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash -965246768, now seen corresponding path program 1 times [2020-12-23 09:52:00,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:52:00,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555657448] [2020-12-23 09:52:00,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:52:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:52:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:52:00,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555657448] [2020-12-23 09:52:00,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:52:00,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:52:00,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716373905] [2020-12-23 09:52:00,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:52:00,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:52:00,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:52:00,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:52:00,190 INFO L87 Difference]: Start difference. First operand 6840 states and 10487 transitions. Second operand 7 states. [2020-12-23 09:52:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:52:01,514 INFO L93 Difference]: Finished difference Result 34692 states and 53341 transitions. [2020-12-23 09:52:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:52:01,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2020-12-23 09:52:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:52:01,620 INFO L225 Difference]: With dead ends: 34692 [2020-12-23 09:52:01,621 INFO L226 Difference]: Without dead ends: 27890 [2020-12-23 09:52:01,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:52:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27890 states. [2020-12-23 09:52:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27890 to 13640. [2020-12-23 09:52:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13640 states. [2020-12-23 09:52:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13640 states to 13640 states and 20615 transitions. [2020-12-23 09:52:02,591 INFO L78 Accepts]: Start accepts. Automaton has 13640 states and 20615 transitions. Word has length 70 [2020-12-23 09:52:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:52:02,595 INFO L481 AbstractCegarLoop]: Abstraction has 13640 states and 20615 transitions. [2020-12-23 09:52:02,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:52:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13640 states and 20615 transitions. [2020-12-23 09:52:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 09:52:02,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:52:02,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:52:02,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:52:02,597 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:52:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:52:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash -241201943, now seen corresponding path program 1 times [2020-12-23 09:52:02,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:52:02,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610282281] [2020-12-23 09:52:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:52:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:52:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:52:02,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610282281] [2020-12-23 09:52:02,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:52:02,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:52:02,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807270034] [2020-12-23 09:52:02,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:52:02,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:52:02,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:52:02,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:52:02,733 INFO L87 Difference]: Start difference. First operand 13640 states and 20615 transitions. Second operand 8 states. [2020-12-23 09:52:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:52:04,303 INFO L93 Difference]: Finished difference Result 28522 states and 42472 transitions. [2020-12-23 09:52:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:52:04,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2020-12-23 09:52:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:52:04,368 INFO L225 Difference]: With dead ends: 28522 [2020-12-23 09:52:04,368 INFO L226 Difference]: Without dead ends: 28520 [2020-12-23 09:52:04,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:52:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28520 states. [2020-12-23 09:52:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28520 to 14600. [2020-12-23 09:52:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2020-12-23 09:52:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 21575 transitions. [2020-12-23 09:52:05,273 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 21575 transitions. Word has length 71 [2020-12-23 09:52:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:52:05,274 INFO L481 AbstractCegarLoop]: Abstraction has 14600 states and 21575 transitions. [2020-12-23 09:52:05,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:52:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 21575 transitions. [2020-12-23 09:52:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 09:52:05,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:52:05,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:52:05,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:52:05,276 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:52:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:52:05,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1165253064, now seen corresponding path program 1 times [2020-12-23 09:52:05,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:52:05,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662898738] [2020-12-23 09:52:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:52:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:52:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:52:05,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662898738] [2020-12-23 09:52:05,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:52:05,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:52:05,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108545528] [2020-12-23 09:52:05,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:52:05,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:52:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:52:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:52:05,353 INFO L87 Difference]: Start difference. First operand 14600 states and 21575 transitions. Second operand 3 states. [2020-12-23 09:52:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:52:06,479 INFO L93 Difference]: Finished difference Result 35662 states and 52763 transitions. [2020-12-23 09:52:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:52:06,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-23 09:52:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:52:06,620 INFO L225 Difference]: With dead ends: 35662 [2020-12-23 09:52:06,621 INFO L226 Difference]: Without dead ends: 21100 [2020-12-23 09:52:06,642 INFO L677 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 [2020-12-23 09:52:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21100 states. [2020-12-23 09:52:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21100 to 20954. [2020-12-23 09:52:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20954 states. [2020-12-23 09:52:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 30793 transitions. [2020-12-23 09:52:07,988 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 30793 transitions. Word has length 72 [2020-12-23 09:52:07,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:52:07,989 INFO L481 AbstractCegarLoop]: Abstraction has 20954 states and 30793 transitions. [2020-12-23 09:52:07,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:52:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 30793 transitions. [2020-12-23 09:52:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:52:08,002 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:52:08,003 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:52:08,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:52:08,003 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:52:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:52:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash -396516070, now seen corresponding path program 1 times [2020-12-23 09:52:08,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:52:08,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961513480] [2020-12-23 09:52:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:52:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:52:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:52:08,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961513480] [2020-12-23 09:52:08,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581147473] [2020-12-23 09:52:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:52:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:52:08,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 09:52:08,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:52:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:52:08,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:52:08,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2020-12-23 09:52:08,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766169168] [2020-12-23 09:52:08,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 09:52:08,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:52:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 09:52:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:52:08,760 INFO L87 Difference]: Start difference. First operand 20954 states and 30793 transitions. Second operand 12 states. [2020-12-23 09:52:14,329 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2020-12-23 09:52:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:52:20,545 INFO L93 Difference]: Finished difference Result 164018 states and 239259 transitions. [2020-12-23 09:52:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-12-23 09:52:20,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2020-12-23 09:52:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:52:21,029 INFO L225 Difference]: With dead ends: 164018 [2020-12-23 09:52:21,030 INFO L226 Difference]: Without dead ends: 143696 [2020-12-23 09:52:21,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=797, Invalid=3109, Unknown=0, NotChecked=0, Total=3906 [2020-12-23 09:52:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143696 states. [2020-12-23 09:52:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143696 to 80658. [2020-12-23 09:52:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80658 states. [2020-12-23 09:52:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80658 states to 80658 states and 117317 transitions. [2020-12-23 09:52:26,966 INFO L78 Accepts]: Start accepts. Automaton has 80658 states and 117317 transitions. Word has length 100 [2020-12-23 09:52:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:52:26,967 INFO L481 AbstractCegarLoop]: Abstraction has 80658 states and 117317 transitions. [2020-12-23 09:52:26,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 09:52:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 80658 states and 117317 transitions. [2020-12-23 09:52:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:52:26,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:52:26,993 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:52:27,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 09:52:27,207 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:52:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:52:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1964197035, now seen corresponding path program 1 times [2020-12-23 09:52:27,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:52:27,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729220039] [2020-12-23 09:52:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:52:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:52:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:52:27,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729220039] [2020-12-23 09:52:27,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:52:27,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:52:27,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660664017] [2020-12-23 09:52:27,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:52:27,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:52:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:52:27,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:52:27,291 INFO L87 Difference]: Start difference. First operand 80658 states and 117317 transitions. Second operand 3 states. [2020-12-23 09:52:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:52:32,998 INFO L93 Difference]: Finished difference Result 174118 states and 253419 transitions. [2020-12-23 09:52:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:52:32,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:52:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:52:33,190 INFO L225 Difference]: With dead ends: 174118 [2020-12-23 09:52:33,191 INFO L226 Difference]: Without dead ends: 121040 [2020-12-23 09:52:33,295 INFO L677 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 [2020-12-23 09:52:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121040 states. [2020-12-23 09:52:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121040 to 115634. [2020-12-23 09:52:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115634 states. [2020-12-23 09:52:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115634 states to 115634 states and 166669 transitions. [2020-12-23 09:52:39,780 INFO L78 Accepts]: Start accepts. Automaton has 115634 states and 166669 transitions. Word has length 100 [2020-12-23 09:52:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:52:39,780 INFO L481 AbstractCegarLoop]: Abstraction has 115634 states and 166669 transitions. [2020-12-23 09:52:39,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:52:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 115634 states and 166669 transitions. [2020-12-23 09:52:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:52:40,018 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:52:40,018 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:52:40,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:52:40,019 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:52:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:52:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1432680103, now seen corresponding path program 1 times [2020-12-23 09:52:40,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:52:40,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178876379] [2020-12-23 09:52:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:52:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:52:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:52:40,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178876379] [2020-12-23 09:52:40,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:52:40,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:52:40,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288109179] [2020-12-23 09:52:40,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:52:40,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:52:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:52:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:52:40,117 INFO L87 Difference]: Start difference. First operand 115634 states and 166669 transitions. Second operand 6 states. [2020-12-23 09:52:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:52:48,705 INFO L93 Difference]: Finished difference Result 294463 states and 424938 transitions. [2020-12-23 09:52:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:52:48,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2020-12-23 09:52:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:52:48,971 INFO L225 Difference]: With dead ends: 294463 [2020-12-23 09:52:48,972 INFO L226 Difference]: Without dead ends: 178891 [2020-12-23 09:52:49,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:52:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178891 states. [2020-12-23 09:52:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178891 to 157445. [2020-12-23 09:52:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157445 states. [2020-12-23 09:52:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157445 states to 157445 states and 225325 transitions. [2020-12-23 09:52:58,003 INFO L78 Accepts]: Start accepts. Automaton has 157445 states and 225325 transitions. Word has length 100 [2020-12-23 09:52:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:52:58,003 INFO L481 AbstractCegarLoop]: Abstraction has 157445 states and 225325 transitions. [2020-12-23 09:52:58,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:52:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 157445 states and 225325 transitions. [2020-12-23 09:52:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:52:58,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:52:58,029 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:52:58,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:52:58,030 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:52:58,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:52:58,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1928312001, now seen corresponding path program 1 times [2020-12-23 09:52:58,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:52:58,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362605669] [2020-12-23 09:52:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:52:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:52:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:52:58,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362605669] [2020-12-23 09:52:58,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:52:58,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:52:58,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824482434] [2020-12-23 09:52:58,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:52:58,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:52:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:52:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:52:58,095 INFO L87 Difference]: Start difference. First operand 157445 states and 225325 transitions. Second operand 3 states. [2020-12-23 09:53:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:08,349 INFO L93 Difference]: Finished difference Result 357097 states and 510643 transitions. [2020-12-23 09:53:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:08,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:53:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:08,713 INFO L225 Difference]: With dead ends: 357097 [2020-12-23 09:53:08,714 INFO L226 Difference]: Without dead ends: 211267 [2020-12-23 09:53:08,831 INFO L677 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 [2020-12-23 09:53:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211267 states. [2020-12-23 09:53:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211267 to 173625. [2020-12-23 09:53:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173625 states. [2020-12-23 09:53:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173625 states to 173625 states and 245981 transitions. [2020-12-23 09:53:18,987 INFO L78 Accepts]: Start accepts. Automaton has 173625 states and 245981 transitions. Word has length 100 [2020-12-23 09:53:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:18,988 INFO L481 AbstractCegarLoop]: Abstraction has 173625 states and 245981 transitions. [2020-12-23 09:53:18,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 173625 states and 245981 transitions. [2020-12-23 09:53:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:53:19,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:19,012 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:19,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:53:19,012 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:19,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:19,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1906240849, now seen corresponding path program 1 times [2020-12-23 09:53:19,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:19,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826862730] [2020-12-23 09:53:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:53:19,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826862730] [2020-12-23 09:53:19,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:19,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:53:19,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598298823] [2020-12-23 09:53:19,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:53:19,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:19,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:53:19,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:53:19,175 INFO L87 Difference]: Start difference. First operand 173625 states and 245981 transitions. Second operand 7 states. [2020-12-23 09:53:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:38,928 INFO L93 Difference]: Finished difference Result 467877 states and 667459 transitions. [2020-12-23 09:53:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:53:38,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2020-12-23 09:53:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:39,805 INFO L225 Difference]: With dead ends: 467877 [2020-12-23 09:53:39,806 INFO L226 Difference]: Without dead ends: 394915 [2020-12-23 09:53:39,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:53:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394915 states. [2020-12-23 09:53:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394915 to 243705. [2020-12-23 09:53:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243705 states. [2020-12-23 09:53:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243705 states to 243705 states and 345161 transitions. [2020-12-23 09:53:55,064 INFO L78 Accepts]: Start accepts. Automaton has 243705 states and 345161 transitions. Word has length 100 [2020-12-23 09:53:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:55,064 INFO L481 AbstractCegarLoop]: Abstraction has 243705 states and 345161 transitions. [2020-12-23 09:53:55,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:53:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 243705 states and 345161 transitions. [2020-12-23 09:53:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:53:55,093 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:55,093 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:55,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:53:55,093 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash 425782753, now seen corresponding path program 1 times [2020-12-23 09:53:55,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:55,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469919842] [2020-12-23 09:53:55,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:55,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469919842] [2020-12-23 09:53:55,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:55,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:55,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624148668] [2020-12-23 09:53:55,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:55,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:55,190 INFO L87 Difference]: Start difference. First operand 243705 states and 345161 transitions. Second operand 3 states. [2020-12-23 09:54:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:14,148 INFO L93 Difference]: Finished difference Result 521662 states and 735932 transitions. [2020-12-23 09:54:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:14,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:54:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:14,926 INFO L225 Difference]: With dead ends: 521662 [2020-12-23 09:54:14,927 INFO L226 Difference]: Without dead ends: 350204 [2020-12-23 09:54:15,088 INFO L677 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 [2020-12-23 09:54:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350204 states. [2020-12-23 09:54:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350204 to 332970. [2020-12-23 09:54:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332970 states. [2020-12-23 09:54:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332970 states to 332970 states and 465884 transitions. [2020-12-23 09:54:38,162 INFO L78 Accepts]: Start accepts. Automaton has 332970 states and 465884 transitions. Word has length 100 [2020-12-23 09:54:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:38,163 INFO L481 AbstractCegarLoop]: Abstraction has 332970 states and 465884 transitions. [2020-12-23 09:54:38,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 332970 states and 465884 transitions. [2020-12-23 09:54:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:54:38,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:38,186 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:38,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:54:38,186 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:38,187 INFO L82 PathProgramCache]: Analyzing trace with hash 853128817, now seen corresponding path program 1 times [2020-12-23 09:54:38,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:38,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006479567] [2020-12-23 09:54:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:38,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006479567] [2020-12-23 09:54:38,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:38,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:38,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216633095] [2020-12-23 09:54:38,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:38,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:38,258 INFO L87 Difference]: Start difference. First operand 332970 states and 465884 transitions. Second operand 3 states.