/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-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 11:22:49,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 11:22:49,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 11:22:49,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 11:22:49,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 11:22:49,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 11:22:49,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 11:22:49,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 11:22:49,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 11:22:49,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 11:22:49,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 11:22:49,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 11:22:49,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 11:22:49,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 11:22:49,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 11:22:49,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 11:22:49,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 11:22:49,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 11:22:49,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 11:22:49,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 11:22:49,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 11:22:49,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 11:22:49,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 11:22:49,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 11:22:49,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 11:22:49,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 11:22:49,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 11:22:49,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 11:22:49,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 11:22:49,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 11:22:49,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 11:22:49,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 11:22:49,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 11:22:49,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 11:22:49,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 11:22:49,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 11:22:49,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 11:22:49,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 11:22:49,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 11:22:49,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 11:22:49,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 11:22:49,355 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 11:22:49,382 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 11:22:49,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 11:22:49,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 11:22:49,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 11:22:49,384 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 11:22:49,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 11:22:49,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 11:22:49,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 11:22:49,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 11:22:49,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 11:22:49,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 11:22:49,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 11:22:49,386 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 11:22:49,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 11:22:49,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 11:22:49,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 11:22:49,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 11:22:49,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:22:49,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 11:22:49,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 11:22:49,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 11:22:49,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 11:22:49,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 11:22:49,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 11:22:49,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 11:22:49,390 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 11:22:49,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 11:22:49,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 11:22:49,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 11:22:49,850 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 11:22:49,851 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 11:22:49,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2020-12-23 11:22:49,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/40e2fceb3/5fb5d0b9487942cf8880adbb514b469f/FLAG63e56fde6 [2020-12-23 11:22:50,627 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 11:22:50,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2020-12-23 11:22:50,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/40e2fceb3/5fb5d0b9487942cf8880adbb514b469f/FLAG63e56fde6 [2020-12-23 11:22:50,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/40e2fceb3/5fb5d0b9487942cf8880adbb514b469f [2020-12-23 11:22:50,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 11:22:50,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 11:22:50,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 11:22:50,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 11:22:50,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 11:22:50,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:50,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3e2c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50, skipping insertion in model container [2020-12-23 11:22:50,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:50,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 11:22:51,029 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_61349~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__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[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__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[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__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[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__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[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6__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[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7__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[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~0,] left hand side expression in assignment: lhs: VariableLHS[~node8__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[~mode8~0,GLOBAL] 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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_61520~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2020-12-23 11:22:51,290 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-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c[8200,8213] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~0,] 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[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] 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[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] 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[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] 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[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] 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[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] 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[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] 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[~node2____CPAchecker_TMP_0~0,] 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[~node1____CPAchecker_TMP_0~0,] 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[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_61637~0,GLOBAL] [2020-12-23 11:22:51,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:22:51,393 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_61349~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__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[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__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[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__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[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__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[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6__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[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7__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[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~0,] left hand side expression in assignment: lhs: VariableLHS[~node8__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[~mode8~0,GLOBAL] 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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_61520~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2020-12-23 11:22:51,501 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-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c[8200,8213] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~0,] 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[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] 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[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] 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[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] 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[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] 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[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] 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[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] 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[~node2____CPAchecker_TMP_0~0,] 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[~node1____CPAchecker_TMP_0~0,] 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[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_61637~0,GLOBAL] [2020-12-23 11:22:51,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:22:51,601 INFO L208 MainTranslator]: Completed translation [2020-12-23 11:22:51,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51 WrapperNode [2020-12-23 11:22:51,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 11:22:51,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 11:22:51,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 11:22:51,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 11:22:51,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 11:22:51,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 11:22:51,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 11:22:51,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 11:22:51,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (1/1) ... [2020-12-23 11:22:51,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 11:22:51,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 11:22:51,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 11:22:51,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 11:22:51,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (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 11:22:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 11:22:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 11:22:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 11:22:51,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 11:22:52,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 11:22:52,736 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-23 11:22:52,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:22:52 BoogieIcfgContainer [2020-12-23 11:22:52,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 11:22:52,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 11:22:52,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 11:22:52,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 11:22:52,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:22:50" (1/3) ... [2020-12-23 11:22:52,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486adacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:22:52, skipping insertion in model container [2020-12-23 11:22:52,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:51" (2/3) ... [2020-12-23 11:22:52,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486adacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:22:52, skipping insertion in model container [2020-12-23 11:22:52,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:22:52" (3/3) ... [2020-12-23 11:22:52,752 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2020-12-23 11:22:52,759 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 11:22:52,765 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 11:22:52,784 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 11:22:52,815 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 11:22:52,815 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 11:22:52,815 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 11:22:52,815 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 11:22:52,815 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 11:22:52,815 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 11:22:52,816 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 11:22:52,816 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 11:22:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2020-12-23 11:22:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 11:22:52,848 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:52,849 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] [2020-12-23 11:22:52,849 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:52,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:52,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1231322286, now seen corresponding path program 1 times [2020-12-23 11:22:52,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:52,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073074930] [2020-12-23 11:22:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:53,506 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 11:22:53,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073074930] [2020-12-23 11:22:53,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:53,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:53,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692137453] [2020-12-23 11:22:53,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:53,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:53,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:53,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:53,534 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 3 states. [2020-12-23 11:22:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:53,624 INFO L93 Difference]: Finished difference Result 335 states and 554 transitions. [2020-12-23 11:22:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:53,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 11:22:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:53,653 INFO L225 Difference]: With dead ends: 335 [2020-12-23 11:22:53,655 INFO L226 Difference]: Without dead ends: 236 [2020-12-23 11:22:53,663 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 11:22:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-12-23 11:22:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2020-12-23 11:22:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 11:22:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 335 transitions. [2020-12-23 11:22:53,795 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 335 transitions. Word has length 101 [2020-12-23 11:22:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:53,797 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 335 transitions. [2020-12-23 11:22:53,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 335 transitions. [2020-12-23 11:22:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 11:22:53,805 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:53,805 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] [2020-12-23 11:22:53,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 11:22:53,807 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -854475245, now seen corresponding path program 1 times [2020-12-23 11:22:53,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:53,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460618591] [2020-12-23 11:22:53,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:54,077 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 11:22:54,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460618591] [2020-12-23 11:22:54,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:54,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:54,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323450004] [2020-12-23 11:22:54,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:54,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:54,083 INFO L87 Difference]: Start difference. First operand 234 states and 335 transitions. Second operand 3 states. [2020-12-23 11:22:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:54,164 INFO L93 Difference]: Finished difference Result 558 states and 851 transitions. [2020-12-23 11:22:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:54,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-12-23 11:22:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:54,168 INFO L225 Difference]: With dead ends: 558 [2020-12-23 11:22:54,168 INFO L226 Difference]: Without dead ends: 388 [2020-12-23 11:22:54,172 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 11:22:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-23 11:22:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2020-12-23 11:22:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-12-23 11:22:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 577 transitions. [2020-12-23 11:22:54,241 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 577 transitions. Word has length 102 [2020-12-23 11:22:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:54,244 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 577 transitions. [2020-12-23 11:22:54,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 577 transitions. [2020-12-23 11:22:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 11:22:54,249 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:54,249 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] [2020-12-23 11:22:54,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 11:22:54,250 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1444057759, now seen corresponding path program 1 times [2020-12-23 11:22:54,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:54,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509437015] [2020-12-23 11:22:54,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:54,448 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 11:22:54,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509437015] [2020-12-23 11:22:54,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:54,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:54,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781580481] [2020-12-23 11:22:54,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:54,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:54,452 INFO L87 Difference]: Start difference. First operand 386 states and 577 transitions. Second operand 3 states. [2020-12-23 11:22:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:54,538 INFO L93 Difference]: Finished difference Result 998 states and 1551 transitions. [2020-12-23 11:22:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:54,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-23 11:22:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:54,544 INFO L225 Difference]: With dead ends: 998 [2020-12-23 11:22:54,544 INFO L226 Difference]: Without dead ends: 676 [2020-12-23 11:22:54,550 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 11:22:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2020-12-23 11:22:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 674. [2020-12-23 11:22:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-12-23 11:22:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1033 transitions. [2020-12-23 11:22:54,602 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1033 transitions. Word has length 103 [2020-12-23 11:22:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:54,608 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 1033 transitions. [2020-12-23 11:22:54,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1033 transitions. [2020-12-23 11:22:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 11:22:54,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:54,619 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] [2020-12-23 11:22:54,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 11:22:54,620 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1302443314, now seen corresponding path program 1 times [2020-12-23 11:22:54,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:54,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727225758] [2020-12-23 11:22:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:54,774 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 11:22:54,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727225758] [2020-12-23 11:22:54,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:54,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:54,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902726217] [2020-12-23 11:22:54,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:54,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:54,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:54,779 INFO L87 Difference]: Start difference. First operand 674 states and 1033 transitions. Second operand 3 states. [2020-12-23 11:22:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:54,860 INFO L93 Difference]: Finished difference Result 1830 states and 2867 transitions. [2020-12-23 11:22:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:54,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 11:22:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:54,870 INFO L225 Difference]: With dead ends: 1830 [2020-12-23 11:22:54,870 INFO L226 Difference]: Without dead ends: 1220 [2020-12-23 11:22:54,872 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 11:22:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-12-23 11:22:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1218. [2020-12-23 11:22:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2020-12-23 11:22:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1889 transitions. [2020-12-23 11:22:54,933 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1889 transitions. Word has length 104 [2020-12-23 11:22:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:54,934 INFO L481 AbstractCegarLoop]: Abstraction has 1218 states and 1889 transitions. [2020-12-23 11:22:54,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1889 transitions. [2020-12-23 11:22:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 11:22:54,937 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:54,937 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 11:22:54,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 11:22:54,937 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash 342678280, now seen corresponding path program 1 times [2020-12-23 11:22:54,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:54,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182163516] [2020-12-23 11:22:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:55,083 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 11:22:55,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182163516] [2020-12-23 11:22:55,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:55,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:55,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833351048] [2020-12-23 11:22:55,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:55,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:55,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:55,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:55,087 INFO L87 Difference]: Start difference. First operand 1218 states and 1889 transitions. Second operand 3 states. [2020-12-23 11:22:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:55,255 INFO L93 Difference]: Finished difference Result 3398 states and 5331 transitions. [2020-12-23 11:22:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:55,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 11:22:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:55,271 INFO L225 Difference]: With dead ends: 3398 [2020-12-23 11:22:55,272 INFO L226 Difference]: Without dead ends: 2244 [2020-12-23 11:22:55,275 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 11:22:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2020-12-23 11:22:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2242. [2020-12-23 11:22:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2020-12-23 11:22:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3489 transitions. [2020-12-23 11:22:55,454 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3489 transitions. Word has length 105 [2020-12-23 11:22:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:55,455 INFO L481 AbstractCegarLoop]: Abstraction has 2242 states and 3489 transitions. [2020-12-23 11:22:55,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3489 transitions. [2020-12-23 11:22:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 11:22:55,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:55,457 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] [2020-12-23 11:22:55,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 11:22:55,458 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:55,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:55,459 INFO L82 PathProgramCache]: Analyzing trace with hash 504937094, now seen corresponding path program 1 times [2020-12-23 11:22:55,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:55,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432371122] [2020-12-23 11:22:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:55,590 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 11:22:55,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432371122] [2020-12-23 11:22:55,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:55,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:55,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913914022] [2020-12-23 11:22:55,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:55,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:55,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:55,595 INFO L87 Difference]: Start difference. First operand 2242 states and 3489 transitions. Second operand 3 states. [2020-12-23 11:22:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:55,891 INFO L93 Difference]: Finished difference Result 6342 states and 9923 transitions. [2020-12-23 11:22:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:55,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 11:22:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:55,915 INFO L225 Difference]: With dead ends: 6342 [2020-12-23 11:22:55,915 INFO L226 Difference]: Without dead ends: 4164 [2020-12-23 11:22:55,923 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 11:22:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4164 states. [2020-12-23 11:22:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4164 to 4162. [2020-12-23 11:22:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2020-12-23 11:22:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 6465 transitions. [2020-12-23 11:22:56,236 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 6465 transitions. Word has length 106 [2020-12-23 11:22:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:56,237 INFO L481 AbstractCegarLoop]: Abstraction has 4162 states and 6465 transitions. [2020-12-23 11:22:56,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 6465 transitions. [2020-12-23 11:22:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 11:22:56,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:56,240 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 11:22:56,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 11:22:56,240 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash -37721726, now seen corresponding path program 1 times [2020-12-23 11:22:56,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:56,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792583270] [2020-12-23 11:22:56,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:56,352 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 11:22:56,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792583270] [2020-12-23 11:22:56,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:56,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:56,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239802082] [2020-12-23 11:22:56,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:56,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:56,356 INFO L87 Difference]: Start difference. First operand 4162 states and 6465 transitions. Second operand 3 states. [2020-12-23 11:22:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:56,831 INFO L93 Difference]: Finished difference Result 11846 states and 18435 transitions. [2020-12-23 11:22:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:56,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 11:22:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:56,872 INFO L225 Difference]: With dead ends: 11846 [2020-12-23 11:22:56,872 INFO L226 Difference]: Without dead ends: 7748 [2020-12-23 11:22:56,880 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 11:22:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2020-12-23 11:22:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 7746. [2020-12-23 11:22:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7746 states. [2020-12-23 11:22:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7746 states to 7746 states and 11969 transitions. [2020-12-23 11:22:57,419 INFO L78 Accepts]: Start accepts. Automaton has 7746 states and 11969 transitions. Word has length 107 [2020-12-23 11:22:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:57,419 INFO L481 AbstractCegarLoop]: Abstraction has 7746 states and 11969 transitions. [2020-12-23 11:22:57,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7746 states and 11969 transitions. [2020-12-23 11:22:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 11:22:57,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:57,421 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 11:22:57,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 11:22:57,422 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:57,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1757696618, now seen corresponding path program 1 times [2020-12-23 11:22:57,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:57,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228903203] [2020-12-23 11:22:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:57,536 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 11:22:57,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228903203] [2020-12-23 11:22:57,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:57,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:57,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328144210] [2020-12-23 11:22:57,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:57,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:57,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:57,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:57,539 INFO L87 Difference]: Start difference. First operand 7746 states and 11969 transitions. Second operand 3 states. [2020-12-23 11:22:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:58,302 INFO L93 Difference]: Finished difference Result 22086 states and 34115 transitions. [2020-12-23 11:22:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:58,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2020-12-23 11:22:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:58,381 INFO L225 Difference]: With dead ends: 22086 [2020-12-23 11:22:58,381 INFO L226 Difference]: Without dead ends: 14404 [2020-12-23 11:22:58,394 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 11:22:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14404 states. [2020-12-23 11:22:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14404 to 14402. [2020-12-23 11:22:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14402 states. [2020-12-23 11:22:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14402 states to 14402 states and 22081 transitions. [2020-12-23 11:22:59,355 INFO L78 Accepts]: Start accepts. Automaton has 14402 states and 22081 transitions. Word has length 108 [2020-12-23 11:22:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:59,355 INFO L481 AbstractCegarLoop]: Abstraction has 14402 states and 22081 transitions. [2020-12-23 11:22:59,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14402 states and 22081 transitions. [2020-12-23 11:22:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 11:22:59,357 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:59,357 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, 1] [2020-12-23 11:22:59,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 11:22:59,357 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:59,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:59,358 INFO L82 PathProgramCache]: Analyzing trace with hash -42081324, now seen corresponding path program 1 times [2020-12-23 11:22:59,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:59,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277837826] [2020-12-23 11:22:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:59,491 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 11:22:59,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277837826] [2020-12-23 11:22:59,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:59,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:22:59,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845407065] [2020-12-23 11:22:59,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:22:59,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:59,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:22:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:22:59,494 INFO L87 Difference]: Start difference. First operand 14402 states and 22081 transitions. Second operand 5 states. [2020-12-23 11:23:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:00,618 INFO L93 Difference]: Finished difference Result 28740 states and 44098 transitions. [2020-12-23 11:23:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:23:00,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2020-12-23 11:23:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:00,658 INFO L225 Difference]: With dead ends: 28740 [2020-12-23 11:23:00,659 INFO L226 Difference]: Without dead ends: 14402 [2020-12-23 11:23:00,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:23:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14402 states. [2020-12-23 11:23:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14402 to 14402. [2020-12-23 11:23:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14402 states. [2020-12-23 11:23:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14402 states to 14402 states and 21953 transitions. [2020-12-23 11:23:01,827 INFO L78 Accepts]: Start accepts. Automaton has 14402 states and 21953 transitions. Word has length 109 [2020-12-23 11:23:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:01,827 INFO L481 AbstractCegarLoop]: Abstraction has 14402 states and 21953 transitions. [2020-12-23 11:23:01,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:23:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 14402 states and 21953 transitions. [2020-12-23 11:23:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 11:23:01,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:01,829 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, 1] [2020-12-23 11:23:01,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 11:23:01,830 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1231786681, now seen corresponding path program 1 times [2020-12-23 11:23:01,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:01,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456958381] [2020-12-23 11:23:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:01,973 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 11:23:01,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456958381] [2020-12-23 11:23:01,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:01,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:23:01,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289875685] [2020-12-23 11:23:01,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:23:01,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:01,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:23:01,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:23:01,976 INFO L87 Difference]: Start difference. First operand 14402 states and 21953 transitions. Second operand 5 states. [2020-12-23 11:23:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:03,041 INFO L93 Difference]: Finished difference Result 28740 states and 43842 transitions. [2020-12-23 11:23:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:23:03,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2020-12-23 11:23:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:03,076 INFO L225 Difference]: With dead ends: 28740 [2020-12-23 11:23:03,076 INFO L226 Difference]: Without dead ends: 14402 [2020-12-23 11:23:03,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:23:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14402 states. [2020-12-23 11:23:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14402 to 14402. [2020-12-23 11:23:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14402 states. [2020-12-23 11:23:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14402 states to 14402 states and 21825 transitions. [2020-12-23 11:23:03,990 INFO L78 Accepts]: Start accepts. Automaton has 14402 states and 21825 transitions. Word has length 109 [2020-12-23 11:23:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:03,990 INFO L481 AbstractCegarLoop]: Abstraction has 14402 states and 21825 transitions. [2020-12-23 11:23:03,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:23:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 14402 states and 21825 transitions. [2020-12-23 11:23:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 11:23:03,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:03,992 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, 1] [2020-12-23 11:23:03,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 11:23:03,992 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:03,993 INFO L82 PathProgramCache]: Analyzing trace with hash -215242914, now seen corresponding path program 1 times [2020-12-23 11:23:03,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:03,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687487840] [2020-12-23 11:23:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:04,126 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 11:23:04,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687487840] [2020-12-23 11:23:04,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:04,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:23:04,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247246953] [2020-12-23 11:23:04,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:23:04,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:23:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:23:04,130 INFO L87 Difference]: Start difference. First operand 14402 states and 21825 transitions. Second operand 6 states. [2020-12-23 11:23:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:05,975 INFO L93 Difference]: Finished difference Result 42950 states and 65091 transitions. [2020-12-23 11:23:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:23:05,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2020-12-23 11:23:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:06,142 INFO L225 Difference]: With dead ends: 42950 [2020-12-23 11:23:06,143 INFO L226 Difference]: Without dead ends: 28612 [2020-12-23 11:23:06,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:23:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28612 states. [2020-12-23 11:23:07,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28612 to 28610. [2020-12-23 11:23:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28610 states. [2020-12-23 11:23:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28610 states to 28610 states and 43201 transitions. [2020-12-23 11:23:08,011 INFO L78 Accepts]: Start accepts. Automaton has 28610 states and 43201 transitions. Word has length 109 [2020-12-23 11:23:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:08,012 INFO L481 AbstractCegarLoop]: Abstraction has 28610 states and 43201 transitions. [2020-12-23 11:23:08,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:23:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 28610 states and 43201 transitions. [2020-12-23 11:23:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 11:23:08,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:08,013 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, 1] [2020-12-23 11:23:08,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 11:23:08,014 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash -318986663, now seen corresponding path program 1 times [2020-12-23 11:23:08,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:08,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594232773] [2020-12-23 11:23:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:08,143 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 11:23:08,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594232773] [2020-12-23 11:23:08,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:08,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:23:08,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816965482] [2020-12-23 11:23:08,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:23:08,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:08,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:23:08,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:23:08,146 INFO L87 Difference]: Start difference. First operand 28610 states and 43201 transitions. Second operand 6 states. [2020-12-23 11:23:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:11,326 INFO L93 Difference]: Finished difference Result 85446 states and 128963 transitions. [2020-12-23 11:23:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:23:11,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2020-12-23 11:23:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:11,489 INFO L225 Difference]: With dead ends: 85446 [2020-12-23 11:23:11,489 INFO L226 Difference]: Without dead ends: 56900 [2020-12-23 11:23:11,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:23:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56900 states. [2020-12-23 11:23:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56900 to 56898. [2020-12-23 11:23:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56898 states. [2020-12-23 11:23:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56898 states to 56898 states and 85569 transitions. [2020-12-23 11:23:15,005 INFO L78 Accepts]: Start accepts. Automaton has 56898 states and 85569 transitions. Word has length 109 [2020-12-23 11:23:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:15,005 INFO L481 AbstractCegarLoop]: Abstraction has 56898 states and 85569 transitions. [2020-12-23 11:23:15,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:23:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 56898 states and 85569 transitions. [2020-12-23 11:23:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 11:23:15,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:15,007 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, 1] [2020-12-23 11:23:15,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 11:23:15,007 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:15,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:15,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1008398526, now seen corresponding path program 1 times [2020-12-23 11:23:15,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:15,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014751008] [2020-12-23 11:23:15,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:15,103 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 11:23:15,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014751008] [2020-12-23 11:23:15,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:15,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:23:15,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745826902] [2020-12-23 11:23:15,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:23:15,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:15,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:23:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:23:15,105 INFO L87 Difference]: Start difference. First operand 56898 states and 85569 transitions. Second operand 5 states. [2020-12-23 11:23:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:18,605 INFO L93 Difference]: Finished difference Result 113732 states and 171074 transitions. [2020-12-23 11:23:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:23:18,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2020-12-23 11:23:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:18,707 INFO L225 Difference]: With dead ends: 113732 [2020-12-23 11:23:18,707 INFO L226 Difference]: Without dead ends: 56898 [2020-12-23 11:23:18,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:23:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56898 states. [2020-12-23 11:23:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56898 to 56898. [2020-12-23 11:23:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56898 states. [2020-12-23 11:23:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56898 states to 56898 states and 85057 transitions. [2020-12-23 11:23:22,391 INFO L78 Accepts]: Start accepts. Automaton has 56898 states and 85057 transitions. Word has length 109 [2020-12-23 11:23:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:22,391 INFO L481 AbstractCegarLoop]: Abstraction has 56898 states and 85057 transitions. [2020-12-23 11:23:22,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:23:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56898 states and 85057 transitions. [2020-12-23 11:23:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 11:23:22,392 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:22,392 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, 1] [2020-12-23 11:23:22,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 11:23:22,392 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:22,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:22,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1565237895, now seen corresponding path program 1 times [2020-12-23 11:23:22,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:22,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677705608] [2020-12-23 11:23:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:22,484 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 11:23:22,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677705608] [2020-12-23 11:23:22,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:22,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:23:22,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995043828] [2020-12-23 11:23:22,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:23:22,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:23:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:23:22,486 INFO L87 Difference]: Start difference. First operand 56898 states and 85057 transitions. Second operand 5 states. [2020-12-23 11:23:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:26,112 INFO L93 Difference]: Finished difference Result 113732 states and 170050 transitions. [2020-12-23 11:23:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:23:26,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2020-12-23 11:23:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:26,186 INFO L225 Difference]: With dead ends: 113732 [2020-12-23 11:23:26,186 INFO L226 Difference]: Without dead ends: 56898 [2020-12-23 11:23:26,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:23:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56898 states. [2020-12-23 11:23:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56898 to 56898. [2020-12-23 11:23:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56898 states. [2020-12-23 11:23:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56898 states to 56898 states and 84545 transitions. [2020-12-23 11:23:29,983 INFO L78 Accepts]: Start accepts. Automaton has 56898 states and 84545 transitions. Word has length 109 [2020-12-23 11:23:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:29,989 INFO L481 AbstractCegarLoop]: Abstraction has 56898 states and 84545 transitions. [2020-12-23 11:23:29,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:23:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 56898 states and 84545 transitions. [2020-12-23 11:23:29,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 11:23:29,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:29,990 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, 1] [2020-12-23 11:23:29,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 11:23:29,991 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash -29839970, now seen corresponding path program 1 times [2020-12-23 11:23:29,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:29,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528072857] [2020-12-23 11:23:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:30,248 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 11:23:30,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528072857] [2020-12-23 11:23:30,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:30,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:23:30,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016016701] [2020-12-23 11:23:30,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:23:30,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:30,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:23:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:23:30,250 INFO L87 Difference]: Start difference. First operand 56898 states and 84545 transitions. Second operand 10 states. [2020-12-23 11:24:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:24:32,046 INFO L93 Difference]: Finished difference Result 909408 states and 1351760 transitions. [2020-12-23 11:24:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 11:24:32,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2020-12-23 11:24:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:24:34,187 INFO L225 Difference]: With dead ends: 909408 [2020-12-23 11:24:34,187 INFO L226 Difference]: Without dead ends: 852574 [2020-12-23 11:24:34,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2020-12-23 11:24:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852574 states. [2020-12-23 11:24:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852574 to 113730. [2020-12-23 11:24:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113730 states. [2020-12-23 11:24:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113730 states to 113730 states and 166977 transitions. [2020-12-23 11:24:55,624 INFO L78 Accepts]: Start accepts. Automaton has 113730 states and 166977 transitions. Word has length 109 [2020-12-23 11:24:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:24:55,624 INFO L481 AbstractCegarLoop]: Abstraction has 113730 states and 166977 transitions. [2020-12-23 11:24:55,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:24:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 113730 states and 166977 transitions. [2020-12-23 11:24:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 11:24:55,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:24:55,629 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, 1, 1, 1] [2020-12-23 11:24:55,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 11:24:55,630 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:24:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:24:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash 487745753, now seen corresponding path program 1 times [2020-12-23 11:24:55,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:24:55,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006203577] [2020-12-23 11:24:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:24:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:24:56,263 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 11:24:56,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006203577] [2020-12-23 11:24:56,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:24:56,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:24:56,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944402568] [2020-12-23 11:24:56,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:24:56,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:24:56,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:24:56,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:24:56,265 INFO L87 Difference]: Start difference. First operand 113730 states and 166977 transitions. Second operand 10 states. [2020-12-23 11:24:56,714 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-12-23 11:24:56,842 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-12-23 11:25:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:25:25,808 INFO L93 Difference]: Finished difference Result 341066 states and 502853 transitions. [2020-12-23 11:25:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:25:25,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 111 [2020-12-23 11:25:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:25:26,239 INFO L225 Difference]: With dead ends: 341066 [2020-12-23 11:25:26,239 INFO L226 Difference]: Without dead ends: 227400 [2020-12-23 11:25:26,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:25:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227400 states. [2020-12-23 11:25:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227400 to 113730. [2020-12-23 11:25:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113730 states. [2020-12-23 11:25:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113730 states to 113730 states and 165953 transitions. [2020-12-23 11:25:43,693 INFO L78 Accepts]: Start accepts. Automaton has 113730 states and 165953 transitions. Word has length 111 [2020-12-23 11:25:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:25:43,693 INFO L481 AbstractCegarLoop]: Abstraction has 113730 states and 165953 transitions. [2020-12-23 11:25:43,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:25:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 113730 states and 165953 transitions. [2020-12-23 11:25:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 11:25:43,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:25:43,694 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, 1, 1, 1] [2020-12-23 11:25:43,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 11:25:43,702 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:25:43,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:25:43,703 INFO L82 PathProgramCache]: Analyzing trace with hash 466743098, now seen corresponding path program 1 times [2020-12-23 11:25:43,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:25:43,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700609779] [2020-12-23 11:25:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:25:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:25:43,778 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 11:25:43,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700609779] [2020-12-23 11:25:43,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:25:43,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:25:43,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428117308] [2020-12-23 11:25:43,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:25:43,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:25:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:25:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:25:43,781 INFO L87 Difference]: Start difference. First operand 113730 states and 165953 transitions. Second operand 3 states. [2020-12-23 11:26:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:26:03,697 INFO L93 Difference]: Finished difference Result 255176 states and 371909 transitions. [2020-12-23 11:26:03,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:26:03,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-23 11:26:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:26:03,934 INFO L225 Difference]: With dead ends: 255176 [2020-12-23 11:26:03,934 INFO L226 Difference]: Without dead ends: 141510 [2020-12-23 11:26:04,235 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 11:26:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141510 states.