/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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:55:41,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:55:41,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:55:41,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:55:41,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:55:41,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:55:41,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:55:41,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:55:41,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:55:41,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:55:41,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:55:41,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:55:41,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:55:41,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:55:41,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:55:41,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:55:41,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:55:41,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:55:41,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:55:41,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:55:41,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:55:41,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:55:41,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:55:41,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:55:41,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:55:41,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:55:41,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:55:41,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:55:41,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:55:41,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:55:41,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:55:41,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:55:41,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:55:41,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:55:41,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:55:41,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:55:42,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:55:42,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:55:42,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:55:42,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:55:42,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:55:42,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 20:55:42,056 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:55:42,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:55:42,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:55:42,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:55:42,062 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:55:42,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:55:42,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:55:42,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:55:42,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:55:42,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:55:42,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:55:42,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:55:42,065 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:55:42,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:55:42,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:55:42,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:55:42,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:55:42,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:55:42,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:55:42,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:55:42,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:55:42,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:55:42,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:55:42,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:55:42,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:55:42,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 20:55:42,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:55:42,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:55:42,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:55:42,493 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:55:42,493 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:55:42,494 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2021-01-06 20:55:42,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/565dfccb7/76485e8d734a43de89d367e738f9305d/FLAG7c5960944 [2021-01-06 20:55:43,272 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:55:43,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2021-01-06 20:55:43,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/565dfccb7/76485e8d734a43de89d367e738f9305d/FLAG7c5960944 [2021-01-06 20:55:43,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/565dfccb7/76485e8d734a43de89d367e738f9305d [2021-01-06 20:55:43,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:55:43,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:55:43,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:55:43,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:55:43,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:55:43,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:55:43" (1/1) ... [2021-01-06 20:55:43,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b99d2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:43, skipping insertion in model container [2021-01-06 20:55:43,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:55:43" (1/1) ... [2021-01-06 20:55:43,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:55:43,643 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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_95~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] 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[~node2__m2~0,] 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[~node3__m3~0,] 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[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_413~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,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1142~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 20:55:43,898 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5413,5426] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~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[~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[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_399~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_1032~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~3,] [2021-01-06 20:55:43,929 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8066,8079] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~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[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] 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[~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[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_385~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_5~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~4,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~check__tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__return_939~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_6~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~5,] [2021-01-06 20:55:43,975 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[10873,10886] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] 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[~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[~check__tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~__return_371~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_7~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~6,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~check__tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__return_846~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_8~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~7,] [2021-01-06 20:55:44,016 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13428,13441] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~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[~node2__m2~5,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] 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[~node3__m3~6,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] 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[~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[~check__tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_357~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_9~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~8,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~__return_764~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_10~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~9,] [2021-01-06 20:55:44,039 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16434,16447] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] 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[~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[~check__tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_343~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_11~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~10,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_671~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_12~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~11,] [2021-01-06 20:55:44,071 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19004,19017] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] 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[~node3__m3~9,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] 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[~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[~check__tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_329~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_13~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~12,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~check__tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__return_592~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_14~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~13,] [2021-01-06 20:55:44,106 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[21764,21777] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] 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[~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[~check__tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__return_315~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~14,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~check__tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__return_513~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~15,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_1291~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] 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[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] 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[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] [2021-01-06 20:55:44,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:55:44,174 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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_95~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] 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[~node2__m2~0,] 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[~node3__m3~0,] 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[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_413~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,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1142~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 20:55:44,226 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5413,5426] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~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[~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[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_399~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_1032~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~3,] [2021-01-06 20:55:44,247 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8066,8079] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~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[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] 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[~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[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_385~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_5~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~4,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~check__tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__return_939~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_6~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~5,] [2021-01-06 20:55:44,279 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[10873,10886] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] 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[~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[~check__tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~__return_371~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_7~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~6,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~check__tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__return_846~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_8~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~7,] [2021-01-06 20:55:44,292 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13428,13441] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~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[~node2__m2~5,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] 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[~node3__m3~6,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] 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[~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[~check__tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_357~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_9~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~8,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~__return_764~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_10~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~9,] [2021-01-06 20:55:44,307 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16434,16447] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] 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[~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[~check__tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_343~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_11~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~10,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_671~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_12~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~11,] [2021-01-06 20:55:44,321 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19004,19017] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] 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[~node3__m3~9,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] 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[~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[~check__tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_329~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_13~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~12,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~check__tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__return_592~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_14~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~13,] [2021-01-06 20:55:44,335 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[21764,21777] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] 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[~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[~check__tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__return_315~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~14,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~check__tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__return_513~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~15,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_1291~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] 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[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] 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[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] [2021-01-06 20:55:44,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:55:44,411 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:55:44,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44 WrapperNode [2021-01-06 20:55:44,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:55:44,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:55:44,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:55:44,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:55:44,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:55:44,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:55:44,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:55:44,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:55:44,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... [2021-01-06 20:55:44,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:55:44,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:55:44,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:55:44,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:55:44,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:55:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:55:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:55:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:55:44,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:55:45,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:55:45,986 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:55:45,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:55:45 BoogieIcfgContainer [2021-01-06 20:55:45,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:55:45,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:55:45,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:55:45,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:55:45,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:55:43" (1/3) ... [2021-01-06 20:55:46,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9fab0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:55:45, skipping insertion in model container [2021-01-06 20:55:46,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:55:44" (2/3) ... [2021-01-06 20:55:46,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9fab0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:55:46, skipping insertion in model container [2021-01-06 20:55:46,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:55:45" (3/3) ... [2021-01-06 20:55:46,005 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2021-01-06 20:55:46,013 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:55:46,026 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2021-01-06 20:55:46,050 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-06 20:55:46,101 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:55:46,101 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:55:46,102 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:55:46,102 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:55:46,102 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:55:46,103 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:55:46,103 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:55:46,103 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:55:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2021-01-06 20:55:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 20:55:46,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:46,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:46,147 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:46,154 INFO L82 PathProgramCache]: Analyzing trace with hash -102713619, now seen corresponding path program 1 times [2021-01-06 20:55:46,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:46,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084434007] [2021-01-06 20:55:46,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:46,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084434007] [2021-01-06 20:55:46,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:46,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:55:46,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828872180] [2021-01-06 20:55:46,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:55:46,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:46,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:55:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:55:46,714 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 5 states. [2021-01-06 20:55:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:47,057 INFO L93 Difference]: Finished difference Result 375 states and 642 transitions. [2021-01-06 20:55:47,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:55:47,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2021-01-06 20:55:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:47,073 INFO L225 Difference]: With dead ends: 375 [2021-01-06 20:55:47,074 INFO L226 Difference]: Without dead ends: 231 [2021-01-06 20:55:47,078 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 [2021-01-06 20:55:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-06 20:55:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2021-01-06 20:55:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2021-01-06 20:55:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 288 transitions. [2021-01-06 20:55:47,163 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 288 transitions. Word has length 47 [2021-01-06 20:55:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:47,164 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 288 transitions. [2021-01-06 20:55:47,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:55:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 288 transitions. [2021-01-06 20:55:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 20:55:47,171 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:47,172 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] [2021-01-06 20:55:47,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:55:47,172 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:47,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:47,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1937910484, now seen corresponding path program 1 times [2021-01-06 20:55:47,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:47,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175699131] [2021-01-06 20:55:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:47,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175699131] [2021-01-06 20:55:47,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:47,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:55:47,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472251839] [2021-01-06 20:55:47,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:55:47,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:55:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:55:47,395 INFO L87 Difference]: Start difference. First operand 231 states and 288 transitions. Second operand 5 states. [2021-01-06 20:55:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:47,675 INFO L93 Difference]: Finished difference Result 299 states and 376 transitions. [2021-01-06 20:55:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:55:47,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2021-01-06 20:55:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:47,683 INFO L225 Difference]: With dead ends: 299 [2021-01-06 20:55:47,683 INFO L226 Difference]: Without dead ends: 177 [2021-01-06 20:55:47,690 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 [2021-01-06 20:55:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-01-06 20:55:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-01-06 20:55:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2021-01-06 20:55:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 219 transitions. [2021-01-06 20:55:47,731 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 219 transitions. Word has length 47 [2021-01-06 20:55:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:47,731 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 219 transitions. [2021-01-06 20:55:47,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:55:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2021-01-06 20:55:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 20:55:47,733 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:47,733 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] [2021-01-06 20:55:47,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:55:47,736 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 458596476, now seen corresponding path program 1 times [2021-01-06 20:55:47,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:47,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215521954] [2021-01-06 20:55:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:47,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215521954] [2021-01-06 20:55:47,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:47,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:55:47,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666363231] [2021-01-06 20:55:47,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:55:47,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:55:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:55:47,889 INFO L87 Difference]: Start difference. First operand 177 states and 219 transitions. Second operand 5 states. [2021-01-06 20:55:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:48,050 INFO L93 Difference]: Finished difference Result 255 states and 323 transitions. [2021-01-06 20:55:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:55:48,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2021-01-06 20:55:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:48,053 INFO L225 Difference]: With dead ends: 255 [2021-01-06 20:55:48,053 INFO L226 Difference]: Without dead ends: 155 [2021-01-06 20:55:48,054 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 [2021-01-06 20:55:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-01-06 20:55:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-01-06 20:55:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-01-06 20:55:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2021-01-06 20:55:48,069 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 47 [2021-01-06 20:55:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:48,069 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2021-01-06 20:55:48,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:55:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2021-01-06 20:55:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:55:48,071 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:48,071 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] [2021-01-06 20:55:48,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:55:48,071 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1498085814, now seen corresponding path program 1 times [2021-01-06 20:55:48,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:48,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031759878] [2021-01-06 20:55:48,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:48,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031759878] [2021-01-06 20:55:48,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:48,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:55:48,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314493931] [2021-01-06 20:55:48,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:55:48,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:48,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:55:48,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:55:48,293 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand 9 states. [2021-01-06 20:55:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:49,138 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2021-01-06 20:55:49,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:55:49,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2021-01-06 20:55:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:49,142 INFO L225 Difference]: With dead ends: 330 [2021-01-06 20:55:49,142 INFO L226 Difference]: Without dead ends: 325 [2021-01-06 20:55:49,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:55:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-06 20:55:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 155. [2021-01-06 20:55:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-01-06 20:55:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 191 transitions. [2021-01-06 20:55:49,162 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 191 transitions. Word has length 48 [2021-01-06 20:55:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:49,163 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 191 transitions. [2021-01-06 20:55:49,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:55:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 191 transitions. [2021-01-06 20:55:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:55:49,164 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:49,164 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] [2021-01-06 20:55:49,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:55:49,165 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash 267052195, now seen corresponding path program 1 times [2021-01-06 20:55:49,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:49,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617900134] [2021-01-06 20:55:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:49,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617900134] [2021-01-06 20:55:49,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:49,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:55:49,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484418406] [2021-01-06 20:55:49,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:55:49,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:55:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:55:49,334 INFO L87 Difference]: Start difference. First operand 155 states and 191 transitions. Second operand 9 states. [2021-01-06 20:55:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:49,974 INFO L93 Difference]: Finished difference Result 389 states and 517 transitions. [2021-01-06 20:55:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:55:49,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2021-01-06 20:55:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:49,978 INFO L225 Difference]: With dead ends: 389 [2021-01-06 20:55:49,978 INFO L226 Difference]: Without dead ends: 329 [2021-01-06 20:55:49,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:55:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-01-06 20:55:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 155. [2021-01-06 20:55:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-01-06 20:55:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2021-01-06 20:55:49,995 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 48 [2021-01-06 20:55:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:49,996 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2021-01-06 20:55:49,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:55:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2021-01-06 20:55:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:55:49,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:49,997 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] [2021-01-06 20:55:49,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:55:49,998 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1788008380, now seen corresponding path program 1 times [2021-01-06 20:55:49,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:49,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277490521] [2021-01-06 20:55:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:50,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277490521] [2021-01-06 20:55:50,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:50,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:55:50,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016311960] [2021-01-06 20:55:50,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 20:55:50,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 20:55:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:55:50,153 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand 8 states. [2021-01-06 20:55:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:50,561 INFO L93 Difference]: Finished difference Result 310 states and 390 transitions. [2021-01-06 20:55:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 20:55:50,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2021-01-06 20:55:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:50,565 INFO L225 Difference]: With dead ends: 310 [2021-01-06 20:55:50,565 INFO L226 Difference]: Without dead ends: 227 [2021-01-06 20:55:50,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:55:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-01-06 20:55:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 155. [2021-01-06 20:55:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-01-06 20:55:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2021-01-06 20:55:50,584 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 48 [2021-01-06 20:55:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:50,585 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2021-01-06 20:55:50,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 20:55:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2021-01-06 20:55:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:55:50,586 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:50,587 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] [2021-01-06 20:55:50,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:55:50,587 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:50,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1932349207, now seen corresponding path program 1 times [2021-01-06 20:55:50,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:50,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721239690] [2021-01-06 20:55:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:51,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721239690] [2021-01-06 20:55:51,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:51,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:55:51,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891650010] [2021-01-06 20:55:51,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:55:51,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:51,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:55:51,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:55:51,254 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand 19 states. [2021-01-06 20:55:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:53,524 INFO L93 Difference]: Finished difference Result 402 states and 505 transitions. [2021-01-06 20:55:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:55:53,524 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2021-01-06 20:55:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:53,528 INFO L225 Difference]: With dead ends: 402 [2021-01-06 20:55:53,528 INFO L226 Difference]: Without dead ends: 398 [2021-01-06 20:55:53,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2021-01-06 20:55:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-01-06 20:55:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 165. [2021-01-06 20:55:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 20:55:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2021-01-06 20:55:53,553 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 50 [2021-01-06 20:55:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:53,554 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2021-01-06 20:55:53,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:55:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2021-01-06 20:55:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:55:53,555 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:53,555 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] [2021-01-06 20:55:53,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:55:53,556 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1779763646, now seen corresponding path program 1 times [2021-01-06 20:55:53,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:53,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946276548] [2021-01-06 20:55:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:54,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946276548] [2021-01-06 20:55:54,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:54,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:55:54,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570891015] [2021-01-06 20:55:54,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:55:54,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:54,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:55:54,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:55:54,120 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand 19 states. [2021-01-06 20:55:54,323 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2021-01-06 20:55:54,835 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2021-01-06 20:55:55,367 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2021-01-06 20:55:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:56,481 INFO L93 Difference]: Finished difference Result 438 states and 562 transitions. [2021-01-06 20:55:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 20:55:56,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2021-01-06 20:55:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:56,484 INFO L225 Difference]: With dead ends: 438 [2021-01-06 20:55:56,484 INFO L226 Difference]: Without dead ends: 391 [2021-01-06 20:55:56,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 20:55:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-01-06 20:55:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 171. [2021-01-06 20:55:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2021-01-06 20:55:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 212 transitions. [2021-01-06 20:55:56,509 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 212 transitions. Word has length 50 [2021-01-06 20:55:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:56,509 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 212 transitions. [2021-01-06 20:55:56,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:55:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 212 transitions. [2021-01-06 20:55:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:55:56,510 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:56,510 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] [2021-01-06 20:55:56,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:55:56,511 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1793833253, now seen corresponding path program 1 times [2021-01-06 20:55:56,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:56,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275916531] [2021-01-06 20:55:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:57,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275916531] [2021-01-06 20:55:57,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:57,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:55:57,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870603355] [2021-01-06 20:55:57,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:55:57,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:55:57,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:55:57,078 INFO L87 Difference]: Start difference. First operand 171 states and 212 transitions. Second operand 19 states. [2021-01-06 20:55:57,313 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2021-01-06 20:55:57,906 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-01-06 20:55:58,097 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-06 20:55:58,250 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-01-06 20:55:58,394 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-01-06 20:55:58,718 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2021-01-06 20:56:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:00,303 INFO L93 Difference]: Finished difference Result 450 states and 593 transitions. [2021-01-06 20:56:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 20:56:00,304 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2021-01-06 20:56:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:00,307 INFO L225 Difference]: With dead ends: 450 [2021-01-06 20:56:00,307 INFO L226 Difference]: Without dead ends: 444 [2021-01-06 20:56:00,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=306, Invalid=1026, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 20:56:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-01-06 20:56:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 171. [2021-01-06 20:56:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2021-01-06 20:56:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2021-01-06 20:56:00,333 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 50 [2021-01-06 20:56:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:00,333 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2021-01-06 20:56:00,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:56:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2021-01-06 20:56:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:56:00,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:00,335 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] [2021-01-06 20:56:00,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:56:00,335 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1827600366, now seen corresponding path program 1 times [2021-01-06 20:56:00,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:00,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431741329] [2021-01-06 20:56:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:00,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431741329] [2021-01-06 20:56:00,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:00,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 20:56:00,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14766762] [2021-01-06 20:56:00,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 20:56:00,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:00,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 20:56:00,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-06 20:56:00,715 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand 12 states. [2021-01-06 20:56:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:01,708 INFO L93 Difference]: Finished difference Result 378 states and 502 transitions. [2021-01-06 20:56:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:56:01,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2021-01-06 20:56:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:01,712 INFO L225 Difference]: With dead ends: 378 [2021-01-06 20:56:01,712 INFO L226 Difference]: Without dead ends: 324 [2021-01-06 20:56:01,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:56:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-01-06 20:56:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 160. [2021-01-06 20:56:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2021-01-06 20:56:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2021-01-06 20:56:01,737 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 50 [2021-01-06 20:56:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:01,737 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2021-01-06 20:56:01,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 20:56:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2021-01-06 20:56:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:56:01,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:01,738 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] [2021-01-06 20:56:01,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:56:01,738 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash -767196360, now seen corresponding path program 1 times [2021-01-06 20:56:01,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:01,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185535864] [2021-01-06 20:56:01,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:01,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185535864] [2021-01-06 20:56:01,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:01,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:56:01,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917443857] [2021-01-06 20:56:01,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:56:01,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:01,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:56:01,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:56:01,857 INFO L87 Difference]: Start difference. First operand 160 states and 199 transitions. Second operand 9 states. [2021-01-06 20:56:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:02,349 INFO L93 Difference]: Finished difference Result 239 states and 299 transitions. [2021-01-06 20:56:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 20:56:02,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2021-01-06 20:56:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:02,352 INFO L225 Difference]: With dead ends: 239 [2021-01-06 20:56:02,352 INFO L226 Difference]: Without dead ends: 232 [2021-01-06 20:56:02,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:56:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-01-06 20:56:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 160. [2021-01-06 20:56:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2021-01-06 20:56:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 197 transitions. [2021-01-06 20:56:02,376 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 197 transitions. Word has length 51 [2021-01-06 20:56:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:02,376 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 197 transitions. [2021-01-06 20:56:02,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:56:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2021-01-06 20:56:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:56:02,377 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:02,377 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] [2021-01-06 20:56:02,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:56:02,378 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:02,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1195663953, now seen corresponding path program 1 times [2021-01-06 20:56:02,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:02,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243736332] [2021-01-06 20:56:02,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:02,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243736332] [2021-01-06 20:56:02,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:02,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 20:56:02,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362259431] [2021-01-06 20:56:02,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:56:02,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:02,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:56:02,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:56:02,530 INFO L87 Difference]: Start difference. First operand 160 states and 197 transitions. Second operand 10 states. [2021-01-06 20:56:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:03,844 INFO L93 Difference]: Finished difference Result 467 states and 621 transitions. [2021-01-06 20:56:03,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:56:03,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2021-01-06 20:56:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:03,846 INFO L225 Difference]: With dead ends: 467 [2021-01-06 20:56:03,846 INFO L226 Difference]: Without dead ends: 406 [2021-01-06 20:56:03,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2021-01-06 20:56:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-01-06 20:56:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 160. [2021-01-06 20:56:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2021-01-06 20:56:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 196 transitions. [2021-01-06 20:56:03,871 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 196 transitions. Word has length 51 [2021-01-06 20:56:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:03,872 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 196 transitions. [2021-01-06 20:56:03,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:56:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions. [2021-01-06 20:56:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:56:03,873 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:03,873 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] [2021-01-06 20:56:03,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:56:03,873 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash 72941877, now seen corresponding path program 1 times [2021-01-06 20:56:03,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:03,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180512146] [2021-01-06 20:56:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:04,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180512146] [2021-01-06 20:56:04,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:04,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:56:04,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014764420] [2021-01-06 20:56:04,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:56:04,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:56:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:56:04,518 INFO L87 Difference]: Start difference. First operand 160 states and 196 transitions. Second operand 16 states. [2021-01-06 20:56:05,054 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-01-06 20:56:05,257 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2021-01-06 20:56:05,438 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-06 20:56:05,604 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-06 20:56:05,812 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-01-06 20:56:06,000 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-01-06 20:56:06,430 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-01-06 20:56:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:08,043 INFO L93 Difference]: Finished difference Result 871 states and 1203 transitions. [2021-01-06 20:56:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 20:56:08,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2021-01-06 20:56:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:08,048 INFO L225 Difference]: With dead ends: 871 [2021-01-06 20:56:08,048 INFO L226 Difference]: Without dead ends: 855 [2021-01-06 20:56:08,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 20:56:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-01-06 20:56:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 152. [2021-01-06 20:56:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-01-06 20:56:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2021-01-06 20:56:08,083 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 51 [2021-01-06 20:56:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:08,083 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2021-01-06 20:56:08,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:56:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2021-01-06 20:56:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:56:08,084 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:08,084 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] [2021-01-06 20:56:08,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:56:08,084 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash -314877430, now seen corresponding path program 1 times [2021-01-06 20:56:08,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:08,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541014486] [2021-01-06 20:56:08,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:08,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541014486] [2021-01-06 20:56:08,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:08,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:56:08,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236337542] [2021-01-06 20:56:08,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:56:08,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:56:08,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:56:08,258 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand 11 states. [2021-01-06 20:56:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:10,460 INFO L93 Difference]: Finished difference Result 636 states and 864 transitions. [2021-01-06 20:56:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 20:56:10,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2021-01-06 20:56:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:10,464 INFO L225 Difference]: With dead ends: 636 [2021-01-06 20:56:10,464 INFO L226 Difference]: Without dead ends: 629 [2021-01-06 20:56:10,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=374, Invalid=1186, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 20:56:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-01-06 20:56:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 152. [2021-01-06 20:56:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-01-06 20:56:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2021-01-06 20:56:10,497 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 185 transitions. Word has length 51 [2021-01-06 20:56:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:10,497 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 185 transitions. [2021-01-06 20:56:10,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:56:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2021-01-06 20:56:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:56:10,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:10,498 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] [2021-01-06 20:56:10,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:56:10,498 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1266894549, now seen corresponding path program 1 times [2021-01-06 20:56:10,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:10,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8885226] [2021-01-06 20:56:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:10,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8885226] [2021-01-06 20:56:10,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:10,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:56:10,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530713789] [2021-01-06 20:56:10,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:56:10,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:56:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:56:10,979 INFO L87 Difference]: Start difference. First operand 152 states and 185 transitions. Second operand 16 states. [2021-01-06 20:56:11,946 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2021-01-06 20:56:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:12,536 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2021-01-06 20:56:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 20:56:12,537 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2021-01-06 20:56:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:12,538 INFO L225 Difference]: With dead ends: 273 [2021-01-06 20:56:12,538 INFO L226 Difference]: Without dead ends: 226 [2021-01-06 20:56:12,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-01-06 20:56:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-01-06 20:56:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 146. [2021-01-06 20:56:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 20:56:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2021-01-06 20:56:12,568 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 51 [2021-01-06 20:56:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:12,569 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2021-01-06 20:56:12,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:56:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2021-01-06 20:56:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:56:12,569 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:12,570 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] [2021-01-06 20:56:12,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:56:12,570 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:12,570 INFO L82 PathProgramCache]: Analyzing trace with hash -611388429, now seen corresponding path program 1 times [2021-01-06 20:56:12,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:12,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960779343] [2021-01-06 20:56:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:12,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960779343] [2021-01-06 20:56:12,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:12,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:56:12,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329945261] [2021-01-06 20:56:12,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:56:12,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:12,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:56:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:56:12,682 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 9 states. [2021-01-06 20:56:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:13,197 INFO L93 Difference]: Finished difference Result 271 states and 348 transitions. [2021-01-06 20:56:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:56:13,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2021-01-06 20:56:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:13,198 INFO L225 Difference]: With dead ends: 271 [2021-01-06 20:56:13,199 INFO L226 Difference]: Without dead ends: 210 [2021-01-06 20:56:13,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:56:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-01-06 20:56:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2021-01-06 20:56:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 20:56:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2021-01-06 20:56:13,236 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 52 [2021-01-06 20:56:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:13,236 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2021-01-06 20:56:13,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:56:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2021-01-06 20:56:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:56:13,237 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:13,237 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] [2021-01-06 20:56:13,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:56:13,238 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash 966049747, now seen corresponding path program 1 times [2021-01-06 20:56:13,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:13,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061629387] [2021-01-06 20:56:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:13,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061629387] [2021-01-06 20:56:13,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:13,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:56:13,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797619230] [2021-01-06 20:56:13,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:56:13,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:13,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:56:13,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:56:13,353 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand 9 states. [2021-01-06 20:56:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:13,880 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2021-01-06 20:56:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:56:13,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2021-01-06 20:56:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:13,881 INFO L225 Difference]: With dead ends: 227 [2021-01-06 20:56:13,882 INFO L226 Difference]: Without dead ends: 220 [2021-01-06 20:56:13,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:56:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-01-06 20:56:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 142. [2021-01-06 20:56:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-06 20:56:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 171 transitions. [2021-01-06 20:56:13,917 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 171 transitions. Word has length 52 [2021-01-06 20:56:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:13,917 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 171 transitions. [2021-01-06 20:56:13,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:56:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 171 transitions. [2021-01-06 20:56:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:56:13,918 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:13,918 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] [2021-01-06 20:56:13,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:56:13,918 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:13,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1837589620, now seen corresponding path program 1 times [2021-01-06 20:56:13,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:13,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047015809] [2021-01-06 20:56:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:14,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047015809] [2021-01-06 20:56:14,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:14,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:56:14,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845836827] [2021-01-06 20:56:14,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:56:14,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:56:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:56:14,388 INFO L87 Difference]: Start difference. First operand 142 states and 171 transitions. Second operand 18 states. [2021-01-06 20:56:14,567 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-01-06 20:56:15,149 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-01-06 20:56:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:17,063 INFO L93 Difference]: Finished difference Result 450 states and 589 transitions. [2021-01-06 20:56:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 20:56:17,064 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2021-01-06 20:56:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:17,067 INFO L225 Difference]: With dead ends: 450 [2021-01-06 20:56:17,067 INFO L226 Difference]: Without dead ends: 444 [2021-01-06 20:56:17,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2021-01-06 20:56:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-01-06 20:56:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 148. [2021-01-06 20:56:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2021-01-06 20:56:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2021-01-06 20:56:17,107 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 53 [2021-01-06 20:56:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:17,107 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2021-01-06 20:56:17,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:56:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2021-01-06 20:56:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:56:17,108 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:17,108 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] [2021-01-06 20:56:17,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 20:56:17,108 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:17,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:17,109 INFO L82 PathProgramCache]: Analyzing trace with hash 916052531, now seen corresponding path program 1 times [2021-01-06 20:56:17,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:17,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005826273] [2021-01-06 20:56:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:17,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005826273] [2021-01-06 20:56:17,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:17,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:56:17,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909271310] [2021-01-06 20:56:17,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:56:17,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:17,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:56:17,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:56:17,423 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand 16 states. [2021-01-06 20:56:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:19,296 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2021-01-06 20:56:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 20:56:19,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2021-01-06 20:56:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:19,303 INFO L225 Difference]: With dead ends: 352 [2021-01-06 20:56:19,303 INFO L226 Difference]: Without dead ends: 344 [2021-01-06 20:56:19,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2021-01-06 20:56:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-01-06 20:56:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 148. [2021-01-06 20:56:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2021-01-06 20:56:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 178 transitions. [2021-01-06 20:56:19,341 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 178 transitions. Word has length 53 [2021-01-06 20:56:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:19,341 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 178 transitions. [2021-01-06 20:56:19,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:56:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 178 transitions. [2021-01-06 20:56:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:56:19,342 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:19,342 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] [2021-01-06 20:56:19,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 20:56:19,343 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:19,343 INFO L82 PathProgramCache]: Analyzing trace with hash 202849221, now seen corresponding path program 1 times [2021-01-06 20:56:19,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:19,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85482711] [2021-01-06 20:56:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:19,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85482711] [2021-01-06 20:56:19,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:19,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:56:19,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869769711] [2021-01-06 20:56:19,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:56:19,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:56:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:56:19,785 INFO L87 Difference]: Start difference. First operand 148 states and 178 transitions. Second operand 18 states. [2021-01-06 20:56:19,980 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2021-01-06 20:56:20,487 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2021-01-06 20:56:20,975 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2021-01-06 20:56:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:22,163 INFO L93 Difference]: Finished difference Result 352 states and 447 transitions. [2021-01-06 20:56:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:56:22,164 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2021-01-06 20:56:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:22,166 INFO L225 Difference]: With dead ends: 352 [2021-01-06 20:56:22,166 INFO L226 Difference]: Without dead ends: 344 [2021-01-06 20:56:22,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2021-01-06 20:56:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-01-06 20:56:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 153. [2021-01-06 20:56:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2021-01-06 20:56:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2021-01-06 20:56:22,214 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 53 [2021-01-06 20:56:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:22,214 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2021-01-06 20:56:22,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:56:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2021-01-06 20:56:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:56:22,215 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:22,215 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] [2021-01-06 20:56:22,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 20:56:22,215 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 576756188, now seen corresponding path program 1 times [2021-01-06 20:56:22,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:22,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275490590] [2021-01-06 20:56:22,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:22,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275490590] [2021-01-06 20:56:22,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:22,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:56:22,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112952105] [2021-01-06 20:56:22,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:56:22,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:22,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:56:22,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:56:22,977 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand 18 states. [2021-01-06 20:56:23,372 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2021-01-06 20:56:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:25,315 INFO L93 Difference]: Finished difference Result 520 states and 700 transitions. [2021-01-06 20:56:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 20:56:25,316 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2021-01-06 20:56:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:25,319 INFO L225 Difference]: With dead ends: 520 [2021-01-06 20:56:25,319 INFO L226 Difference]: Without dead ends: 514 [2021-01-06 20:56:25,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2021-01-06 20:56:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-01-06 20:56:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 153. [2021-01-06 20:56:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2021-01-06 20:56:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2021-01-06 20:56:25,362 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 54 [2021-01-06 20:56:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:25,362 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2021-01-06 20:56:25,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:56:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2021-01-06 20:56:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:56:25,363 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:25,363 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] [2021-01-06 20:56:25,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 20:56:25,364 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -787967428, now seen corresponding path program 1 times [2021-01-06 20:56:25,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:25,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93697283] [2021-01-06 20:56:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:25,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93697283] [2021-01-06 20:56:25,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:25,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 20:56:25,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50680455] [2021-01-06 20:56:25,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 20:56:25,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 20:56:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:56:25,955 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand 14 states. [2021-01-06 20:56:26,451 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2021-01-06 20:56:26,638 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-06 20:56:26,817 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2021-01-06 20:56:26,986 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2021-01-06 20:56:27,137 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2021-01-06 20:56:27,368 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2021-01-06 20:56:27,749 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2021-01-06 20:56:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:28,387 INFO L93 Difference]: Finished difference Result 416 states and 554 transitions. [2021-01-06 20:56:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:56:28,390 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2021-01-06 20:56:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:28,392 INFO L225 Difference]: With dead ends: 416 [2021-01-06 20:56:28,392 INFO L226 Difference]: Without dead ends: 404 [2021-01-06 20:56:28,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2021-01-06 20:56:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-01-06 20:56:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 141. [2021-01-06 20:56:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 20:56:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2021-01-06 20:56:28,430 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 54 [2021-01-06 20:56:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:28,431 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2021-01-06 20:56:28,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 20:56:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2021-01-06 20:56:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:56:28,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:28,432 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] [2021-01-06 20:56:28,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 20:56:28,432 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:28,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1046826158, now seen corresponding path program 1 times [2021-01-06 20:56:28,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:28,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782427478] [2021-01-06 20:56:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:28,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782427478] [2021-01-06 20:56:28,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:28,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 20:56:28,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902782150] [2021-01-06 20:56:28,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 20:56:28,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:28,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 20:56:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-01-06 20:56:28,925 INFO L87 Difference]: Start difference. First operand 141 states and 171 transitions. Second operand 13 states. [2021-01-06 20:56:29,298 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2021-01-06 20:56:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:30,577 INFO L93 Difference]: Finished difference Result 402 states and 539 transitions. [2021-01-06 20:56:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:56:30,578 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2021-01-06 20:56:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:30,581 INFO L225 Difference]: With dead ends: 402 [2021-01-06 20:56:30,581 INFO L226 Difference]: Without dead ends: 396 [2021-01-06 20:56:30,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:56:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-01-06 20:56:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 141. [2021-01-06 20:56:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 20:56:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2021-01-06 20:56:30,622 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 54 [2021-01-06 20:56:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:30,622 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2021-01-06 20:56:30,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 20:56:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2021-01-06 20:56:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:56:30,623 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:30,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:56:30,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 20:56:30,624 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash -534929533, now seen corresponding path program 1 times [2021-01-06 20:56:30,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:30,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560671584] [2021-01-06 20:56:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:30,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560671584] [2021-01-06 20:56:30,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:30,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 20:56:30,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691005823] [2021-01-06 20:56:30,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:56:30,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:56:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:56:31,004 INFO L87 Difference]: Start difference. First operand 141 states and 171 transitions. Second operand 11 states. [2021-01-06 20:56:31,538 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-01-06 20:56:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:32,263 INFO L93 Difference]: Finished difference Result 383 states and 520 transitions. [2021-01-06 20:56:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 20:56:32,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2021-01-06 20:56:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:32,266 INFO L225 Difference]: With dead ends: 383 [2021-01-06 20:56:32,266 INFO L226 Difference]: Without dead ends: 360 [2021-01-06 20:56:32,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2021-01-06 20:56:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-01-06 20:56:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 118. [2021-01-06 20:56:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-01-06 20:56:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2021-01-06 20:56:32,297 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 54 [2021-01-06 20:56:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:32,297 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2021-01-06 20:56:32,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:56:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2021-01-06 20:56:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 20:56:32,298 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:32,298 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] [2021-01-06 20:56:32,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 20:56:32,298 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:32,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash -200667910, now seen corresponding path program 1 times [2021-01-06 20:56:32,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:32,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413970645] [2021-01-06 20:56:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:32,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413970645] [2021-01-06 20:56:32,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:32,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 20:56:32,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100935078] [2021-01-06 20:56:32,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:56:32,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:56:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:56:32,629 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand 11 states. [2021-01-06 20:56:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:33,352 INFO L93 Difference]: Finished difference Result 274 states and 367 transitions. [2021-01-06 20:56:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:56:33,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2021-01-06 20:56:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:33,354 INFO L225 Difference]: With dead ends: 274 [2021-01-06 20:56:33,354 INFO L226 Difference]: Without dead ends: 268 [2021-01-06 20:56:33,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-01-06 20:56:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-01-06 20:56:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 100. [2021-01-06 20:56:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2021-01-06 20:56:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2021-01-06 20:56:33,382 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 55 [2021-01-06 20:56:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:33,382 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2021-01-06 20:56:33,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:56:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2021-01-06 20:56:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 20:56:33,383 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:33,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:56:33,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 20:56:33,383 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 415256315, now seen corresponding path program 1 times [2021-01-06 20:56:33,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:33,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726831740] [2021-01-06 20:56:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:33,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726831740] [2021-01-06 20:56:33,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:33,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:56:33,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575800118] [2021-01-06 20:56:33,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:56:33,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:56:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:33,436 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand 3 states. [2021-01-06 20:56:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:33,533 INFO L93 Difference]: Finished difference Result 182 states and 245 transitions. [2021-01-06 20:56:33,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:56:33,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2021-01-06 20:56:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:33,535 INFO L225 Difference]: With dead ends: 182 [2021-01-06 20:56:33,535 INFO L226 Difference]: Without dead ends: 139 [2021-01-06 20:56:33,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-01-06 20:56:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2021-01-06 20:56:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2021-01-06 20:56:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2021-01-06 20:56:33,621 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 71 [2021-01-06 20:56:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:33,622 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2021-01-06 20:56:33,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:56:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2021-01-06 20:56:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:56:33,624 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:33,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:56:33,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 20:56:33,625 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:33,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:33,625 INFO L82 PathProgramCache]: Analyzing trace with hash -237734748, now seen corresponding path program 1 times [2021-01-06 20:56:33,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:33,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147580501] [2021-01-06 20:56:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:33,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147580501] [2021-01-06 20:56:33,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:33,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:56:33,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579157006] [2021-01-06 20:56:33,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:56:33,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:33,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:56:33,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:56:33,764 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand 5 states. [2021-01-06 20:56:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:34,130 INFO L93 Difference]: Finished difference Result 396 states and 560 transitions. [2021-01-06 20:56:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:56:34,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2021-01-06 20:56:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:34,132 INFO L225 Difference]: With dead ends: 396 [2021-01-06 20:56:34,133 INFO L226 Difference]: Without dead ends: 316 [2021-01-06 20:56:34,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:56:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-01-06 20:56:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 178. [2021-01-06 20:56:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2021-01-06 20:56:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 241 transitions. [2021-01-06 20:56:34,242 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 241 transitions. Word has length 73 [2021-01-06 20:56:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:34,242 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 241 transitions. [2021-01-06 20:56:34,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:56:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 241 transitions. [2021-01-06 20:56:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:56:34,243 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:34,243 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] [2021-01-06 20:56:34,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 20:56:34,244 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:34,244 INFO L82 PathProgramCache]: Analyzing trace with hash -871401261, now seen corresponding path program 1 times [2021-01-06 20:56:34,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:34,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147413060] [2021-01-06 20:56:34,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:34,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147413060] [2021-01-06 20:56:34,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:34,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:56:34,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713269941] [2021-01-06 20:56:34,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:56:34,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:34,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:56:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:34,320 INFO L87 Difference]: Start difference. First operand 178 states and 241 transitions. Second operand 3 states. [2021-01-06 20:56:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:34,530 INFO L93 Difference]: Finished difference Result 383 states and 546 transitions. [2021-01-06 20:56:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:56:34,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 20:56:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:34,533 INFO L225 Difference]: With dead ends: 383 [2021-01-06 20:56:34,533 INFO L226 Difference]: Without dead ends: 262 [2021-01-06 20:56:34,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-01-06 20:56:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2021-01-06 20:56:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2021-01-06 20:56:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 361 transitions. [2021-01-06 20:56:34,699 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 361 transitions. Word has length 73 [2021-01-06 20:56:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:34,700 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 361 transitions. [2021-01-06 20:56:34,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:56:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 361 transitions. [2021-01-06 20:56:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:56:34,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:34,701 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] [2021-01-06 20:56:34,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 20:56:34,702 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:34,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash -937894773, now seen corresponding path program 1 times [2021-01-06 20:56:34,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:34,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976903105] [2021-01-06 20:56:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:34,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976903105] [2021-01-06 20:56:34,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:34,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:56:34,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911063417] [2021-01-06 20:56:34,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:56:34,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:34,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:56:34,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:34,761 INFO L87 Difference]: Start difference. First operand 260 states and 361 transitions. Second operand 3 states. [2021-01-06 20:56:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:35,040 INFO L93 Difference]: Finished difference Result 636 states and 910 transitions. [2021-01-06 20:56:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:56:35,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 20:56:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:35,043 INFO L225 Difference]: With dead ends: 636 [2021-01-06 20:56:35,044 INFO L226 Difference]: Without dead ends: 433 [2021-01-06 20:56:35,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-01-06 20:56:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 426. [2021-01-06 20:56:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2021-01-06 20:56:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 593 transitions. [2021-01-06 20:56:35,274 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 593 transitions. Word has length 73 [2021-01-06 20:56:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:35,274 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 593 transitions. [2021-01-06 20:56:35,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:56:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 593 transitions. [2021-01-06 20:56:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:56:35,275 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:35,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:56:35,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 20:56:35,275 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:35,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash -852412764, now seen corresponding path program 1 times [2021-01-06 20:56:35,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:35,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236753565] [2021-01-06 20:56:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:35,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236753565] [2021-01-06 20:56:35,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:35,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:56:35,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550776809] [2021-01-06 20:56:35,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:56:35,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:35,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:56:35,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:56:35,352 INFO L87 Difference]: Start difference. First operand 426 states and 593 transitions. Second operand 5 states. [2021-01-06 20:56:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:35,904 INFO L93 Difference]: Finished difference Result 1100 states and 1559 transitions. [2021-01-06 20:56:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:56:35,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2021-01-06 20:56:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:35,908 INFO L225 Difference]: With dead ends: 1100 [2021-01-06 20:56:35,908 INFO L226 Difference]: Without dead ends: 880 [2021-01-06 20:56:35,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:56:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-01-06 20:56:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 650. [2021-01-06 20:56:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2021-01-06 20:56:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 915 transitions. [2021-01-06 20:56:36,265 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 915 transitions. Word has length 73 [2021-01-06 20:56:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:36,265 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 915 transitions. [2021-01-06 20:56:36,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:56:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 915 transitions. [2021-01-06 20:56:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:56:36,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:36,266 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] [2021-01-06 20:56:36,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 20:56:36,267 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1459706699, now seen corresponding path program 1 times [2021-01-06 20:56:36,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:36,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101758646] [2021-01-06 20:56:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:36,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101758646] [2021-01-06 20:56:36,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:36,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:56:36,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835490835] [2021-01-06 20:56:36,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:56:36,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:56:36,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:36,312 INFO L87 Difference]: Start difference. First operand 650 states and 915 transitions. Second operand 3 states. [2021-01-06 20:56:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:37,009 INFO L93 Difference]: Finished difference Result 1446 states and 2063 transitions. [2021-01-06 20:56:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:56:37,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 20:56:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:37,015 INFO L225 Difference]: With dead ends: 1446 [2021-01-06 20:56:37,015 INFO L226 Difference]: Without dead ends: 853 [2021-01-06 20:56:37,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2021-01-06 20:56:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 842. [2021-01-06 20:56:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2021-01-06 20:56:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1184 transitions. [2021-01-06 20:56:37,497 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1184 transitions. Word has length 74 [2021-01-06 20:56:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:37,497 INFO L481 AbstractCegarLoop]: Abstraction has 842 states and 1184 transitions. [2021-01-06 20:56:37,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:56:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1184 transitions. [2021-01-06 20:56:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:56:37,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:37,498 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] [2021-01-06 20:56:37,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 20:56:37,498 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1468955342, now seen corresponding path program 1 times [2021-01-06 20:56:37,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:37,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413671134] [2021-01-06 20:56:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:37,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413671134] [2021-01-06 20:56:37,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:37,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:56:37,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410079781] [2021-01-06 20:56:37,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:56:37,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:56:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:56:37,582 INFO L87 Difference]: Start difference. First operand 842 states and 1184 transitions. Second operand 5 states. [2021-01-06 20:56:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:38,483 INFO L93 Difference]: Finished difference Result 1658 states and 2351 transitions. [2021-01-06 20:56:38,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:56:38,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2021-01-06 20:56:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:38,489 INFO L225 Difference]: With dead ends: 1658 [2021-01-06 20:56:38,489 INFO L226 Difference]: Without dead ends: 1361 [2021-01-06 20:56:38,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:56:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2021-01-06 20:56:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1037. [2021-01-06 20:56:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2021-01-06 20:56:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1463 transitions. [2021-01-06 20:56:39,139 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1463 transitions. Word has length 74 [2021-01-06 20:56:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:39,139 INFO L481 AbstractCegarLoop]: Abstraction has 1037 states and 1463 transitions. [2021-01-06 20:56:39,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:56:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1463 transitions. [2021-01-06 20:56:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:56:39,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:39,140 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] [2021-01-06 20:56:39,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 20:56:39,141 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1631844587, now seen corresponding path program 1 times [2021-01-06 20:56:39,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:39,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628283146] [2021-01-06 20:56:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:39,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628283146] [2021-01-06 20:56:39,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:39,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:56:39,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563485189] [2021-01-06 20:56:39,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:56:39,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:39,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:56:39,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:39,186 INFO L87 Difference]: Start difference. First operand 1037 states and 1463 transitions. Second operand 3 states. [2021-01-06 20:56:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:40,324 INFO L93 Difference]: Finished difference Result 2877 states and 4057 transitions. [2021-01-06 20:56:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:56:40,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 20:56:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:40,332 INFO L225 Difference]: With dead ends: 2877 [2021-01-06 20:56:40,332 INFO L226 Difference]: Without dead ends: 1897 [2021-01-06 20:56:40,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2021-01-06 20:56:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1775. [2021-01-06 20:56:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2021-01-06 20:56:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2474 transitions. [2021-01-06 20:56:41,360 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2474 transitions. Word has length 74 [2021-01-06 20:56:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:41,361 INFO L481 AbstractCegarLoop]: Abstraction has 1775 states and 2474 transitions. [2021-01-06 20:56:41,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:56:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2474 transitions. [2021-01-06 20:56:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 20:56:41,362 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:41,362 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] [2021-01-06 20:56:41,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 20:56:41,363 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash -536068422, now seen corresponding path program 1 times [2021-01-06 20:56:41,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:41,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014982860] [2021-01-06 20:56:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:41,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014982860] [2021-01-06 20:56:41,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:41,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:56:41,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263302587] [2021-01-06 20:56:41,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:56:41,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:41,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:56:41,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:41,415 INFO L87 Difference]: Start difference. First operand 1775 states and 2474 transitions. Second operand 3 states. [2021-01-06 20:56:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:43,158 INFO L93 Difference]: Finished difference Result 4971 states and 6880 transitions. [2021-01-06 20:56:43,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:56:43,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 20:56:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:43,173 INFO L225 Difference]: With dead ends: 4971 [2021-01-06 20:56:43,173 INFO L226 Difference]: Without dead ends: 3253 [2021-01-06 20:56:43,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2021-01-06 20:56:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 3011. [2021-01-06 20:56:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3011 states. [2021-01-06 20:56:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 4106 transitions. [2021-01-06 20:56:44,813 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 4106 transitions. Word has length 75 [2021-01-06 20:56:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:44,813 INFO L481 AbstractCegarLoop]: Abstraction has 3011 states and 4106 transitions. [2021-01-06 20:56:44,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:56:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 4106 transitions. [2021-01-06 20:56:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 20:56:44,815 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:44,815 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] [2021-01-06 20:56:44,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 20:56:44,815 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1852091383, now seen corresponding path program 1 times [2021-01-06 20:56:44,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:44,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818697766] [2021-01-06 20:56:44,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:44,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818697766] [2021-01-06 20:56:44,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:44,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 20:56:44,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6386023] [2021-01-06 20:56:44,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:56:44,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:44,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:56:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:56:44,897 INFO L87 Difference]: Start difference. First operand 3011 states and 4106 transitions. Second operand 6 states. [2021-01-06 20:56:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:47,647 INFO L93 Difference]: Finished difference Result 4662 states and 6316 transitions. [2021-01-06 20:56:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 20:56:47,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2021-01-06 20:56:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:47,665 INFO L225 Difference]: With dead ends: 4662 [2021-01-06 20:56:47,665 INFO L226 Difference]: Without dead ends: 4660 [2021-01-06 20:56:47,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:56:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4660 states. [2021-01-06 20:56:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4660 to 3059. [2021-01-06 20:56:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2021-01-06 20:56:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4134 transitions. [2021-01-06 20:56:49,382 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4134 transitions. Word has length 76 [2021-01-06 20:56:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:49,382 INFO L481 AbstractCegarLoop]: Abstraction has 3059 states and 4134 transitions. [2021-01-06 20:56:49,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:56:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4134 transitions. [2021-01-06 20:56:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:56:49,383 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:49,383 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] [2021-01-06 20:56:49,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 20:56:49,384 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash -966335138, now seen corresponding path program 1 times [2021-01-06 20:56:49,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:49,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778129198] [2021-01-06 20:56:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:49,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778129198] [2021-01-06 20:56:49,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:49,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:56:49,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939360746] [2021-01-06 20:56:49,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:56:49,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:56:49,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:49,457 INFO L87 Difference]: Start difference. First operand 3059 states and 4134 transitions. Second operand 3 states. [2021-01-06 20:56:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:51,643 INFO L93 Difference]: Finished difference Result 6983 states and 9396 transitions. [2021-01-06 20:56:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:56:51,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 20:56:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:51,690 INFO L225 Difference]: With dead ends: 6983 [2021-01-06 20:56:51,691 INFO L226 Difference]: Without dead ends: 3981 [2021-01-06 20:56:51,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2021-01-06 20:56:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3675. [2021-01-06 20:56:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3675 states. [2021-01-06 20:56:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4866 transitions. [2021-01-06 20:56:53,797 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4866 transitions. Word has length 77 [2021-01-06 20:56:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:53,797 INFO L481 AbstractCegarLoop]: Abstraction has 3675 states and 4866 transitions. [2021-01-06 20:56:53,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:56:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4866 transitions. [2021-01-06 20:56:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 20:56:53,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:53,800 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:56:53,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 20:56:53,800 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash 914913403, now seen corresponding path program 1 times [2021-01-06 20:56:53,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:53,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276273362] [2021-01-06 20:56:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 20:56:53,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276273362] [2021-01-06 20:56:53,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:53,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:56:53,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969682048] [2021-01-06 20:56:53,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:56:53,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:56:53,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:56:53,991 INFO L87 Difference]: Start difference. First operand 3675 states and 4866 transitions. Second operand 11 states. [2021-01-06 20:57:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:57:06,420 INFO L93 Difference]: Finished difference Result 21024 states and 27517 transitions. [2021-01-06 20:57:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 20:57:06,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2021-01-06 20:57:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:57:06,461 INFO L225 Difference]: With dead ends: 21024 [2021-01-06 20:57:06,462 INFO L226 Difference]: Without dead ends: 17400 [2021-01-06 20:57:06,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=342, Invalid=1064, Unknown=0, NotChecked=0, Total=1406 [2021-01-06 20:57:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17400 states. [2021-01-06 20:57:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17400 to 3679. [2021-01-06 20:57:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3679 states. [2021-01-06 20:57:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4870 transitions. [2021-01-06 20:57:08,752 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4870 transitions. Word has length 98 [2021-01-06 20:57:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:57:08,752 INFO L481 AbstractCegarLoop]: Abstraction has 3679 states and 4870 transitions. [2021-01-06 20:57:08,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:57:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4870 transitions. [2021-01-06 20:57:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 20:57:08,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:57:08,755 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:57:08,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 20:57:08,755 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:57:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:57:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1709276203, now seen corresponding path program 1 times [2021-01-06 20:57:08,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:57:08,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770814438] [2021-01-06 20:57:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:57:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:57:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 20:57:08,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770814438] [2021-01-06 20:57:08,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:57:08,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:57:08,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105272148] [2021-01-06 20:57:08,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:57:08,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:57:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:57:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:57:08,898 INFO L87 Difference]: Start difference. First operand 3679 states and 4870 transitions. Second operand 9 states. [2021-01-06 20:57:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:57:13,586 INFO L93 Difference]: Finished difference Result 11054 states and 14620 transitions. [2021-01-06 20:57:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:57:13,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2021-01-06 20:57:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:57:13,602 INFO L225 Difference]: With dead ends: 11054 [2021-01-06 20:57:13,603 INFO L226 Difference]: Without dead ends: 7430 [2021-01-06 20:57:13,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:57:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2021-01-06 20:57:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 3675. [2021-01-06 20:57:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3675 states. [2021-01-06 20:57:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4865 transitions. [2021-01-06 20:57:15,868 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4865 transitions. Word has length 99 [2021-01-06 20:57:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:57:15,868 INFO L481 AbstractCegarLoop]: Abstraction has 3675 states and 4865 transitions. [2021-01-06 20:57:15,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:57:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4865 transitions. [2021-01-06 20:57:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 20:57:15,869 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:57:15,869 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:57:15,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 20:57:15,870 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:57:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:57:15,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1310697750, now seen corresponding path program 1 times [2021-01-06 20:57:15,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:57:15,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570139816] [2021-01-06 20:57:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:57:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:57:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:57:16,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570139816] [2021-01-06 20:57:16,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104106936] [2021-01-06 20:57:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:57:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:57:16,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 20:57:16,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:57:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 20:57:16,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:57:16,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2021-01-06 20:57:16,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381891161] [2021-01-06 20:57:16,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 20:57:16,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:57:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 20:57:16,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:57:16,812 INFO L87 Difference]: Start difference. First operand 3675 states and 4865 transitions. Second operand 14 states. [2021-01-06 20:57:18,684 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-01-06 20:57:19,631 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-01-06 20:57:23,480 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2021-01-06 20:57:24,254 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-01-06 20:57:24,788 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 20:57:25,100 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-01-06 20:57:27,912 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 20:57:30,446 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 20:57:31,411 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-01-06 20:57:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:57:49,480 INFO L93 Difference]: Finished difference Result 36670 states and 47886 transitions. [2021-01-06 20:57:49,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-01-06 20:57:49,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 100 [2021-01-06 20:57:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:57:49,539 INFO L225 Difference]: With dead ends: 36670 [2021-01-06 20:57:49,539 INFO L226 Difference]: Without dead ends: 33052 [2021-01-06 20:57:49,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4284 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1674, Invalid=9456, Unknown=0, NotChecked=0, Total=11130 [2021-01-06 20:57:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33052 states. [2021-01-06 20:57:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33052 to 13006. [2021-01-06 20:57:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13006 states. [2021-01-06 20:57:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13006 states to 13006 states and 17233 transitions. [2021-01-06 20:57:58,300 INFO L78 Accepts]: Start accepts. Automaton has 13006 states and 17233 transitions. Word has length 100 [2021-01-06 20:57:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:57:58,301 INFO L481 AbstractCegarLoop]: Abstraction has 13006 states and 17233 transitions. [2021-01-06 20:57:58,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 20:57:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13006 states and 17233 transitions. [2021-01-06 20:57:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 20:57:58,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:57:58,304 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:57:58,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-06 20:57:58,506 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:57:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:57:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2089944216, now seen corresponding path program 1 times [2021-01-06 20:57:58,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:57:58,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952318440] [2021-01-06 20:57:58,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:57:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:57:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:57:58,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952318440] [2021-01-06 20:57:58,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:57:58,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:57:58,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811147529] [2021-01-06 20:57:58,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:57:58,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:57:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:57:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:57:58,573 INFO L87 Difference]: Start difference. First operand 13006 states and 17233 transitions. Second operand 3 states. [2021-01-06 20:58:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:03,985 INFO L93 Difference]: Finished difference Result 21839 states and 28895 transitions. [2021-01-06 20:58:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:58:03,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 20:58:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:04,000 INFO L225 Difference]: With dead ends: 21839 [2021-01-06 20:58:04,000 INFO L226 Difference]: Without dead ends: 8913 [2021-01-06 20:58:04,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:58:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8913 states. [2021-01-06 20:58:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8913 to 8876. [2021-01-06 20:58:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8876 states. [2021-01-06 20:58:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8876 states to 8876 states and 11494 transitions. [2021-01-06 20:58:09,685 INFO L78 Accepts]: Start accepts. Automaton has 8876 states and 11494 transitions. Word has length 100 [2021-01-06 20:58:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:09,686 INFO L481 AbstractCegarLoop]: Abstraction has 8876 states and 11494 transitions. [2021-01-06 20:58:09,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:58:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8876 states and 11494 transitions. [2021-01-06 20:58:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 20:58:09,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:09,688 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:09,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 20:58:09,689 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1949073466, now seen corresponding path program 1 times [2021-01-06 20:58:09,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:09,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017533093] [2021-01-06 20:58:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:58:10,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017533093] [2021-01-06 20:58:10,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256537345] [2021-01-06 20:58:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:58:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:10,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 20:58:10,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:58:10,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 20:58:11,126 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 20:58:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:58:11,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:58:11,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-01-06 20:58:11,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749404757] [2021-01-06 20:58:11,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 20:58:11,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:11,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 20:58:11,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:58:11,223 INFO L87 Difference]: Start difference. First operand 8876 states and 11494 transitions. Second operand 20 states. [2021-01-06 20:58:11,819 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-01-06 20:58:12,006 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-01-06 20:58:12,496 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-01-06 20:58:12,677 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-01-06 20:58:12,969 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 20:58:13,109 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-01-06 20:58:13,578 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 20:58:14,084 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 20:58:14,443 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 20:58:14,709 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 20:58:15,220 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-01-06 20:58:15,653 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 20:58:15,920 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 20:58:16,328 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-01-06 20:58:16,655 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 20:58:16,903 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-01-06 20:58:17,127 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-01-06 20:58:17,436 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 20:58:18,221 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-01-06 20:58:18,663 WARN L197 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-01-06 20:58:19,079 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 20:58:22,510 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-01-06 20:58:22,973 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 20:58:23,505 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 20:58:23,843 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 20:58:24,306 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-01-06 20:58:24,503 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-01-06 20:58:24,811 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-06 20:58:25,279 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 20:58:25,694 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-01-06 20:58:25,944 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-01-06 20:58:26,512 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 20:58:26,802 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-01-06 20:58:27,718 WARN L197 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-01-06 20:58:28,622 WARN L197 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-01-06 20:59:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:59:00,539 INFO L93 Difference]: Finished difference Result 56721 states and 72483 transitions. [2021-01-06 20:59:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-01-06 20:59:00,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2021-01-06 20:59:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:59:00,631 INFO L225 Difference]: With dead ends: 56721 [2021-01-06 20:59:00,631 INFO L226 Difference]: Without dead ends: 48326 [2021-01-06 20:59:00,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2021-01-06 20:59:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48326 states. [2021-01-06 20:59:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48326 to 21704. [2021-01-06 20:59:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21704 states. [2021-01-06 20:59:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21704 states to 21704 states and 28083 transitions. [2021-01-06 20:59:16,582 INFO L78 Accepts]: Start accepts. Automaton has 21704 states and 28083 transitions. Word has length 101 [2021-01-06 20:59:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:59:16,582 INFO L481 AbstractCegarLoop]: Abstraction has 21704 states and 28083 transitions. [2021-01-06 20:59:16,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 20:59:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 21704 states and 28083 transitions. [2021-01-06 20:59:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 20:59:16,586 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:59:16,586 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:59:16,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:59:16,801 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:59:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:59:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1968061963, now seen corresponding path program 1 times [2021-01-06 20:59:16,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:59:16,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236134631] [2021-01-06 20:59:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:59:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:59:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 20:59:17,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236134631] [2021-01-06 20:59:17,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:59:17,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:59:17,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064586595] [2021-01-06 20:59:17,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:59:17,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:59:17,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:59:17,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:59:17,307 INFO L87 Difference]: Start difference. First operand 21704 states and 28083 transitions. Second operand 16 states. [2021-01-06 20:59:17,462 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-01-06 20:59:17,994 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45