/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-178dd20 [2021-01-06 19:45:11,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:45:11,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:45:11,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:45:11,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:45:11,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:45:11,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:45:11,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:45:11,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:45:11,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:45:11,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:45:11,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:45:11,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:45:11,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:45:11,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:45:11,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:45:11,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:45:11,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:45:11,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:45:11,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:45:11,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:45:11,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:45:11,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:45:11,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:45:11,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:45:11,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:45:11,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:45:11,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:45:11,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:45:11,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:45:11,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:45:11,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:45:11,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:45:11,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:45:11,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:45:11,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:45:11,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:45:11,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:45:11,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:45:11,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:45:11,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:45:11,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:45:11,786 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:45:11,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:45:11,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:45:11,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:45:11,789 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:45:11,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:45:11,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:45:11,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:45:11,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:45:11,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:45:11,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:45:11,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:45:11,791 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:45:11,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:45:11,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:45:11,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:45:11,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:45:11,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:45:11,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:45:11,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:45:11,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:45:11,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:45:11,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:45:11,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:45:11,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:45:11,794 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 [2021-01-06 19:45:12,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:45:12,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:45:12,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:45:12,276 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:45:12,276 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:45:12,277 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 [2021-01-06 19:45:12,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1bdc3ea24/da0b4b8ade804019a39e91c3d2c6140c/FLAG967cafa27 [2021-01-06 19:45:13,052 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:45:13,053 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 [2021-01-06 19:45:13,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1bdc3ea24/da0b4b8ade804019a39e91c3d2c6140c/FLAG967cafa27 [2021-01-06 19:45:13,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1bdc3ea24/da0b4b8ade804019a39e91c3d2c6140c [2021-01-06 19:45:13,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:45:13,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:45:13,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:45:13,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:45:13,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:45:13,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:45:13" (1/1) ... [2021-01-06 19:45:13,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4b7230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:13, skipping insertion in model container [2021-01-06 19:45:13,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:45:13" (1/1) ... [2021-01-06 19:45:13,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:45:13,488 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,] [2021-01-06 19:45:13,896 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] [2021-01-06 19:45:13,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:45:13,912 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,] [2021-01-06 19:45:13,978 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] [2021-01-06 19:45:13,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:45:14,000 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:45:14,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14 WrapperNode [2021-01-06 19:45:14,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:45:14,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:45:14,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:45:14,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:45:14,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:45:14,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:45:14,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:45:14,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:45:14,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (1/1) ... [2021-01-06 19:45:14,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:45:14,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:45:14,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:45:14,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:45:14,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (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 [2021-01-06 19:45:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:45:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:45:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:45:14,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:45:15,119 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:45:15,120 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-01-06 19:45:15,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:45:15 BoogieIcfgContainer [2021-01-06 19:45:15,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:45:15,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:45:15,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:45:15,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:45:15,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:45:13" (1/3) ... [2021-01-06 19:45:15,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f95eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:45:15, skipping insertion in model container [2021-01-06 19:45:15,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:45:14" (2/3) ... [2021-01-06 19:45:15,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f95eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:45:15, skipping insertion in model container [2021-01-06 19:45:15,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:45:15" (3/3) ... [2021-01-06 19:45:15,134 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:45:15,142 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:45:15,148 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:45:15,172 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:45:15,221 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:45:15,221 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:45:15,221 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:45:15,221 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:45:15,221 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:45:15,222 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:45:15,222 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:45:15,222 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:45:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2021-01-06 19:45:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 19:45:15,252 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:15,253 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] [2021-01-06 19:45:15,253 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1522683097, now seen corresponding path program 1 times [2021-01-06 19:45:15,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:15,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361719811] [2021-01-06 19:45:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:15,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361719811] [2021-01-06 19:45:15,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:15,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:45:15,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543070889] [2021-01-06 19:45:15,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:45:15,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:45:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:45:15,544 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2021-01-06 19:45:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:15,589 INFO L93 Difference]: Finished difference Result 205 states and 341 transitions. [2021-01-06 19:45:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:45:15,591 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2021-01-06 19:45:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:15,614 INFO L225 Difference]: With dead ends: 205 [2021-01-06 19:45:15,614 INFO L226 Difference]: Without dead ends: 119 [2021-01-06 19:45:15,618 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 [2021-01-06 19:45:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-01-06 19:45:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-01-06 19:45:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2021-01-06 19:45:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 200 transitions. [2021-01-06 19:45:15,700 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 200 transitions. Word has length 34 [2021-01-06 19:45:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:15,701 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 200 transitions. [2021-01-06 19:45:15,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:45:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 200 transitions. [2021-01-06 19:45:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 19:45:15,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:15,708 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] [2021-01-06 19:45:15,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:45:15,709 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:15,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash -136479703, now seen corresponding path program 1 times [2021-01-06 19:45:15,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:15,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482487605] [2021-01-06 19:45:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:15,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482487605] [2021-01-06 19:45:15,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:15,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:45:15,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798438192] [2021-01-06 19:45:15,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:45:15,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:45:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:45:15,936 INFO L87 Difference]: Start difference. First operand 119 states and 200 transitions. Second operand 5 states. [2021-01-06 19:45:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:16,055 INFO L93 Difference]: Finished difference Result 204 states and 334 transitions. [2021-01-06 19:45:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:45:16,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2021-01-06 19:45:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:16,058 INFO L225 Difference]: With dead ends: 204 [2021-01-06 19:45:16,058 INFO L226 Difference]: Without dead ends: 119 [2021-01-06 19:45:16,060 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 [2021-01-06 19:45:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-01-06 19:45:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-01-06 19:45:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2021-01-06 19:45:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2021-01-06 19:45:16,071 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 34 [2021-01-06 19:45:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:16,071 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2021-01-06 19:45:16,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:45:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2021-01-06 19:45:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:45:16,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:16,075 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] [2021-01-06 19:45:16,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:45:16,075 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash 958823668, now seen corresponding path program 1 times [2021-01-06 19:45:16,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:16,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895096123] [2021-01-06 19:45:16,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:16,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895096123] [2021-01-06 19:45:16,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:16,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:45:16,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834890066] [2021-01-06 19:45:16,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:45:16,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:45:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:45:16,292 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand 3 states. [2021-01-06 19:45:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:16,356 INFO L93 Difference]: Finished difference Result 269 states and 408 transitions. [2021-01-06 19:45:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:45:16,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:45:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:16,366 INFO L225 Difference]: With dead ends: 269 [2021-01-06 19:45:16,366 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 19:45:16,368 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 [2021-01-06 19:45:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 19:45:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-01-06 19:45:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-06 19:45:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 276 transitions. [2021-01-06 19:45:16,405 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 276 transitions. Word has length 65 [2021-01-06 19:45:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:16,406 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 276 transitions. [2021-01-06 19:45:16,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:45:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 276 transitions. [2021-01-06 19:45:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:45:16,410 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:16,410 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] [2021-01-06 19:45:16,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:45:16,411 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1904004827, now seen corresponding path program 1 times [2021-01-06 19:45:16,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:16,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25127829] [2021-01-06 19:45:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:16,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25127829] [2021-01-06 19:45:16,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:16,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:45:16,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024038587] [2021-01-06 19:45:16,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:45:16,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:45:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:45:16,623 INFO L87 Difference]: Start difference. First operand 186 states and 276 transitions. Second operand 3 states. [2021-01-06 19:45:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:16,663 INFO L93 Difference]: Finished difference Result 458 states and 712 transitions. [2021-01-06 19:45:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:45:16,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:45:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:16,669 INFO L225 Difference]: With dead ends: 458 [2021-01-06 19:45:16,669 INFO L226 Difference]: Without dead ends: 310 [2021-01-06 19:45:16,674 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 [2021-01-06 19:45:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-01-06 19:45:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2021-01-06 19:45:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2021-01-06 19:45:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 471 transitions. [2021-01-06 19:45:16,703 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 471 transitions. Word has length 66 [2021-01-06 19:45:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:16,703 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 471 transitions. [2021-01-06 19:45:16,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:45:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 471 transitions. [2021-01-06 19:45:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:45:16,705 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:16,705 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] [2021-01-06 19:45:16,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:45:16,706 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1896694372, now seen corresponding path program 1 times [2021-01-06 19:45:16,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:16,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301476633] [2021-01-06 19:45:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:16,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301476633] [2021-01-06 19:45:16,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:16,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:45:16,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507045459] [2021-01-06 19:45:16,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:45:16,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:45:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:45:16,784 INFO L87 Difference]: Start difference. First operand 308 states and 471 transitions. Second operand 3 states. [2021-01-06 19:45:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:16,819 INFO L93 Difference]: Finished difference Result 800 states and 1257 transitions. [2021-01-06 19:45:16,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:45:16,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:45:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:16,824 INFO L225 Difference]: With dead ends: 800 [2021-01-06 19:45:16,824 INFO L226 Difference]: Without dead ends: 530 [2021-01-06 19:45:16,828 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 [2021-01-06 19:45:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-01-06 19:45:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2021-01-06 19:45:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2021-01-06 19:45:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 819 transitions. [2021-01-06 19:45:16,855 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 819 transitions. Word has length 67 [2021-01-06 19:45:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:16,856 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 819 transitions. [2021-01-06 19:45:16,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:45:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 819 transitions. [2021-01-06 19:45:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:45:16,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:16,858 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] [2021-01-06 19:45:16,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:45:16,858 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:16,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1528655733, now seen corresponding path program 1 times [2021-01-06 19:45:16,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:16,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442982882] [2021-01-06 19:45:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:16,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442982882] [2021-01-06 19:45:16,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:16,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:45:16,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809028328] [2021-01-06 19:45:16,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:45:16,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:16,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:45:16,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:45:16,955 INFO L87 Difference]: Start difference. First operand 528 states and 819 transitions. Second operand 3 states. [2021-01-06 19:45:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:17,006 INFO L93 Difference]: Finished difference Result 1412 states and 2221 transitions. [2021-01-06 19:45:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:45:17,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 19:45:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:17,013 INFO L225 Difference]: With dead ends: 1412 [2021-01-06 19:45:17,014 INFO L226 Difference]: Without dead ends: 922 [2021-01-06 19:45:17,015 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 [2021-01-06 19:45:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-01-06 19:45:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 920. [2021-01-06 19:45:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2021-01-06 19:45:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1431 transitions. [2021-01-06 19:45:17,054 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1431 transitions. Word has length 68 [2021-01-06 19:45:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:17,054 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1431 transitions. [2021-01-06 19:45:17,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:45:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1431 transitions. [2021-01-06 19:45:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:45:17,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:17,056 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] [2021-01-06 19:45:17,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:45:17,057 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:17,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash -571662380, now seen corresponding path program 1 times [2021-01-06 19:45:17,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:17,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236187943] [2021-01-06 19:45:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:17,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236187943] [2021-01-06 19:45:17,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:17,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:45:17,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522130517] [2021-01-06 19:45:17,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:45:17,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:45:17,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:45:17,300 INFO L87 Difference]: Start difference. First operand 920 states and 1431 transitions. Second operand 7 states. [2021-01-06 19:45:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:17,555 INFO L93 Difference]: Finished difference Result 4866 states and 7596 transitions. [2021-01-06 19:45:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:45:17,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2021-01-06 19:45:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:17,578 INFO L225 Difference]: With dead ends: 4866 [2021-01-06 19:45:17,578 INFO L226 Difference]: Without dead ends: 3984 [2021-01-06 19:45:17,581 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 [2021-01-06 19:45:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2021-01-06 19:45:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3976. [2021-01-06 19:45:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2021-01-06 19:45:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 6183 transitions. [2021-01-06 19:45:17,777 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 6183 transitions. Word has length 69 [2021-01-06 19:45:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:17,778 INFO L481 AbstractCegarLoop]: Abstraction has 3976 states and 6183 transitions. [2021-01-06 19:45:17,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:45:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 6183 transitions. [2021-01-06 19:45:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:45:17,779 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:17,780 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] [2021-01-06 19:45:17,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:45:17,780 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash -238588952, now seen corresponding path program 1 times [2021-01-06 19:45:17,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:17,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511325409] [2021-01-06 19:45:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:17,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511325409] [2021-01-06 19:45:17,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:17,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:45:17,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718018338] [2021-01-06 19:45:17,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:45:17,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:45:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:45:17,836 INFO L87 Difference]: Start difference. First operand 3976 states and 6183 transitions. Second operand 3 states. [2021-01-06 19:45:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:18,148 INFO L93 Difference]: Finished difference Result 10780 states and 16713 transitions. [2021-01-06 19:45:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:45:18,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 19:45:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:18,186 INFO L225 Difference]: With dead ends: 10780 [2021-01-06 19:45:18,186 INFO L226 Difference]: Without dead ends: 6842 [2021-01-06 19:45:18,192 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 [2021-01-06 19:45:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6842 states. [2021-01-06 19:45:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6842 to 6840. [2021-01-06 19:45:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2021-01-06 19:45:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 10487 transitions. [2021-01-06 19:45:18,621 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 10487 transitions. Word has length 70 [2021-01-06 19:45:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:18,621 INFO L481 AbstractCegarLoop]: Abstraction has 6840 states and 10487 transitions. [2021-01-06 19:45:18,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:45:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 10487 transitions. [2021-01-06 19:45:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:45:18,623 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:18,623 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] [2021-01-06 19:45:18,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:45:18,624 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -965246768, now seen corresponding path program 1 times [2021-01-06 19:45:18,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:18,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292013701] [2021-01-06 19:45:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:18,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292013701] [2021-01-06 19:45:18,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:18,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:45:18,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309962332] [2021-01-06 19:45:18,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:45:18,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:18,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:45:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:45:18,750 INFO L87 Difference]: Start difference. First operand 6840 states and 10487 transitions. Second operand 7 states. [2021-01-06 19:45:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:20,038 INFO L93 Difference]: Finished difference Result 34692 states and 53341 transitions. [2021-01-06 19:45:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:45:20,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2021-01-06 19:45:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:20,159 INFO L225 Difference]: With dead ends: 34692 [2021-01-06 19:45:20,159 INFO L226 Difference]: Without dead ends: 27890 [2021-01-06 19:45:20,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:45:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27890 states. [2021-01-06 19:45:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27890 to 13640. [2021-01-06 19:45:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13640 states. [2021-01-06 19:45:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13640 states to 13640 states and 20615 transitions. [2021-01-06 19:45:21,288 INFO L78 Accepts]: Start accepts. Automaton has 13640 states and 20615 transitions. Word has length 70 [2021-01-06 19:45:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:21,289 INFO L481 AbstractCegarLoop]: Abstraction has 13640 states and 20615 transitions. [2021-01-06 19:45:21,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:45:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 13640 states and 20615 transitions. [2021-01-06 19:45:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:45:21,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:21,291 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] [2021-01-06 19:45:21,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:45:21,291 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash -241201943, now seen corresponding path program 1 times [2021-01-06 19:45:21,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:21,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474271382] [2021-01-06 19:45:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:21,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474271382] [2021-01-06 19:45:21,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:21,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:45:21,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5569755] [2021-01-06 19:45:21,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:45:21,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:45:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:45:21,418 INFO L87 Difference]: Start difference. First operand 13640 states and 20615 transitions. Second operand 8 states. [2021-01-06 19:45:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:23,026 INFO L93 Difference]: Finished difference Result 28522 states and 42472 transitions. [2021-01-06 19:45:23,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:45:23,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2021-01-06 19:45:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:23,098 INFO L225 Difference]: With dead ends: 28522 [2021-01-06 19:45:23,098 INFO L226 Difference]: Without dead ends: 28520 [2021-01-06 19:45:23,107 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 [2021-01-06 19:45:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28520 states. [2021-01-06 19:45:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28520 to 14600. [2021-01-06 19:45:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2021-01-06 19:45:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 21575 transitions. [2021-01-06 19:45:24,483 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 21575 transitions. Word has length 71 [2021-01-06 19:45:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:24,486 INFO L481 AbstractCegarLoop]: Abstraction has 14600 states and 21575 transitions. [2021-01-06 19:45:24,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:45:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 21575 transitions. [2021-01-06 19:45:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:45:24,487 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:24,488 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] [2021-01-06 19:45:24,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:45:24,488 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1165253064, now seen corresponding path program 1 times [2021-01-06 19:45:24,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:24,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360810191] [2021-01-06 19:45:24,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:24,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360810191] [2021-01-06 19:45:24,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:24,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:45:24,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832813023] [2021-01-06 19:45:24,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:45:24,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:45:24,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:45:24,613 INFO L87 Difference]: Start difference. First operand 14600 states and 21575 transitions. Second operand 3 states. [2021-01-06 19:45:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:25,609 INFO L93 Difference]: Finished difference Result 35662 states and 52763 transitions. [2021-01-06 19:45:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:45:25,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:45:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:25,664 INFO L225 Difference]: With dead ends: 35662 [2021-01-06 19:45:25,664 INFO L226 Difference]: Without dead ends: 21100 [2021-01-06 19:45:25,694 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 [2021-01-06 19:45:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21100 states. [2021-01-06 19:45:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21100 to 20954. [2021-01-06 19:45:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20954 states. [2021-01-06 19:45:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 30793 transitions. [2021-01-06 19:45:26,908 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 30793 transitions. Word has length 72 [2021-01-06 19:45:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:26,909 INFO L481 AbstractCegarLoop]: Abstraction has 20954 states and 30793 transitions. [2021-01-06 19:45:26,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:45:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 30793 transitions. [2021-01-06 19:45:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:45:26,922 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:26,923 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] [2021-01-06 19:45:26,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:45:26,923 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:26,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash -396516070, now seen corresponding path program 1 times [2021-01-06 19:45:26,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:26,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143960185] [2021-01-06 19:45:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:27,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143960185] [2021-01-06 19:45:27,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064825465] [2021-01-06 19:45:27,229 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 [2021-01-06 19:45:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:27,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 19:45:27,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:45:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:45:27,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:45:27,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2021-01-06 19:45:27,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524673386] [2021-01-06 19:45:27,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 19:45:27,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:27,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 19:45:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:45:27,691 INFO L87 Difference]: Start difference. First operand 20954 states and 30793 transitions. Second operand 12 states. [2021-01-06 19:45:29,185 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-01-06 19:45:33,888 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-01-06 19:45:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:39,893 INFO L93 Difference]: Finished difference Result 164018 states and 239259 transitions. [2021-01-06 19:45:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-01-06 19:45:39,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2021-01-06 19:45:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:40,614 INFO L225 Difference]: With dead ends: 164018 [2021-01-06 19:45:40,614 INFO L226 Difference]: Without dead ends: 143696 [2021-01-06 19:45:40,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=797, Invalid=3109, Unknown=0, NotChecked=0, Total=3906 [2021-01-06 19:45:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143696 states. [2021-01-06 19:45:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143696 to 80658. [2021-01-06 19:45:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80658 states. [2021-01-06 19:45:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80658 states to 80658 states and 117317 transitions. [2021-01-06 19:45:46,438 INFO L78 Accepts]: Start accepts. Automaton has 80658 states and 117317 transitions. Word has length 100 [2021-01-06 19:45:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:45:46,439 INFO L481 AbstractCegarLoop]: Abstraction has 80658 states and 117317 transitions. [2021-01-06 19:45:46,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 19:45:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 80658 states and 117317 transitions. [2021-01-06 19:45:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:45:46,469 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:45:46,470 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] [2021-01-06 19:45:46,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 19:45:46,672 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:45:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:45:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1964197035, now seen corresponding path program 1 times [2021-01-06 19:45:46,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:45:46,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772426254] [2021-01-06 19:45:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:45:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:45:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:45:46,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772426254] [2021-01-06 19:45:46,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:45:46,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:45:46,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89856781] [2021-01-06 19:45:46,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:45:46,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:45:46,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:45:46,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:45:46,752 INFO L87 Difference]: Start difference. First operand 80658 states and 117317 transitions. Second operand 3 states. [2021-01-06 19:45:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:45:52,939 INFO L93 Difference]: Finished difference Result 174118 states and 253419 transitions. [2021-01-06 19:45:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:45:52,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:45:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:45:53,122 INFO L225 Difference]: With dead ends: 174118 [2021-01-06 19:45:53,122 INFO L226 Difference]: Without dead ends: 121040 [2021-01-06 19:45:53,186 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 [2021-01-06 19:45:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121040 states. [2021-01-06 19:45:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121040 to 115634. [2021-01-06 19:45:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115634 states. [2021-01-06 19:46:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115634 states to 115634 states and 166669 transitions. [2021-01-06 19:46:00,039 INFO L78 Accepts]: Start accepts. Automaton has 115634 states and 166669 transitions. Word has length 100 [2021-01-06 19:46:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:00,039 INFO L481 AbstractCegarLoop]: Abstraction has 115634 states and 166669 transitions. [2021-01-06 19:46:00,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 115634 states and 166669 transitions. [2021-01-06 19:46:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:46:00,066 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:00,066 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] [2021-01-06 19:46:00,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:46:00,067 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1432680103, now seen corresponding path program 1 times [2021-01-06 19:46:00,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:00,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227779691] [2021-01-06 19:46:00,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 19:46:00,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227779691] [2021-01-06 19:46:00,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:00,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:46:00,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048500823] [2021-01-06 19:46:00,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:46:00,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:00,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:46:00,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:46:00,162 INFO L87 Difference]: Start difference. First operand 115634 states and 166669 transitions. Second operand 6 states. [2021-01-06 19:46:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:09,348 INFO L93 Difference]: Finished difference Result 294463 states and 424938 transitions. [2021-01-06 19:46:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:46:09,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2021-01-06 19:46:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:09,666 INFO L225 Difference]: With dead ends: 294463 [2021-01-06 19:46:09,667 INFO L226 Difference]: Without dead ends: 178891 [2021-01-06 19:46:09,789 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 [2021-01-06 19:46:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178891 states. [2021-01-06 19:46:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178891 to 157445. [2021-01-06 19:46:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157445 states. [2021-01-06 19:46:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157445 states to 157445 states and 225325 transitions. [2021-01-06 19:46:18,940 INFO L78 Accepts]: Start accepts. Automaton has 157445 states and 225325 transitions. Word has length 100 [2021-01-06 19:46:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:18,940 INFO L481 AbstractCegarLoop]: Abstraction has 157445 states and 225325 transitions. [2021-01-06 19:46:18,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:46:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 157445 states and 225325 transitions. [2021-01-06 19:46:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:46:18,994 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:18,995 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] [2021-01-06 19:46:18,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:46:18,995 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1928312001, now seen corresponding path program 1 times [2021-01-06 19:46:18,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:18,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846156777] [2021-01-06 19:46:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:19,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846156777] [2021-01-06 19:46:19,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:19,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:19,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616773361] [2021-01-06 19:46:19,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:19,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:19,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:19,077 INFO L87 Difference]: Start difference. First operand 157445 states and 225325 transitions. Second operand 3 states. [2021-01-06 19:46:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:29,517 INFO L93 Difference]: Finished difference Result 357097 states and 510643 transitions. [2021-01-06 19:46:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:29,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:46:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:29,916 INFO L225 Difference]: With dead ends: 357097 [2021-01-06 19:46:29,917 INFO L226 Difference]: Without dead ends: 211267 [2021-01-06 19:46:30,027 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 [2021-01-06 19:46:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211267 states. [2021-01-06 19:46:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211267 to 173625. [2021-01-06 19:46:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173625 states. [2021-01-06 19:46:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173625 states to 173625 states and 245981 transitions. [2021-01-06 19:46:40,297 INFO L78 Accepts]: Start accepts. Automaton has 173625 states and 245981 transitions. Word has length 100 [2021-01-06 19:46:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:40,298 INFO L481 AbstractCegarLoop]: Abstraction has 173625 states and 245981 transitions. [2021-01-06 19:46:40,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 173625 states and 245981 transitions. [2021-01-06 19:46:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:46:40,321 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:40,322 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] [2021-01-06 19:46:40,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:46:40,322 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1906240849, now seen corresponding path program 1 times [2021-01-06 19:46:40,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:40,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040517527] [2021-01-06 19:46:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:46:40,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040517527] [2021-01-06 19:46:40,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:40,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:40,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77948430] [2021-01-06 19:46:40,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:40,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:40,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:40,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:40,476 INFO L87 Difference]: Start difference. First operand 173625 states and 245981 transitions. Second operand 7 states. [2021-01-06 19:47:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:00,263 INFO L93 Difference]: Finished difference Result 467877 states and 667459 transitions. [2021-01-06 19:47:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:47:00,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2021-01-06 19:47:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:01,217 INFO L225 Difference]: With dead ends: 467877 [2021-01-06 19:47:01,218 INFO L226 Difference]: Without dead ends: 394915 [2021-01-06 19:47:01,367 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 [2021-01-06 19:47:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394915 states. [2021-01-06 19:47:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394915 to 243705. [2021-01-06 19:47:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243705 states. [2021-01-06 19:47:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243705 states to 243705 states and 345161 transitions. [2021-01-06 19:47:17,494 INFO L78 Accepts]: Start accepts. Automaton has 243705 states and 345161 transitions. Word has length 100 [2021-01-06 19:47:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:17,494 INFO L481 AbstractCegarLoop]: Abstraction has 243705 states and 345161 transitions. [2021-01-06 19:47:17,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:47:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 243705 states and 345161 transitions. [2021-01-06 19:47:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:47:17,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:17,522 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] [2021-01-06 19:47:17,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:47:17,523 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:17,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 425782753, now seen corresponding path program 1 times [2021-01-06 19:47:17,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:17,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372800469] [2021-01-06 19:47:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:17,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372800469] [2021-01-06 19:47:17,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:17,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:17,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081398573] [2021-01-06 19:47:17,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:17,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:17,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:17,588 INFO L87 Difference]: Start difference. First operand 243705 states and 345161 transitions. Second operand 3 states. [2021-01-06 19:47:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:36,775 INFO L93 Difference]: Finished difference Result 521662 states and 735932 transitions. [2021-01-06 19:47:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:36,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:47:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:37,615 INFO L225 Difference]: With dead ends: 521662 [2021-01-06 19:47:37,615 INFO L226 Difference]: Without dead ends: 350204 [2021-01-06 19:47:37,820 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 [2021-01-06 19:47:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350204 states. [2021-01-06 19:48:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350204 to 332970. [2021-01-06 19:48:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332970 states. [2021-01-06 19:48:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332970 states to 332970 states and 465884 transitions. [2021-01-06 19:48:01,689 INFO L78 Accepts]: Start accepts. Automaton has 332970 states and 465884 transitions. Word has length 100 [2021-01-06 19:48:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:48:01,691 INFO L481 AbstractCegarLoop]: Abstraction has 332970 states and 465884 transitions. [2021-01-06 19:48:01,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:48:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 332970 states and 465884 transitions. [2021-01-06 19:48:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:48:01,719 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:48:01,720 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] [2021-01-06 19:48:01,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:48:01,720 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:48:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:48:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 853128817, now seen corresponding path program 1 times [2021-01-06 19:48:01,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:48:01,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869990822] [2021-01-06 19:48:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:48:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:48:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:48:01,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869990822] [2021-01-06 19:48:01,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:48:01,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:48:01,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048660894] [2021-01-06 19:48:01,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:48:01,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:48:01,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:48:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:48:01,807 INFO L87 Difference]: Start difference. First operand 332970 states and 465884 transitions. Second operand 3 states. [2021-01-06 19:48:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:48:24,274 INFO L93 Difference]: Finished difference Result 555969 states and 773345 transitions. [2021-01-06 19:48:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:48:24,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:48:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:48:25,203 INFO L225 Difference]: With dead ends: 555969 [2021-01-06 19:48:25,203 INFO L226 Difference]: Without dead ends: 346109 [2021-01-06 19:48:25,460 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 [2021-01-06 19:48:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346109 states. [2021-01-06 19:48:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346109 to 332500. [2021-01-06 19:48:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332500 states. [2021-01-06 19:48:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332500 states to 332500 states and 458560 transitions. [2021-01-06 19:48:46,972 INFO L78 Accepts]: Start accepts. Automaton has 332500 states and 458560 transitions. Word has length 100 [2021-01-06 19:48:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:48:46,973 INFO L481 AbstractCegarLoop]: Abstraction has 332500 states and 458560 transitions. [2021-01-06 19:48:46,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:48:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 332500 states and 458560 transitions. [2021-01-06 19:48:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:48:47,038 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:48:47,038 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] [2021-01-06 19:48:47,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:48:47,038 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:48:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:48:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash -681189839, now seen corresponding path program 1 times [2021-01-06 19:48:47,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:48:47,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899207570] [2021-01-06 19:48:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:48:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:48:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:48:47,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899207570] [2021-01-06 19:48:47,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:48:47,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:48:47,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107594030] [2021-01-06 19:48:47,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:48:47,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:48:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:48:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:48:47,195 INFO L87 Difference]: Start difference. First operand 332500 states and 458560 transitions. Second operand 7 states.