/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.8.1.ufo.BOUNDED-16.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 10:00:22,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 10:00:22,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 10:00:22,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 10:00:22,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 10:00:22,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 10:00:22,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 10:00:22,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 10:00:22,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 10:00:22,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 10:00:22,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 10:00:22,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 10:00:22,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 10:00:22,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 10:00:22,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 10:00:22,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 10:00:22,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 10:00:22,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 10:00:22,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 10:00:22,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 10:00:22,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 10:00:22,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 10:00:22,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 10:00:22,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 10:00:22,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 10:00:22,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 10:00:22,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 10:00:22,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 10:00:22,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 10:00:22,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 10:00:22,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 10:00:22,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 10:00:22,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 10:00:22,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 10:00:22,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 10:00:22,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 10:00:22,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 10:00:22,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 10:00:22,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 10:00:22,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 10:00:22,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 10:00:22,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 10:00:23,008 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 10:00:23,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 10:00:23,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 10:00:23,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 10:00:23,013 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 10:00:23,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 10:00:23,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 10:00:23,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 10:00:23,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 10:00:23,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 10:00:23,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 10:00:23,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 10:00:23,016 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 10:00:23,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 10:00:23,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 10:00:23,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 10:00:23,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 10:00:23,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:00:23,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 10:00:23,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 10:00:23,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 10:00:23,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 10:00:23,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 10:00:23,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 10:00:23,020 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 10:00:23,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 10:00:23,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 10:00:23,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 10:00:23,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 10:00:23,521 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 10:00:23,522 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 10:00:23,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-12-23 10:00:23,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ee0cdfaa8/e2af4c018587439b85d926d8c50b7e70/FLAGdb271f8f4 [2020-12-23 10:00:24,325 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 10:00:24,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-12-23 10:00:24,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ee0cdfaa8/e2af4c018587439b85d926d8c50b7e70/FLAGdb271f8f4 [2020-12-23 10:00:24,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ee0cdfaa8/e2af4c018587439b85d926d8c50b7e70 [2020-12-23 10:00:24,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 10:00:24,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 10:00:24,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 10:00:24,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 10:00:24,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 10:00:24,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:00:24" (1/1) ... [2020-12-23 10:00:24,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473010a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:24, skipping insertion in model container [2020-12-23 10:00:24,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:00:24" (1/1) ... [2020-12-23 10:00:24,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 10:00:24,748 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[~p8_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[~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[~mode2~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[~mode3~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[~mode4~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[~mode5~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[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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~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[~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[~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[~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[~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[~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[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:00:25,081 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.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2020-12-23 10:00:25,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:00:25,098 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[~p8_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[~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[~mode2~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[~mode3~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[~mode4~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[~mode5~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[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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~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[~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[~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[~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[~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[~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[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:00:25,237 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.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2020-12-23 10:00:25,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:00:25,280 INFO L208 MainTranslator]: Completed translation [2020-12-23 10:00:25,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25 WrapperNode [2020-12-23 10:00:25,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 10:00:25,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 10:00:25,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 10:00:25,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 10:00:25,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 10:00:25,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 10:00:25,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 10:00:25,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 10:00:25,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... [2020-12-23 10:00:25,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 10:00:25,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 10:00:25,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 10:00:25,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 10:00:25,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:00:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 10:00:25,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 10:00:25,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 10:00:25,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 10:00:26,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 10:00:26,588 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2020-12-23 10:00:26,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:00:26 BoogieIcfgContainer [2020-12-23 10:00:26,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 10:00:26,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 10:00:26,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 10:00:26,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 10:00:26,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:00:24" (1/3) ... [2020-12-23 10:00:26,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359162f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:00:26, skipping insertion in model container [2020-12-23 10:00:26,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:00:25" (2/3) ... [2020-12-23 10:00:26,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359162f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:00:26, skipping insertion in model container [2020-12-23 10:00:26,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:00:26" (3/3) ... [2020-12-23 10:00:26,598 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-12-23 10:00:26,605 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 10:00:26,610 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 10:00:26,643 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 10:00:26,692 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 10:00:26,693 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 10:00:26,693 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 10:00:26,693 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 10:00:26,693 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 10:00:26,693 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 10:00:26,694 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 10:00:26,694 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 10:00:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2020-12-23 10:00:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 10:00:26,733 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:26,734 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] [2020-12-23 10:00:26,734 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:26,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash -486996250, now seen corresponding path program 1 times [2020-12-23 10:00:26,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:26,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293864848] [2020-12-23 10:00:26,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:27,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293864848] [2020-12-23 10:00:27,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:27,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 10:00:27,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655240150] [2020-12-23 10:00:27,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 10:00:27,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 10:00:27,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:00:27,198 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 2 states. [2020-12-23 10:00:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:27,239 INFO L93 Difference]: Finished difference Result 228 states and 384 transitions. [2020-12-23 10:00:27,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 10:00:27,241 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2020-12-23 10:00:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:27,256 INFO L225 Difference]: With dead ends: 228 [2020-12-23 10:00:27,257 INFO L226 Difference]: Without dead ends: 143 [2020-12-23 10:00:27,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:00:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-23 10:00:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-12-23 10:00:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 10:00:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 249 transitions. [2020-12-23 10:00:27,317 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 249 transitions. Word has length 45 [2020-12-23 10:00:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:27,317 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 249 transitions. [2020-12-23 10:00:27,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 10:00:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2020-12-23 10:00:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 10:00:27,324 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:27,324 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] [2020-12-23 10:00:27,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 10:00:27,325 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1858803548, now seen corresponding path program 1 times [2020-12-23 10:00:27,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:27,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373628786] [2020-12-23 10:00:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:27,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373628786] [2020-12-23 10:00:27,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:27,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:00:27,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859810301] [2020-12-23 10:00:27,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:00:27,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:00:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:00:27,551 INFO L87 Difference]: Start difference. First operand 143 states and 249 transitions. Second operand 5 states. [2020-12-23 10:00:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:27,694 INFO L93 Difference]: Finished difference Result 223 states and 374 transitions. [2020-12-23 10:00:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 10:00:27,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-23 10:00:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:27,697 INFO L225 Difference]: With dead ends: 223 [2020-12-23 10:00:27,697 INFO L226 Difference]: Without dead ends: 143 [2020-12-23 10:00:27,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 10:00:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-23 10:00:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-12-23 10:00:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 10:00:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 188 transitions. [2020-12-23 10:00:27,711 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 188 transitions. Word has length 45 [2020-12-23 10:00:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:27,712 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 188 transitions. [2020-12-23 10:00:27,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:00:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2020-12-23 10:00:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:27,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:27,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:27,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 10:00:27,718 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:27,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1176555156, now seen corresponding path program 1 times [2020-12-23 10:00:27,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:27,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776321113] [2020-12-23 10:00:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:27,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776321113] [2020-12-23 10:00:27,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:27,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:27,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520052468] [2020-12-23 10:00:27,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:27,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:27,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:27,979 INFO L87 Difference]: Start difference. First operand 143 states and 188 transitions. Second operand 3 states. [2020-12-23 10:00:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:28,010 INFO L93 Difference]: Finished difference Result 289 states and 420 transitions. [2020-12-23 10:00:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:28,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:00:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:28,014 INFO L225 Difference]: With dead ends: 289 [2020-12-23 10:00:28,014 INFO L226 Difference]: Without dead ends: 213 [2020-12-23 10:00:28,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-23 10:00:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-12-23 10:00:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-23 10:00:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 297 transitions. [2020-12-23 10:00:28,054 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 297 transitions. Word has length 105 [2020-12-23 10:00:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:28,054 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 297 transitions. [2020-12-23 10:00:28,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 297 transitions. [2020-12-23 10:00:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:28,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:28,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:28,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 10:00:28,063 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:28,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1701405430, now seen corresponding path program 1 times [2020-12-23 10:00:28,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:28,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527878772] [2020-12-23 10:00:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:28,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527878772] [2020-12-23 10:00:28,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:28,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:28,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721300957] [2020-12-23 10:00:28,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:28,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:28,224 INFO L87 Difference]: Start difference. First operand 211 states and 297 transitions. Second operand 3 states. [2020-12-23 10:00:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:28,280 INFO L93 Difference]: Finished difference Result 487 states and 737 transitions. [2020-12-23 10:00:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:28,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:00:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:28,284 INFO L225 Difference]: With dead ends: 487 [2020-12-23 10:00:28,284 INFO L226 Difference]: Without dead ends: 343 [2020-12-23 10:00:28,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-12-23 10:00:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2020-12-23 10:00:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-12-23 10:00:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 504 transitions. [2020-12-23 10:00:28,311 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 504 transitions. Word has length 105 [2020-12-23 10:00:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:28,311 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 504 transitions. [2020-12-23 10:00:28,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 504 transitions. [2020-12-23 10:00:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:28,313 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:28,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:28,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 10:00:28,314 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash -179136962, now seen corresponding path program 1 times [2020-12-23 10:00:28,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:28,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783805215] [2020-12-23 10:00:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:28,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783805215] [2020-12-23 10:00:28,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:28,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:28,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114395873] [2020-12-23 10:00:28,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:28,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:28,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:28,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:28,426 INFO L87 Difference]: Start difference. First operand 341 states and 504 transitions. Second operand 3 states. [2020-12-23 10:00:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:28,469 INFO L93 Difference]: Finished difference Result 865 states and 1338 transitions. [2020-12-23 10:00:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:28,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:00:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:28,474 INFO L225 Difference]: With dead ends: 865 [2020-12-23 10:00:28,475 INFO L226 Difference]: Without dead ends: 591 [2020-12-23 10:00:28,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-12-23 10:00:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2020-12-23 10:00:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-12-23 10:00:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 896 transitions. [2020-12-23 10:00:28,512 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 896 transitions. Word has length 105 [2020-12-23 10:00:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:28,513 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 896 transitions. [2020-12-23 10:00:28,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 896 transitions. [2020-12-23 10:00:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:28,516 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:28,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:28,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 10:00:28,516 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1430042254, now seen corresponding path program 1 times [2020-12-23 10:00:28,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:28,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068160542] [2020-12-23 10:00:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:28,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068160542] [2020-12-23 10:00:28,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:28,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:28,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61498864] [2020-12-23 10:00:28,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:28,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:28,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:28,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:28,662 INFO L87 Difference]: Start difference. First operand 589 states and 896 transitions. Second operand 3 states. [2020-12-23 10:00:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:28,719 INFO L93 Difference]: Finished difference Result 1585 states and 2474 transitions. [2020-12-23 10:00:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:28,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:00:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:28,729 INFO L225 Difference]: With dead ends: 1585 [2020-12-23 10:00:28,729 INFO L226 Difference]: Without dead ends: 1063 [2020-12-23 10:00:28,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-12-23 10:00:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2020-12-23 10:00:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2020-12-23 10:00:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1636 transitions. [2020-12-23 10:00:28,789 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1636 transitions. Word has length 105 [2020-12-23 10:00:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:28,789 INFO L481 AbstractCegarLoop]: Abstraction has 1061 states and 1636 transitions. [2020-12-23 10:00:28,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1636 transitions. [2020-12-23 10:00:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:28,791 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:28,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:28,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 10:00:28,792 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:28,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2119342312, now seen corresponding path program 1 times [2020-12-23 10:00:28,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:28,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35377125] [2020-12-23 10:00:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:29,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35377125] [2020-12-23 10:00:29,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:29,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:29,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969425032] [2020-12-23 10:00:29,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:29,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:29,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:29,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:29,014 INFO L87 Difference]: Start difference. First operand 1061 states and 1636 transitions. Second operand 3 states. [2020-12-23 10:00:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:29,115 INFO L93 Difference]: Finished difference Result 2953 states and 4614 transitions. [2020-12-23 10:00:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:29,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:00:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:29,132 INFO L225 Difference]: With dead ends: 2953 [2020-12-23 10:00:29,133 INFO L226 Difference]: Without dead ends: 1959 [2020-12-23 10:00:29,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2020-12-23 10:00:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1957. [2020-12-23 10:00:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2020-12-23 10:00:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3028 transitions. [2020-12-23 10:00:29,225 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3028 transitions. Word has length 105 [2020-12-23 10:00:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:29,226 INFO L481 AbstractCegarLoop]: Abstraction has 1957 states and 3028 transitions. [2020-12-23 10:00:29,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3028 transitions. [2020-12-23 10:00:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:29,232 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:29,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:29,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 10:00:29,233 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash 179311454, now seen corresponding path program 1 times [2020-12-23 10:00:29,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:29,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366351120] [2020-12-23 10:00:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:29,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366351120] [2020-12-23 10:00:29,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:29,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:29,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795804982] [2020-12-23 10:00:29,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:29,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:29,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:29,366 INFO L87 Difference]: Start difference. First operand 1957 states and 3028 transitions. Second operand 3 states. [2020-12-23 10:00:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:29,540 INFO L93 Difference]: Finished difference Result 5545 states and 8630 transitions. [2020-12-23 10:00:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:29,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:00:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:29,562 INFO L225 Difference]: With dead ends: 5545 [2020-12-23 10:00:29,562 INFO L226 Difference]: Without dead ends: 3655 [2020-12-23 10:00:29,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2020-12-23 10:00:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3653. [2020-12-23 10:00:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2020-12-23 10:00:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5636 transitions. [2020-12-23 10:00:29,755 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5636 transitions. Word has length 105 [2020-12-23 10:00:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:29,756 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5636 transitions. [2020-12-23 10:00:29,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5636 transitions. [2020-12-23 10:00:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:29,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:29,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:29,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 10:00:29,758 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1414973228, now seen corresponding path program 1 times [2020-12-23 10:00:29,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:29,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714290580] [2020-12-23 10:00:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:29,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714290580] [2020-12-23 10:00:29,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:29,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:00:29,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353584369] [2020-12-23 10:00:29,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:00:29,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:00:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:00:29,960 INFO L87 Difference]: Start difference. First operand 3653 states and 5636 transitions. Second operand 6 states. [2020-12-23 10:00:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:30,362 INFO L93 Difference]: Finished difference Result 7239 states and 11205 transitions. [2020-12-23 10:00:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:00:30,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-12-23 10:00:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:30,384 INFO L225 Difference]: With dead ends: 7239 [2020-12-23 10:00:30,384 INFO L226 Difference]: Without dead ends: 3653 [2020-12-23 10:00:30,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:00:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2020-12-23 10:00:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3653. [2020-12-23 10:00:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2020-12-23 10:00:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5604 transitions. [2020-12-23 10:00:30,622 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5604 transitions. Word has length 105 [2020-12-23 10:00:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:30,622 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5604 transitions. [2020-12-23 10:00:30,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:00:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5604 transitions. [2020-12-23 10:00:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:30,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:30,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:30,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 10:00:30,624 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash -905500138, now seen corresponding path program 1 times [2020-12-23 10:00:30,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:30,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752451751] [2020-12-23 10:00:30,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:30,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752451751] [2020-12-23 10:00:30,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:30,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:00:30,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079242043] [2020-12-23 10:00:30,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:00:30,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:00:30,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:00:30,755 INFO L87 Difference]: Start difference. First operand 3653 states and 5604 transitions. Second operand 6 states. [2020-12-23 10:00:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:31,173 INFO L93 Difference]: Finished difference Result 7239 states and 11141 transitions. [2020-12-23 10:00:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:00:31,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-12-23 10:00:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:31,194 INFO L225 Difference]: With dead ends: 7239 [2020-12-23 10:00:31,194 INFO L226 Difference]: Without dead ends: 3653 [2020-12-23 10:00:31,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:00:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2020-12-23 10:00:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3653. [2020-12-23 10:00:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2020-12-23 10:00:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5572 transitions. [2020-12-23 10:00:31,397 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5572 transitions. Word has length 105 [2020-12-23 10:00:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:31,397 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5572 transitions. [2020-12-23 10:00:31,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:00:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5572 transitions. [2020-12-23 10:00:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:00:31,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:31,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:31,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 10:00:31,399 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1180259752, now seen corresponding path program 1 times [2020-12-23 10:00:31,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:31,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065135555] [2020-12-23 10:00:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:31,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065135555] [2020-12-23 10:00:31,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:31,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:00:31,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543804314] [2020-12-23 10:00:31,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:00:31,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:31,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:00:31,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:00:31,636 INFO L87 Difference]: Start difference. First operand 3653 states and 5572 transitions. Second operand 10 states. [2020-12-23 10:00:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:34,927 INFO L93 Difference]: Finished difference Result 61029 states and 93652 transitions. [2020-12-23 10:00:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 10:00:34,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2020-12-23 10:00:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:35,098 INFO L225 Difference]: With dead ends: 61029 [2020-12-23 10:00:35,099 INFO L226 Difference]: Without dead ends: 57443 [2020-12-23 10:00:35,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-12-23 10:00:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57443 states. [2020-12-23 10:00:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57443 to 7237. [2020-12-23 10:00:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7237 states. [2020-12-23 10:00:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7237 states to 7237 states and 10948 transitions. [2020-12-23 10:00:36,303 INFO L78 Accepts]: Start accepts. Automaton has 7237 states and 10948 transitions. Word has length 105 [2020-12-23 10:00:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:36,303 INFO L481 AbstractCegarLoop]: Abstraction has 7237 states and 10948 transitions. [2020-12-23 10:00:36,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 10:00:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7237 states and 10948 transitions. [2020-12-23 10:00:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 10:00:36,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:36,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:36,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 10:00:36,307 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:36,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1773942360, now seen corresponding path program 1 times [2020-12-23 10:00:36,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:36,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901517402] [2020-12-23 10:00:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:36,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901517402] [2020-12-23 10:00:36,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:36,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:36,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010169366] [2020-12-23 10:00:36,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:36,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:36,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:36,377 INFO L87 Difference]: Start difference. First operand 7237 states and 10948 transitions. Second operand 3 states. [2020-12-23 10:00:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:37,304 INFO L93 Difference]: Finished difference Result 18185 states and 27398 transitions. [2020-12-23 10:00:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:37,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 10:00:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:37,335 INFO L225 Difference]: With dead ends: 18185 [2020-12-23 10:00:37,335 INFO L226 Difference]: Without dead ends: 11015 [2020-12-23 10:00:37,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:37,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11015 states. [2020-12-23 10:00:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11015 to 11013. [2020-12-23 10:00:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11013 states. [2020-12-23 10:00:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11013 states to 11013 states and 16324 transitions. [2020-12-23 10:00:38,441 INFO L78 Accepts]: Start accepts. Automaton has 11013 states and 16324 transitions. Word has length 107 [2020-12-23 10:00:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:38,441 INFO L481 AbstractCegarLoop]: Abstraction has 11013 states and 16324 transitions. [2020-12-23 10:00:38,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 11013 states and 16324 transitions. [2020-12-23 10:00:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 10:00:38,442 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:38,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:38,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 10:00:38,443 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1707448848, now seen corresponding path program 1 times [2020-12-23 10:00:38,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:38,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205924635] [2020-12-23 10:00:38,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:38,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205924635] [2020-12-23 10:00:38,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:38,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:00:38,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708287837] [2020-12-23 10:00:38,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:00:38,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:38,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:00:38,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:00:38,896 INFO L87 Difference]: Start difference. First operand 11013 states and 16324 transitions. Second operand 10 states. [2020-12-23 10:00:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:40,554 INFO L93 Difference]: Finished difference Result 27403 states and 40727 transitions. [2020-12-23 10:00:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:00:40,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2020-12-23 10:00:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:40,590 INFO L225 Difference]: With dead ends: 27403 [2020-12-23 10:00:40,590 INFO L226 Difference]: Without dead ends: 16457 [2020-12-23 10:00:40,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2020-12-23 10:00:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16457 states. [2020-12-23 10:00:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16457 to 11013. [2020-12-23 10:00:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11013 states. [2020-12-23 10:00:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11013 states to 11013 states and 16260 transitions. [2020-12-23 10:00:41,453 INFO L78 Accepts]: Start accepts. Automaton has 11013 states and 16260 transitions. Word has length 107 [2020-12-23 10:00:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:41,453 INFO L481 AbstractCegarLoop]: Abstraction has 11013 states and 16260 transitions. [2020-12-23 10:00:41,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 10:00:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 11013 states and 16260 transitions. [2020-12-23 10:00:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 10:00:41,455 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:41,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:41,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 10:00:41,455 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash 81465228, now seen corresponding path program 1 times [2020-12-23 10:00:41,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:41,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034430258] [2020-12-23 10:00:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:41,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034430258] [2020-12-23 10:00:41,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:41,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:41,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24962338] [2020-12-23 10:00:41,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:41,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:41,547 INFO L87 Difference]: Start difference. First operand 11013 states and 16260 transitions. Second operand 3 states. [2020-12-23 10:00:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:43,007 INFO L93 Difference]: Finished difference Result 31753 states and 46726 transitions. [2020-12-23 10:00:43,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:43,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 10:00:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:43,045 INFO L225 Difference]: With dead ends: 31753 [2020-12-23 10:00:43,045 INFO L226 Difference]: Without dead ends: 20807 [2020-12-23 10:00:43,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20807 states. [2020-12-23 10:00:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20807 to 20805. [2020-12-23 10:00:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20805 states. [2020-12-23 10:00:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20805 states to 20805 states and 30340 transitions. [2020-12-23 10:00:44,688 INFO L78 Accepts]: Start accepts. Automaton has 20805 states and 30340 transitions. Word has length 107 [2020-12-23 10:00:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:44,688 INFO L481 AbstractCegarLoop]: Abstraction has 20805 states and 30340 transitions. [2020-12-23 10:00:44,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 20805 states and 30340 transitions. [2020-12-23 10:00:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 10:00:44,689 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:44,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:44,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 10:00:44,690 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:44,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1328972844, now seen corresponding path program 1 times [2020-12-23 10:00:44,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:44,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875415335] [2020-12-23 10:00:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:44,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875415335] [2020-12-23 10:00:44,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:44,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:44,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193269448] [2020-12-23 10:00:44,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:44,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:44,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:44,772 INFO L87 Difference]: Start difference. First operand 20805 states and 30340 transitions. Second operand 3 states. [2020-12-23 10:00:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:47,859 INFO L93 Difference]: Finished difference Result 59977 states and 87046 transitions. [2020-12-23 10:00:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:47,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 10:00:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:47,917 INFO L225 Difference]: With dead ends: 59977 [2020-12-23 10:00:47,918 INFO L226 Difference]: Without dead ends: 39239 [2020-12-23 10:00:47,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39239 states. [2020-12-23 10:00:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39239 to 39237. [2020-12-23 10:00:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39237 states. [2020-12-23 10:00:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39237 states to 39237 states and 56388 transitions. [2020-12-23 10:00:51,565 INFO L78 Accepts]: Start accepts. Automaton has 39237 states and 56388 transitions. Word has length 107 [2020-12-23 10:00:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:51,565 INFO L481 AbstractCegarLoop]: Abstraction has 39237 states and 56388 transitions. [2020-12-23 10:00:51,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 39237 states and 56388 transitions. [2020-12-23 10:00:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 10:00:51,567 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:51,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:51,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 10:00:51,569 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 892169983, now seen corresponding path program 1 times [2020-12-23 10:00:51,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:51,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903754299] [2020-12-23 10:00:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:51,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903754299] [2020-12-23 10:00:51,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:51,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:00:51,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831145098] [2020-12-23 10:00:51,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:00:51,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:00:51,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:51,675 INFO L87 Difference]: Start difference. First operand 39237 states and 56388 transitions. Second operand 3 states. [2020-12-23 10:00:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:55,422 INFO L93 Difference]: Finished difference Result 90571 states and 130504 transitions. [2020-12-23 10:00:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:00:55,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2020-12-23 10:00:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:55,488 INFO L225 Difference]: With dead ends: 90571 [2020-12-23 10:00:55,488 INFO L226 Difference]: Without dead ends: 51401 [2020-12-23 10:00:55,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:00:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51401 states. [2020-12-23 10:00:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51401 to 51399. [2020-12-23 10:00:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51399 states. [2020-12-23 10:00:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51399 states to 51399 states and 73798 transitions. [2020-12-23 10:00:59,600 INFO L78 Accepts]: Start accepts. Automaton has 51399 states and 73798 transitions. Word has length 108 [2020-12-23 10:00:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:59,600 INFO L481 AbstractCegarLoop]: Abstraction has 51399 states and 73798 transitions. [2020-12-23 10:00:59,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:00:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 51399 states and 73798 transitions. [2020-12-23 10:00:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 10:00:59,601 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:59,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:59,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 10:00:59,602 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:59,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1806029504, now seen corresponding path program 1 times [2020-12-23 10:00:59,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:59,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321717088] [2020-12-23 10:00:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:00:59,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321717088] [2020-12-23 10:00:59,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:59,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 10:00:59,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284312801] [2020-12-23 10:00:59,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 10:00:59,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:59,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 10:00:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 10:00:59,715 INFO L87 Difference]: Start difference. First operand 51399 states and 73798 transitions. Second operand 8 states. [2020-12-23 10:01:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:06,035 INFO L93 Difference]: Finished difference Result 81265 states and 116218 transitions. [2020-12-23 10:01:06,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:01:06,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2020-12-23 10:01:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:06,112 INFO L225 Difference]: With dead ends: 81265 [2020-12-23 10:01:06,112 INFO L226 Difference]: Without dead ends: 81263 [2020-12-23 10:01:06,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 10:01:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81263 states. [2020-12-23 10:01:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81263 to 52167. [2020-12-23 10:01:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52167 states. [2020-12-23 10:01:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52167 states to 52167 states and 74182 transitions. [2020-12-23 10:01:10,665 INFO L78 Accepts]: Start accepts. Automaton has 52167 states and 74182 transitions. Word has length 108 [2020-12-23 10:01:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:10,665 INFO L481 AbstractCegarLoop]: Abstraction has 52167 states and 74182 transitions. [2020-12-23 10:01:10,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 10:01:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 52167 states and 74182 transitions. [2020-12-23 10:01:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 10:01:10,687 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:10,687 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:10,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 10:01:10,688 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash 150223880, now seen corresponding path program 1 times [2020-12-23 10:01:10,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:10,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241274146] [2020-12-23 10:01:10,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 10:01:10,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241274146] [2020-12-23 10:01:10,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:10,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:01:10,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941641986] [2020-12-23 10:01:10,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:01:10,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:01:10,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:01:10,932 INFO L87 Difference]: Start difference. First operand 52167 states and 74182 transitions. Second operand 10 states. [2020-12-23 10:01:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:42,058 INFO L93 Difference]: Finished difference Result 482649 states and 686031 transitions. [2020-12-23 10:01:42,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:01:42,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2020-12-23 10:01:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:42,721 INFO L225 Difference]: With dead ends: 482649 [2020-12-23 10:01:42,722 INFO L226 Difference]: Without dead ends: 430551 [2020-12-23 10:01:42,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-12-23 10:01:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430551 states. [2020-12-23 10:01:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430551 to 104263. [2020-12-23 10:01:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104263 states. [2020-12-23 10:01:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104263 states to 104263 states and 147782 transitions. [2020-12-23 10:01:54,598 INFO L78 Accepts]: Start accepts. Automaton has 104263 states and 147782 transitions. Word has length 148 [2020-12-23 10:01:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:54,599 INFO L481 AbstractCegarLoop]: Abstraction has 104263 states and 147782 transitions. [2020-12-23 10:01:54,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 10:01:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 104263 states and 147782 transitions. [2020-12-23 10:01:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 10:01:54,626 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:54,627 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:54,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:01:54,627 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:54,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1397731496, now seen corresponding path program 1 times [2020-12-23 10:01:54,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:54,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449187843] [2020-12-23 10:01:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 10:01:54,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449187843] [2020-12-23 10:01:54,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:54,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:01:54,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748273317] [2020-12-23 10:01:54,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:01:54,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:01:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:01:54,875 INFO L87 Difference]: Start difference. First operand 104263 states and 147782 transitions. Second operand 10 states. [2020-12-23 10:02:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:33,520 INFO L93 Difference]: Finished difference Result 534745 states and 759631 transitions. [2020-12-23 10:02:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:02:33,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2020-12-23 10:02:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:34,337 INFO L225 Difference]: With dead ends: 534745 [2020-12-23 10:02:34,337 INFO L226 Difference]: Without dead ends: 482647 [2020-12-23 10:02:34,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-12-23 10:02:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482647 states. [2020-12-23 10:02:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482647 to 182215. [2020-12-23 10:02:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182215 states. [2020-12-23 10:02:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182215 states to 182215 states and 257606 transitions. [2020-12-23 10:02:53,873 INFO L78 Accepts]: Start accepts. Automaton has 182215 states and 257606 transitions. Word has length 148 [2020-12-23 10:02:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:53,874 INFO L481 AbstractCegarLoop]: Abstraction has 182215 states and 257606 transitions. [2020-12-23 10:02:53,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 10:02:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 182215 states and 257606 transitions. [2020-12-23 10:02:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 10:02:53,920 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:53,920 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:53,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:02:53,921 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1427802818, now seen corresponding path program 1 times [2020-12-23 10:02:53,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:53,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130542551] [2020-12-23 10:02:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 10:02:54,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130542551] [2020-12-23 10:02:54,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:54,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:02:54,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516840281] [2020-12-23 10:02:54,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:02:54,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:54,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:02:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:02:54,145 INFO L87 Difference]: Start difference. First operand 182215 states and 257606 transitions. Second operand 10 states. [2020-12-23 10:03:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:43,191 INFO L93 Difference]: Finished difference Result 586841 states and 833231 transitions. [2020-12-23 10:03:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:03:43,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2020-12-23 10:03:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:44,097 INFO L225 Difference]: With dead ends: 586841 [2020-12-23 10:03:44,097 INFO L226 Difference]: Without dead ends: 534743 [2020-12-23 10:03:44,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-23 10:03:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534743 states.