/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.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:46:15,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:46:15,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:46:15,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:46:15,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:46:15,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:46:15,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:46:15,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:46:15,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:46:15,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:46:15,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:46:15,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:46:15,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:46:15,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:46:15,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:46:15,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:46:15,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:46:15,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:46:15,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:46:15,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:46:15,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:46:15,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:46:15,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:46:15,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:46:15,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:46:15,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:46:15,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:46:15,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:46:15,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:46:15,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:46:15,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:46:15,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:46:15,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:46:15,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:46:15,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:46:15,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:46:15,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:46:15,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:46:15,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:46:15,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:46:15,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:46:15,867 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:46:15,935 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:46:15,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:46:15,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:46:15,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:46:15,946 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:46:15,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:46:15,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:46:15,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:46:15,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:46:15,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:46:15,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:46:15,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:46:15,950 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:46:15,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:46:15,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:46:15,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:46:15,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:46:15,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:46:15,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:46:15,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:46:15,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:46:15,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:46:15,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:46:15,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:46:15,954 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:46:15,954 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:46:16,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:46:16,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:46:16,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:46:16,601 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:46:16,604 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:46:16,606 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.ufo.BOUNDED-10.pals.c [2021-01-06 19:46:16,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7c990a9cf/aedc88a34df54538baba786ec6dec166/FLAG3158322d8 [2021-01-06 19:46:17,495 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:46:17,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2021-01-06 19:46:17,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7c990a9cf/aedc88a34df54538baba786ec6dec166/FLAG3158322d8 [2021-01-06 19:46:17,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7c990a9cf/aedc88a34df54538baba786ec6dec166 [2021-01-06 19:46:17,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:46:17,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:46:17,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:17,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:46:17,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:46:17,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:17" (1/1) ... [2021-01-06 19:46:17,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235321b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:17, skipping insertion in model container [2021-01-06 19:46:17,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:17" (1/1) ... [2021-01-06 19:46:17,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:46:17,890 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[~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[~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:46:18,229 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.ufo.BOUNDED-10.pals.c[12751,12764] [2021-01-06 19:46:18,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:18,267 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[~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[~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:46:18,445 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.ufo.BOUNDED-10.pals.c[12751,12764] [2021-01-06 19:46:18,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:18,472 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:46:18,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18 WrapperNode [2021-01-06 19:46:18,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:18,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:18,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:46:18,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:46:18,488 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:46:18" (1/1) ... [2021-01-06 19:46:18,505 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:46:18" (1/1) ... [2021-01-06 19:46:18,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:18,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:46:18,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:46:18,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:46:18,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (1/1) ... [2021-01-06 19:46:18,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (1/1) ... [2021-01-06 19:46:18,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (1/1) ... [2021-01-06 19:46:18,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (1/1) ... [2021-01-06 19:46:18,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (1/1) ... [2021-01-06 19:46:18,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (1/1) ... [2021-01-06 19:46:18,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (1/1) ... [2021-01-06 19:46:18,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:46:18,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:46:18,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:46:18,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:46:18,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (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:46:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:46:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:46:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:46:18,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:46:20,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:46:20,097 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-01-06 19:46:20,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:20 BoogieIcfgContainer [2021-01-06 19:46:20,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:46:20,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:46:20,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:46:20,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:46:20,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:46:17" (1/3) ... [2021-01-06 19:46:20,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d100f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:20, skipping insertion in model container [2021-01-06 19:46:20,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:18" (2/3) ... [2021-01-06 19:46:20,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d100f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:20, skipping insertion in model container [2021-01-06 19:46:20,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:20" (3/3) ... [2021-01-06 19:46:20,122 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2021-01-06 19:46:20,131 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:46:20,138 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:46:20,165 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:46:20,205 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:46:20,205 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:46:20,205 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:46:20,206 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:46:20,206 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:46:20,206 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:46:20,207 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:46:20,207 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:46:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2021-01-06 19:46:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:46:20,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:20,245 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] [2021-01-06 19:46:20,246 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:20,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash 563549969, now seen corresponding path program 1 times [2021-01-06 19:46:20,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:20,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753244749] [2021-01-06 19:46:20,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:20,634 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:46:20,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753244749] [2021-01-06 19:46:20,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:20,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:46:20,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808601804] [2021-01-06 19:46:20,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:46:20,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:20,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:46:20,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:46:20,669 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 2 states. [2021-01-06 19:46:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:20,710 INFO L93 Difference]: Finished difference Result 207 states and 340 transitions. [2021-01-06 19:46:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:46:20,712 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2021-01-06 19:46:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:20,730 INFO L225 Difference]: With dead ends: 207 [2021-01-06 19:46:20,731 INFO L226 Difference]: Without dead ends: 118 [2021-01-06 19:46:20,737 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:46:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-06 19:46:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-01-06 19:46:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-01-06 19:46:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 198 transitions. [2021-01-06 19:46:20,809 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 198 transitions. Word has length 33 [2021-01-06 19:46:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:20,810 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 198 transitions. [2021-01-06 19:46:20,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:46:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 198 transitions. [2021-01-06 19:46:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:46:20,813 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:20,813 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] [2021-01-06 19:46:20,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:46:20,815 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 54076879, now seen corresponding path program 1 times [2021-01-06 19:46:20,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:20,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659413411] [2021-01-06 19:46:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:21,010 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:46:21,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659413411] [2021-01-06 19:46:21,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:21,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:46:21,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245800509] [2021-01-06 19:46:21,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:46:21,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:21,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:46:21,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:46:21,016 INFO L87 Difference]: Start difference. First operand 118 states and 198 transitions. Second operand 5 states. [2021-01-06 19:46:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:21,210 INFO L93 Difference]: Finished difference Result 202 states and 330 transitions. [2021-01-06 19:46:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:46:21,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2021-01-06 19:46:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:21,214 INFO L225 Difference]: With dead ends: 202 [2021-01-06 19:46:21,215 INFO L226 Difference]: Without dead ends: 118 [2021-01-06 19:46:21,219 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:46:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-06 19:46:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-01-06 19:46:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-01-06 19:46:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2021-01-06 19:46:21,242 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 33 [2021-01-06 19:46:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:21,243 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2021-01-06 19:46:21,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:46:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2021-01-06 19:46:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:46:21,251 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:21,251 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] [2021-01-06 19:46:21,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:46:21,252 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:21,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1850253404, now seen corresponding path program 1 times [2021-01-06 19:46:21,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:21,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80198721] [2021-01-06 19:46:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:21,461 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:46:21,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80198721] [2021-01-06 19:46:21,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:21,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:21,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95596367] [2021-01-06 19:46:21,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:21,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:21,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:21,472 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand 3 states. [2021-01-06 19:46:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:21,562 INFO L93 Difference]: Finished difference Result 266 states and 402 transitions. [2021-01-06 19:46:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:21,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 19:46:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:21,571 INFO L225 Difference]: With dead ends: 266 [2021-01-06 19:46:21,572 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 19:46:21,573 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:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 19:46:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2021-01-06 19:46:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2021-01-06 19:46:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 272 transitions. [2021-01-06 19:46:21,601 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 272 transitions. Word has length 64 [2021-01-06 19:46:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:21,604 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 272 transitions. [2021-01-06 19:46:21,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 272 transitions. [2021-01-06 19:46:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:46:21,608 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:21,611 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:46:21,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:46:21,612 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:21,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1736606100, now seen corresponding path program 1 times [2021-01-06 19:46:21,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:21,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203717406] [2021-01-06 19:46:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:21,794 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:46:21,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203717406] [2021-01-06 19:46:21,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:21,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:21,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806933773] [2021-01-06 19:46:21,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:21,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:21,798 INFO L87 Difference]: Start difference. First operand 184 states and 272 transitions. Second operand 3 states. [2021-01-06 19:46:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:21,834 INFO L93 Difference]: Finished difference Result 452 states and 700 transitions. [2021-01-06 19:46:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:21,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:46:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:21,838 INFO L225 Difference]: With dead ends: 452 [2021-01-06 19:46:21,839 INFO L226 Difference]: Without dead ends: 306 [2021-01-06 19:46:21,840 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:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-01-06 19:46:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2021-01-06 19:46:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2021-01-06 19:46:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 463 transitions. [2021-01-06 19:46:21,868 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 463 transitions. Word has length 65 [2021-01-06 19:46:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:21,869 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 463 transitions. [2021-01-06 19:46:21,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 463 transitions. [2021-01-06 19:46:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:46:21,871 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:21,871 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:46:21,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:46:21,871 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash 245456436, now seen corresponding path program 1 times [2021-01-06 19:46:21,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:21,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046987580] [2021-01-06 19:46:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:22,045 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:46:22,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046987580] [2021-01-06 19:46:22,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:22,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:22,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236471410] [2021-01-06 19:46:22,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:22,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:22,049 INFO L87 Difference]: Start difference. First operand 304 states and 463 transitions. Second operand 3 states. [2021-01-06 19:46:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:22,092 INFO L93 Difference]: Finished difference Result 788 states and 1233 transitions. [2021-01-06 19:46:22,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:22,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:46:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:22,097 INFO L225 Difference]: With dead ends: 788 [2021-01-06 19:46:22,098 INFO L226 Difference]: Without dead ends: 522 [2021-01-06 19:46:22,101 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:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-01-06 19:46:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2021-01-06 19:46:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2021-01-06 19:46:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 803 transitions. [2021-01-06 19:46:22,140 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 803 transitions. Word has length 66 [2021-01-06 19:46:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:22,141 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 803 transitions. [2021-01-06 19:46:22,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 803 transitions. [2021-01-06 19:46:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:46:22,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:22,146 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:46:22,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:46:22,146 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:22,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2021301796, now seen corresponding path program 1 times [2021-01-06 19:46:22,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:22,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424951990] [2021-01-06 19:46:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:22,311 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:46:22,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424951990] [2021-01-06 19:46:22,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:22,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:22,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55063413] [2021-01-06 19:46:22,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:22,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:22,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:22,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:22,317 INFO L87 Difference]: Start difference. First operand 520 states and 803 transitions. Second operand 3 states. [2021-01-06 19:46:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:22,431 INFO L93 Difference]: Finished difference Result 1388 states and 2173 transitions. [2021-01-06 19:46:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:22,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:46:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:22,440 INFO L225 Difference]: With dead ends: 1388 [2021-01-06 19:46:22,440 INFO L226 Difference]: Without dead ends: 906 [2021-01-06 19:46:22,442 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:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-01-06 19:46:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2021-01-06 19:46:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2021-01-06 19:46:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1399 transitions. [2021-01-06 19:46:22,496 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1399 transitions. Word has length 67 [2021-01-06 19:46:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:22,497 INFO L481 AbstractCegarLoop]: Abstraction has 904 states and 1399 transitions. [2021-01-06 19:46:22,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1399 transitions. [2021-01-06 19:46:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:46:22,499 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:22,500 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:46:22,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:46:22,500 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1960792892, now seen corresponding path program 1 times [2021-01-06 19:46:22,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:22,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052734596] [2021-01-06 19:46:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:22,614 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:46:22,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052734596] [2021-01-06 19:46:22,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:22,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:22,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933030750] [2021-01-06 19:46:22,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:22,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:22,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:22,622 INFO L87 Difference]: Start difference. First operand 904 states and 1399 transitions. Second operand 3 states. [2021-01-06 19:46:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:22,695 INFO L93 Difference]: Finished difference Result 2444 states and 3801 transitions. [2021-01-06 19:46:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:22,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 19:46:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:22,708 INFO L225 Difference]: With dead ends: 2444 [2021-01-06 19:46:22,709 INFO L226 Difference]: Without dead ends: 1578 [2021-01-06 19:46:22,711 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:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2021-01-06 19:46:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1576. [2021-01-06 19:46:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2021-01-06 19:46:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2423 transitions. [2021-01-06 19:46:22,786 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2423 transitions. Word has length 68 [2021-01-06 19:46:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:22,787 INFO L481 AbstractCegarLoop]: Abstraction has 1576 states and 2423 transitions. [2021-01-06 19:46:22,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2423 transitions. [2021-01-06 19:46:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:46:22,788 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:22,788 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:46:22,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:46:22,788 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1083012428, now seen corresponding path program 1 times [2021-01-06 19:46:22,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:22,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264650911] [2021-01-06 19:46:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:23,025 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:46:23,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264650911] [2021-01-06 19:46:23,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:23,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:23,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034080498] [2021-01-06 19:46:23,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:23,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:23,029 INFO L87 Difference]: Start difference. First operand 1576 states and 2423 transitions. Second operand 7 states. [2021-01-06 19:46:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:23,451 INFO L93 Difference]: Finished difference Result 8386 states and 12828 transitions. [2021-01-06 19:46:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:46:23,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2021-01-06 19:46:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:23,496 INFO L225 Difference]: With dead ends: 8386 [2021-01-06 19:46:23,496 INFO L226 Difference]: Without dead ends: 6848 [2021-01-06 19:46:23,505 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:46:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2021-01-06 19:46:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 6840. [2021-01-06 19:46:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2021-01-06 19:46:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 10407 transitions. [2021-01-06 19:46:23,942 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 10407 transitions. Word has length 69 [2021-01-06 19:46:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:23,943 INFO L481 AbstractCegarLoop]: Abstraction has 6840 states and 10407 transitions. [2021-01-06 19:46:23,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 10407 transitions. [2021-01-06 19:46:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:46:23,947 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:23,947 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:46:23,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:46:23,948 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1552148145, now seen corresponding path program 1 times [2021-01-06 19:46:23,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:23,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425041104] [2021-01-06 19:46:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:24,245 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:46:24,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425041104] [2021-01-06 19:46:24,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:24,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:24,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255253592] [2021-01-06 19:46:24,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:24,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:24,257 INFO L87 Difference]: Start difference. First operand 6840 states and 10407 transitions. Second operand 7 states. [2021-01-06 19:46:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:26,087 INFO L93 Difference]: Finished difference Result 34692 states and 52941 transitions. [2021-01-06 19:46:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:46:26,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2021-01-06 19:46:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:26,252 INFO L225 Difference]: With dead ends: 34692 [2021-01-06 19:46:26,252 INFO L226 Difference]: Without dead ends: 27890 [2021-01-06 19:46:26,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:46:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27890 states. [2021-01-06 19:46:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27890 to 13640. [2021-01-06 19:46:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13640 states. [2021-01-06 19:46:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13640 states to 13640 states and 20455 transitions. [2021-01-06 19:46:27,419 INFO L78 Accepts]: Start accepts. Automaton has 13640 states and 20455 transitions. Word has length 70 [2021-01-06 19:46:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:27,419 INFO L481 AbstractCegarLoop]: Abstraction has 13640 states and 20455 transitions. [2021-01-06 19:46:27,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 13640 states and 20455 transitions. [2021-01-06 19:46:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:46:27,420 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:27,420 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:46:27,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:46:27,421 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:27,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1255275453, now seen corresponding path program 1 times [2021-01-06 19:46:27,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:27,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788544283] [2021-01-06 19:46:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:27,564 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:46:27,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788544283] [2021-01-06 19:46:27,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:27,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:27,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860226064] [2021-01-06 19:46:27,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:27,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:27,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:27,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:27,572 INFO L87 Difference]: Start difference. First operand 13640 states and 20455 transitions. Second operand 8 states. [2021-01-06 19:46:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:29,291 INFO L93 Difference]: Finished difference Result 28522 states and 42152 transitions. [2021-01-06 19:46:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:46:29,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2021-01-06 19:46:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:29,398 INFO L225 Difference]: With dead ends: 28522 [2021-01-06 19:46:29,399 INFO L226 Difference]: Without dead ends: 28520 [2021-01-06 19:46:29,413 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:46:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28520 states. [2021-01-06 19:46:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28520 to 14600. [2021-01-06 19:46:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2021-01-06 19:46:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 21415 transitions. [2021-01-06 19:46:30,697 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 21415 transitions. Word has length 71 [2021-01-06 19:46:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:30,697 INFO L481 AbstractCegarLoop]: Abstraction has 14600 states and 21415 transitions. [2021-01-06 19:46:30,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 21415 transitions. [2021-01-06 19:46:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:46:30,699 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:30,700 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:46:30,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:46:30,700 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash -206254681, now seen corresponding path program 1 times [2021-01-06 19:46:30,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:30,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835984217] [2021-01-06 19:46:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:30,764 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:46:30,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835984217] [2021-01-06 19:46:30,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:30,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:30,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763137688] [2021-01-06 19:46:30,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:30,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:30,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:30,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:30,767 INFO L87 Difference]: Start difference. First operand 14600 states and 21415 transitions. Second operand 3 states. [2021-01-06 19:46:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:31,924 INFO L93 Difference]: Finished difference Result 35518 states and 52155 transitions. [2021-01-06 19:46:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:31,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:46:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:31,995 INFO L225 Difference]: With dead ends: 35518 [2021-01-06 19:46:31,996 INFO L226 Difference]: Without dead ends: 20956 [2021-01-06 19:46:32,024 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:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20956 states. [2021-01-06 19:46:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20956 to 20954. [2021-01-06 19:46:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20954 states. [2021-01-06 19:46:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 30633 transitions. [2021-01-06 19:46:33,615 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 30633 transitions. Word has length 72 [2021-01-06 19:46:33,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:33,615 INFO L481 AbstractCegarLoop]: Abstraction has 20954 states and 30633 transitions. [2021-01-06 19:46:33,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 30633 transitions. [2021-01-06 19:46:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 19:46:33,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:33,633 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] [2021-01-06 19:46:33,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:46:33,634 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1745394696, now seen corresponding path program 1 times [2021-01-06 19:46:33,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:33,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026897138] [2021-01-06 19:46:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:33,807 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:46:33,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026897138] [2021-01-06 19:46:33,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410876234] [2021-01-06 19:46:33,808 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:46:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:34,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-06 19:46:34,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:46:34,310 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:46:34,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:46:34,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2021-01-06 19:46:34,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465481276] [2021-01-06 19:46:34,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:34,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:34,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:34,315 INFO L87 Difference]: Start difference. First operand 20954 states and 30633 transitions. Second operand 7 states. [2021-01-06 19:46:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:36,472 INFO L93 Difference]: Finished difference Result 51799 states and 76018 transitions. [2021-01-06 19:46:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:46:36,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2021-01-06 19:46:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:36,554 INFO L225 Difference]: With dead ends: 51799 [2021-01-06 19:46:36,555 INFO L226 Difference]: Without dead ends: 37237 [2021-01-06 19:46:36,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37237 states. [2021-01-06 19:46:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37237 to 34650. [2021-01-06 19:46:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34650 states. [2021-01-06 19:46:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34650 states to 34650 states and 50441 transitions. [2021-01-06 19:46:38,527 INFO L78 Accepts]: Start accepts. Automaton has 34650 states and 50441 transitions. Word has length 99 [2021-01-06 19:46:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:38,527 INFO L481 AbstractCegarLoop]: Abstraction has 34650 states and 50441 transitions. [2021-01-06 19:46:38,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 34650 states and 50441 transitions. [2021-01-06 19:46:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:46:38,541 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:38,541 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:38,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 19:46:38,757 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:38,759 INFO L82 PathProgramCache]: Analyzing trace with hash -152615028, now seen corresponding path program 1 times [2021-01-06 19:46:38,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:38,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438891749] [2021-01-06 19:46:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:46:38,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438891749] [2021-01-06 19:46:38,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:38,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:38,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295718953] [2021-01-06 19:46:38,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:38,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:38,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:38,931 INFO L87 Difference]: Start difference. First operand 34650 states and 50441 transitions. Second operand 7 states. [2021-01-06 19:46:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:41,745 INFO L93 Difference]: Finished difference Result 80006 states and 117295 transitions. [2021-01-06 19:46:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:46:41,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2021-01-06 19:46:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:41,906 INFO L225 Difference]: With dead ends: 80006 [2021-01-06 19:46:41,907 INFO L226 Difference]: Without dead ends: 68628 [2021-01-06 19:46:41,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:46:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68628 states. [2021-01-06 19:46:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68628 to 45690. [2021-01-06 19:46:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45690 states. [2021-01-06 19:46:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45690 states to 45690 states and 66377 transitions. [2021-01-06 19:46:44,971 INFO L78 Accepts]: Start accepts. Automaton has 45690 states and 66377 transitions. Word has length 100 [2021-01-06 19:46:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:44,971 INFO L481 AbstractCegarLoop]: Abstraction has 45690 states and 66377 transitions. [2021-01-06 19:46:44,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 45690 states and 66377 transitions. [2021-01-06 19:46:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:46:44,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:44,985 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:44,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:46:44,985 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash 589805596, now seen corresponding path program 1 times [2021-01-06 19:46:44,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:44,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020249857] [2021-01-06 19:46:44,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:45,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020249857] [2021-01-06 19:46:45,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:45,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:45,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934610343] [2021-01-06 19:46:45,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:45,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:45,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:45,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:45,070 INFO L87 Difference]: Start difference. First operand 45690 states and 66377 transitions. Second operand 3 states. [2021-01-06 19:46:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:49,156 INFO L93 Difference]: Finished difference Result 117117 states and 170013 transitions. [2021-01-06 19:46:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:49,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:46:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:49,322 INFO L225 Difference]: With dead ends: 117117 [2021-01-06 19:46:49,323 INFO L226 Difference]: Without dead ends: 77051 [2021-01-06 19:46:49,372 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:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77051 states. [2021-01-06 19:46:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77051 to 74825. [2021-01-06 19:46:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74825 states. [2021-01-06 19:46:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74825 states to 74825 states and 107643 transitions. [2021-01-06 19:46:53,419 INFO L78 Accepts]: Start accepts. Automaton has 74825 states and 107643 transitions. Word has length 100 [2021-01-06 19:46:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:53,419 INFO L481 AbstractCegarLoop]: Abstraction has 74825 states and 107643 transitions. [2021-01-06 19:46:53,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 74825 states and 107643 transitions. [2021-01-06 19:46:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:46:53,442 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:53,443 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:53,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:46:53,443 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash -912723652, now seen corresponding path program 1 times [2021-01-06 19:46:53,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:53,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183453612] [2021-01-06 19:46:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:53,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183453612] [2021-01-06 19:46:53,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:53,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:53,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047877448] [2021-01-06 19:46:53,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:53,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:53,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:53,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:53,514 INFO L87 Difference]: Start difference. First operand 74825 states and 107643 transitions. Second operand 3 states. [2021-01-06 19:46:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:58,115 INFO L93 Difference]: Finished difference Result 144938 states and 208407 transitions. [2021-01-06 19:46:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:58,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:46:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:58,272 INFO L225 Difference]: With dead ends: 144938 [2021-01-06 19:46:58,272 INFO L226 Difference]: Without dead ends: 104648 [2021-01-06 19:46:58,329 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:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104648 states. [2021-01-06 19:47:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104648 to 96478. [2021-01-06 19:47:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96478 states. [2021-01-06 19:47:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96478 states to 96478 states and 137349 transitions. [2021-01-06 19:47:03,608 INFO L78 Accepts]: Start accepts. Automaton has 96478 states and 137349 transitions. Word has length 100 [2021-01-06 19:47:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:03,608 INFO L481 AbstractCegarLoop]: Abstraction has 96478 states and 137349 transitions. [2021-01-06 19:47:03,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 96478 states and 137349 transitions. [2021-01-06 19:47:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:47:03,628 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:03,628 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:03,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:47:03,628 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash -485377588, now seen corresponding path program 1 times [2021-01-06 19:47:03,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:03,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637697250] [2021-01-06 19:47:03,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:03,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637697250] [2021-01-06 19:47:03,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:03,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:03,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145293133] [2021-01-06 19:47:03,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:03,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:03,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:03,701 INFO L87 Difference]: Start difference. First operand 96478 states and 137349 transitions. Second operand 3 states. [2021-01-06 19:47:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:08,501 INFO L93 Difference]: Finished difference Result 150973 states and 214009 transitions. [2021-01-06 19:47:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:08,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:47:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:08,643 INFO L225 Difference]: With dead ends: 150973 [2021-01-06 19:47:08,643 INFO L226 Difference]: Without dead ends: 101591 [2021-01-06 19:47:08,688 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:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101591 states. [2021-01-06 19:47:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101591 to 97340. [2021-01-06 19:47:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97340 states. [2021-01-06 19:47:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97340 states to 97340 states and 136276 transitions. [2021-01-06 19:47:13,395 INFO L78 Accepts]: Start accepts. Automaton has 97340 states and 136276 transitions. Word has length 100 [2021-01-06 19:47:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:13,395 INFO L481 AbstractCegarLoop]: Abstraction has 97340 states and 136276 transitions. [2021-01-06 19:47:13,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 97340 states and 136276 transitions. [2021-01-06 19:47:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:47:13,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:13,410 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:13,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:47:13,410 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash 567734444, now seen corresponding path program 1 times [2021-01-06 19:47:13,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:13,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540645242] [2021-01-06 19:47:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:13,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540645242] [2021-01-06 19:47:13,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:13,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:13,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499208417] [2021-01-06 19:47:13,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:13,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:13,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:13,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:13,467 INFO L87 Difference]: Start difference. First operand 97340 states and 136276 transitions. Second operand 3 states. [2021-01-06 19:47:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:20,060 INFO L93 Difference]: Finished difference Result 239723 states and 335013 transitions. [2021-01-06 19:47:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:20,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:47:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:20,419 INFO L225 Difference]: With dead ends: 239723 [2021-01-06 19:47:20,419 INFO L226 Difference]: Without dead ends: 156669 [2021-01-06 19:47:20,469 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:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156669 states. [2021-01-06 19:47:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156669 to 155243. [2021-01-06 19:47:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155243 states. [2021-01-06 19:47:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155243 states to 155243 states and 214611 transitions. [2021-01-06 19:47:27,914 INFO L78 Accepts]: Start accepts. Automaton has 155243 states and 214611 transitions. Word has length 100 [2021-01-06 19:47:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:27,915 INFO L481 AbstractCegarLoop]: Abstraction has 155243 states and 214611 transitions. [2021-01-06 19:47:27,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 155243 states and 214611 transitions. [2021-01-06 19:47:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:47:27,939 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:27,939 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:27,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:47:27,939 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash -588156778, now seen corresponding path program 1 times [2021-01-06 19:47:27,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:27,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374471347] [2021-01-06 19:47:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:47:28,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374471347] [2021-01-06 19:47:28,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:28,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:47:28,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045917798] [2021-01-06 19:47:28,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:47:28,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:47:28,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:47:28,125 INFO L87 Difference]: Start difference. First operand 155243 states and 214611 transitions. Second operand 7 states. [2021-01-06 19:47:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:42,123 INFO L93 Difference]: Finished difference Result 360270 states and 503407 transitions. [2021-01-06 19:47:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:47:42,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2021-01-06 19:47:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:42,638 INFO L225 Difference]: With dead ends: 360270 [2021-01-06 19:47:42,638 INFO L226 Difference]: Without dead ends: 318214 [2021-01-06 19:47:42,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:47:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318214 states. [2021-01-06 19:47:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318214 to 195531. [2021-01-06 19:47:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195531 states. [2021-01-06 19:47:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195531 states to 195531 states and 270611 transitions. [2021-01-06 19:47:53,906 INFO L78 Accepts]: Start accepts. Automaton has 195531 states and 270611 transitions. Word has length 100 [2021-01-06 19:47:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:53,906 INFO L481 AbstractCegarLoop]: Abstraction has 195531 states and 270611 transitions. [2021-01-06 19:47:53,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:47:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 195531 states and 270611 transitions. [2021-01-06 19:47:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:47:53,929 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:53,929 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:53,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:47:53,929 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:53,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1877694796, now seen corresponding path program 1 times [2021-01-06 19:47:53,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:53,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905391196] [2021-01-06 19:47:53,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:47:54,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905391196] [2021-01-06 19:47:54,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:54,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:47:54,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198420089] [2021-01-06 19:47:54,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:47:54,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:54,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:47:54,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:47:54,086 INFO L87 Difference]: Start difference. First operand 195531 states and 270611 transitions. Second operand 7 states. [2021-01-06 19:48:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:48:11,685 INFO L93 Difference]: Finished difference Result 387166 states and 540476 transitions. [2021-01-06 19:48:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:48:11,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2021-01-06 19:48:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:48:12,296 INFO L225 Difference]: With dead ends: 387166 [2021-01-06 19:48:12,296 INFO L226 Difference]: Without dead ends: 359100 [2021-01-06 19:48:12,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:48:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359100 states. [2021-01-06 19:48:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359100 to 222443. [2021-01-06 19:48:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222443 states. [2021-01-06 19:48:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222443 states to 222443 states and 308115 transitions. [2021-01-06 19:48:25,917 INFO L78 Accepts]: Start accepts. Automaton has 222443 states and 308115 transitions. Word has length 100 [2021-01-06 19:48:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:48:25,917 INFO L481 AbstractCegarLoop]: Abstraction has 222443 states and 308115 transitions. [2021-01-06 19:48:25,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:48:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 222443 states and 308115 transitions. [2021-01-06 19:48:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:48:25,941 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:48:25,941 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:48:25,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:48:25,941 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:48:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:48:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash 170158188, now seen corresponding path program 1 times [2021-01-06 19:48:25,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:48:25,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949657552] [2021-01-06 19:48:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:48:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:48:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:48:26,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949657552] [2021-01-06 19:48:26,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:48:26,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:48:26,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603784021] [2021-01-06 19:48:26,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:48:26,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:48:26,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:48:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:48:26,076 INFO L87 Difference]: Start difference. First operand 222443 states and 308115 transitions. Second operand 7 states. [2021-01-06 19:48:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:48:48,810 INFO L93 Difference]: Finished difference Result 435753 states and 608458 transitions. [2021-01-06 19:48:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:48:48,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2021-01-06 19:48:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:48:49,587 INFO L225 Difference]: With dead ends: 435753 [2021-01-06 19:48:49,587 INFO L226 Difference]: Without dead ends: 384779 [2021-01-06 19:48:49,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:48:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384779 states. [2021-01-06 19:49:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384779 to 263435. [2021-01-06 19:49:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263435 states. [2021-01-06 19:49:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263435 states to 263435 states and 365083 transitions. [2021-01-06 19:49:06,278 INFO L78 Accepts]: Start accepts. Automaton has 263435 states and 365083 transitions. Word has length 100 [2021-01-06 19:49:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:49:06,279 INFO L481 AbstractCegarLoop]: Abstraction has 263435 states and 365083 transitions. [2021-01-06 19:49:06,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:49:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 263435 states and 365083 transitions. [2021-01-06 19:49:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:49:06,301 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:49:06,302 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:49:06,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:49:06,302 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:49:06,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:49:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash 250185526, now seen corresponding path program 1 times [2021-01-06 19:49:06,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:49:06,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546823025] [2021-01-06 19:49:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:49:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:49:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:49:06,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546823025] [2021-01-06 19:49:06,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:49:06,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:49:06,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513669415] [2021-01-06 19:49:06,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:49:06,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:49:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:49:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:49:06,515 INFO L87 Difference]: Start difference. First operand 263435 states and 365083 transitions. Second operand 7 states. [2021-01-06 19:49:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:49:31,704 INFO L93 Difference]: Finished difference Result 488325 states and 681259 transitions. [2021-01-06 19:49:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:49:31,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2021-01-06 19:49:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:49:32,540 INFO L225 Difference]: With dead ends: 488325 [2021-01-06 19:49:32,541 INFO L226 Difference]: Without dead ends: 432516 [2021-01-06 19:49:32,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:49:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432516 states. [2021-01-06 19:49:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432516 to 300616. [2021-01-06 19:49:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300616 states. [2021-01-06 19:49:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300616 states to 300616 states and 416778 transitions. [2021-01-06 19:49:53,434 INFO L78 Accepts]: Start accepts. Automaton has 300616 states and 416778 transitions. Word has length 100 [2021-01-06 19:49:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:49:53,434 INFO L481 AbstractCegarLoop]: Abstraction has 300616 states and 416778 transitions. [2021-01-06 19:49:53,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:49:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 300616 states and 416778 transitions. [2021-01-06 19:49:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 19:49:53,474 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:49:53,474 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:49:53,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:49:53,475 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:49:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:49:53,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2135373178, now seen corresponding path program 1 times [2021-01-06 19:49:53,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:49:53,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639839090] [2021-01-06 19:49:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:49:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:49:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:49:53,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639839090] [2021-01-06 19:49:53,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:49:53,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:49:53,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976891972] [2021-01-06 19:49:53,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:49:53,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:49:53,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:49:53,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:49:53,569 INFO L87 Difference]: Start difference. First operand 300616 states and 416778 transitions. Second operand 3 states.