/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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:58:34,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:58:34,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:58:34,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:58:34,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:58:34,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:58:34,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:58:34,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:58:34,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:58:34,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:58:34,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:58:34,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:58:34,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:58:34,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:58:34,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:58:34,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:58:34,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:58:34,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:58:34,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:58:34,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:58:34,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:58:34,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:58:34,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:58:34,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:58:34,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:58:34,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:58:34,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:58:34,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:58:34,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:58:34,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:58:34,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:58:34,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:58:34,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:58:34,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:58:34,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:58:34,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:58:34,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:58:34,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:58:34,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:58:34,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:58:34,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:58:34,246 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:58:34,274 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:58:34,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:58:34,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:58:34,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:58:34,277 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:58:34,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:58:34,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:58:34,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:58:34,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:58:34,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:58:34,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:58:34,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:58:34,279 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:58:34,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:58:34,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:58:34,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:58:34,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:58:34,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:58:34,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:58:34,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:58:34,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:58:34,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:58:34,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:58:34,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:58:34,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:58:34,283 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:58:34,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:58:34,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:58:34,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:58:34,736 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:58:34,737 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:58:34,738 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2021-01-06 20:58:34,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/aa277e201/07008e33a5a84df1b361f050261f0ad2/FLAGd23061b78 [2021-01-06 20:58:35,655 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:58:35,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2021-01-06 20:58:35,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/aa277e201/07008e33a5a84df1b361f050261f0ad2/FLAGd23061b78 [2021-01-06 20:58:35,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/aa277e201/07008e33a5a84df1b361f050261f0ad2 [2021-01-06 20:58:35,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:58:35,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:58:35,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:58:35,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:58:35,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:58:35,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:58:35" (1/1) ... [2021-01-06 20:58:35,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706b7152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:35, skipping insertion in model container [2021-01-06 20:58:35,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:58:35" (1/1) ... [2021-01-06 20:58:35,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:58:35,957 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2928~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_4594~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~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[~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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_3100~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3109_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] 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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~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[~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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3178_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_3186~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] [2021-01-06 20:58:36,231 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9015,9028] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3193_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3109_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~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[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~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[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] 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] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_3113~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_3459~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:58:36,264 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12487,12500] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~node4__m4~3,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_3650~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,] [2021-01-06 20:58:36,285 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[13643,13656] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__return_3824~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:58:36,300 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14299,14312] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3193_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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~3,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~4,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~__return_4035~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,] [2021-01-06 20:58:36,325 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[15820,15833] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__return_4219~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:58:36,346 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16476,16489] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~node4__m4~5,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~5,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_4399~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,] [2021-01-06 20:58:36,363 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17460,17473] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~__return_4565~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~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[~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[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~6,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~6,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_3369~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:58:36,391 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19798,19811] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_3532~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,] [2021-01-06 20:58:36,397 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20457,20470] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3193_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~node4__m4~7,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~7,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_3735~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:58:36,404 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21481,21494] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3193_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__return_3899~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~8,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~8,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__return_4132~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,] [2021-01-06 20:58:36,418 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23356,23369] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__return_4292~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~node4__m4~9,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~9,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_4484~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3178_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~__return_4527~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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[~node4__m4~10,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~__return_4434~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~__return_4349~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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~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[~node4__m4~11,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~__return_4254~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_17~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~16,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~__return_4181~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_18~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~17,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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[~node4__m4~12,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~__return_4070~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_19~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~18,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~__return_3970~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_20~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~19,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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~4,] 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[~node3__m3~7,] 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[~node4__m4~13,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~5,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~__return_3861~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_21~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~20,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~5,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~__return_3786~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_22~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~21,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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[~node4__m4~14,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~__return_3685~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_23~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~22,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~__return_3597~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_24~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~23,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] 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[~node3__m3~8,] 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[~node4__m4~15,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~7,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~__return_3494~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_25~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~24,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~7,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~__return_3418~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_26~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~25,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] 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[~node4__m4~16,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~__return_3292~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_27~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~26,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~__return_3019~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_28~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~27,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] [2021-01-06 20:58:36,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:58:36,630 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2928~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_4594~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~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[~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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_3100~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3109_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] 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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~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[~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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3178_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_3186~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] [2021-01-06 20:58:36,772 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9015,9028] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3193_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3109_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~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[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~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[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] 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] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_3113~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_3459~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:58:36,813 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12487,12500] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~node4__m4~3,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_3650~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,] [2021-01-06 20:58:36,830 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[13643,13656] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__return_3824~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:58:36,840 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14299,14312] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3193_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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~3,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~4,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~__return_4035~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,] [2021-01-06 20:58:36,859 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[15820,15833] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__return_4219~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:58:36,870 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16476,16489] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~node4__m4~5,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~5,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_4399~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,] [2021-01-06 20:58:36,883 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17460,17473] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~__return_4565~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~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[~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[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~6,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~6,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_3369~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:58:36,910 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19798,19811] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_3532~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,] [2021-01-06 20:58:36,919 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20457,20470] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3193_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~node4__m4~7,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~7,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_3735~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:58:36,932 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21481,21494] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3193_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__return_3899~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~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[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~8,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~8,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__return_4132~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,] [2021-01-06 20:58:36,955 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23356,23369] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__return_4292~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~node4__m4~9,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~9,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_4484~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3187_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3178_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~__return_4527~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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[~node4__m4~10,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~__return_4434~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~__return_4349~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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~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[~node4__m4~11,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~__return_4254~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_17~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~16,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~__return_4181~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_18~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~17,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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[~node4__m4~12,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~__return_4070~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_19~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~18,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~__return_3970~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_20~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~19,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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~4,] 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[~node3__m3~7,] 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[~node4__m4~13,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~5,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~__return_3861~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_21~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~20,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~5,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~__return_3786~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_22~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~21,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~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[~node4__m4~14,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~__return_3685~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_23~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~22,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~__return_3597~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_24~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~23,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] 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[~node3__m3~8,] 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[~node4__m4~15,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~7,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~__return_3494~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_25~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~24,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~7,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~__return_3418~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_26~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~25,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] 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[~node4__m4~16,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~__return_3292~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_27~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~26,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~__return_3019~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_28~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~27,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3029_0~0,GLOBAL] [2021-01-06 20:58:37,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:58:37,160 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:58:37,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37 WrapperNode [2021-01-06 20:58:37,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:58:37,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:58:37,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:58:37,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:58:37,174 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:58:37" (1/1) ... [2021-01-06 20:58:37,202 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:58:37" (1/1) ... [2021-01-06 20:58:37,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:58:37,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:58:37,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:58:37,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:58:37,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (1/1) ... [2021-01-06 20:58:37,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (1/1) ... [2021-01-06 20:58:37,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (1/1) ... [2021-01-06 20:58:37,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (1/1) ... [2021-01-06 20:58:37,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (1/1) ... [2021-01-06 20:58:37,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (1/1) ... [2021-01-06 20:58:37,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (1/1) ... [2021-01-06 20:58:37,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:58:37,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:58:37,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:58:37,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:58:37,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (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:58:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:58:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:58:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:58:37,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:58:39,464 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:58:39,464 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:58:39,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:58:39 BoogieIcfgContainer [2021-01-06 20:58:39,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:58:39,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:58:39,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:58:39,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:58:39,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:58:35" (1/3) ... [2021-01-06 20:58:39,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a252cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:58:39, skipping insertion in model container [2021-01-06 20:58:39,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:58:37" (2/3) ... [2021-01-06 20:58:39,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a252cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:58:39, skipping insertion in model container [2021-01-06 20:58:39,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:58:39" (3/3) ... [2021-01-06 20:58:39,477 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2021-01-06 20:58:39,485 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:58:39,491 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2021-01-06 20:58:39,514 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-01-06 20:58:39,550 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:58:39,550 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:58:39,550 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:58:39,550 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:58:39,551 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:58:39,551 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:58:39,551 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:58:39,551 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:58:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states. [2021-01-06 20:58:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 20:58:39,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:39,625 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] [2021-01-06 20:58:39,626 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:39,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1374718599, now seen corresponding path program 1 times [2021-01-06 20:58:39,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:39,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191534772] [2021-01-06 20:58:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:40,236 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:58:40,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191534772] [2021-01-06 20:58:40,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:40,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:58:40,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464874654] [2021-01-06 20:58:40,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:58:40,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:58:40,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:58:40,266 INFO L87 Difference]: Start difference. First operand 358 states. Second operand 5 states. [2021-01-06 20:58:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:40,686 INFO L93 Difference]: Finished difference Result 570 states and 974 transitions. [2021-01-06 20:58:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:58:40,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2021-01-06 20:58:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:40,707 INFO L225 Difference]: With dead ends: 570 [2021-01-06 20:58:40,708 INFO L226 Difference]: Without dead ends: 294 [2021-01-06 20:58:40,717 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:58:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-01-06 20:58:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-01-06 20:58:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2021-01-06 20:58:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2021-01-06 20:58:40,805 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 59 [2021-01-06 20:58:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:40,806 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2021-01-06 20:58:40,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:58:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2021-01-06 20:58:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 20:58:40,811 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:40,811 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] [2021-01-06 20:58:40,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:58:40,812 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:40,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2133391140, now seen corresponding path program 1 times [2021-01-06 20:58:40,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:40,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470640606] [2021-01-06 20:58:40,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:41,060 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:58:41,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470640606] [2021-01-06 20:58:41,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:41,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:58:41,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507421904] [2021-01-06 20:58:41,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:58:41,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:41,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:58:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:58:41,066 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand 6 states. [2021-01-06 20:58:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:41,399 INFO L93 Difference]: Finished difference Result 602 states and 763 transitions. [2021-01-06 20:58:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:58:41,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2021-01-06 20:58:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:41,410 INFO L225 Difference]: With dead ends: 602 [2021-01-06 20:58:41,411 INFO L226 Difference]: Without dead ends: 379 [2021-01-06 20:58:41,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:58:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-01-06 20:58:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 339. [2021-01-06 20:58:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2021-01-06 20:58:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 436 transitions. [2021-01-06 20:58:41,483 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 436 transitions. Word has length 60 [2021-01-06 20:58:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:41,484 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 436 transitions. [2021-01-06 20:58:41,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:58:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 436 transitions. [2021-01-06 20:58:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 20:58:41,493 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:41,493 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] [2021-01-06 20:58:41,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:58:41,494 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:41,495 INFO L82 PathProgramCache]: Analyzing trace with hash 626465560, now seen corresponding path program 1 times [2021-01-06 20:58:41,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:41,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994886970] [2021-01-06 20:58:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:41,622 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:58:41,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994886970] [2021-01-06 20:58:41,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:41,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:58:41,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371136330] [2021-01-06 20:58:41,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:58:41,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:58:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:58:41,625 INFO L87 Difference]: Start difference. First operand 339 states and 436 transitions. Second operand 5 states. [2021-01-06 20:58:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:41,890 INFO L93 Difference]: Finished difference Result 607 states and 798 transitions. [2021-01-06 20:58:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:58:41,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-01-06 20:58:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:41,894 INFO L225 Difference]: With dead ends: 607 [2021-01-06 20:58:41,894 INFO L226 Difference]: Without dead ends: 323 [2021-01-06 20:58:41,897 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:58:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-01-06 20:58:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-01-06 20:58:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2021-01-06 20:58:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 416 transitions. [2021-01-06 20:58:41,925 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 416 transitions. Word has length 61 [2021-01-06 20:58:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:41,925 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 416 transitions. [2021-01-06 20:58:41,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:58:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 416 transitions. [2021-01-06 20:58:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 20:58:41,928 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:41,928 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] [2021-01-06 20:58:41,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:58:41,929 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1648270779, now seen corresponding path program 1 times [2021-01-06 20:58:41,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:41,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90721139] [2021-01-06 20:58:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:42,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:58:42,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90721139] [2021-01-06 20:58:42,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:42,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:58:42,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783051766] [2021-01-06 20:58:42,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:58:42,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:58:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:58:42,079 INFO L87 Difference]: Start difference. First operand 323 states and 416 transitions. Second operand 5 states. [2021-01-06 20:58:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:42,306 INFO L93 Difference]: Finished difference Result 591 states and 776 transitions. [2021-01-06 20:58:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:58:42,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2021-01-06 20:58:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:42,310 INFO L225 Difference]: With dead ends: 591 [2021-01-06 20:58:42,310 INFO L226 Difference]: Without dead ends: 312 [2021-01-06 20:58:42,311 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:58:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-01-06 20:58:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-01-06 20:58:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 20:58:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 402 transitions. [2021-01-06 20:58:42,361 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 402 transitions. Word has length 62 [2021-01-06 20:58:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:42,361 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 402 transitions. [2021-01-06 20:58:42,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:58:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 402 transitions. [2021-01-06 20:58:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:58:42,363 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:42,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:58:42,364 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1176799625, now seen corresponding path program 1 times [2021-01-06 20:58:42,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:42,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503828489] [2021-01-06 20:58:42,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:42,539 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:58:42,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503828489] [2021-01-06 20:58:42,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:42,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:42,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864010456] [2021-01-06 20:58:42,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:42,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:42,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:42,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:42,542 INFO L87 Difference]: Start difference. First operand 312 states and 402 transitions. Second operand 9 states. [2021-01-06 20:58:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:43,394 INFO L93 Difference]: Finished difference Result 865 states and 1184 transitions. [2021-01-06 20:58:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:43,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2021-01-06 20:58:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:43,399 INFO L225 Difference]: With dead ends: 865 [2021-01-06 20:58:43,400 INFO L226 Difference]: Without dead ends: 722 [2021-01-06 20:58:43,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:58:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-01-06 20:58:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 312. [2021-01-06 20:58:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 20:58:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 401 transitions. [2021-01-06 20:58:43,437 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 401 transitions. Word has length 63 [2021-01-06 20:58:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:43,437 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 401 transitions. [2021-01-06 20:58:43,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 401 transitions. [2021-01-06 20:58:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:58:43,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:43,439 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] [2021-01-06 20:58:43,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:58:43,439 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1585644853, now seen corresponding path program 1 times [2021-01-06 20:58:43,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:43,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934089373] [2021-01-06 20:58:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:43,669 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:58:43,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934089373] [2021-01-06 20:58:43,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:43,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:43,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174592370] [2021-01-06 20:58:43,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:43,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:43,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:43,674 INFO L87 Difference]: Start difference. First operand 312 states and 401 transitions. Second operand 9 states. [2021-01-06 20:58:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:44,570 INFO L93 Difference]: Finished difference Result 839 states and 1150 transitions. [2021-01-06 20:58:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:44,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2021-01-06 20:58:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:44,577 INFO L225 Difference]: With dead ends: 839 [2021-01-06 20:58:44,577 INFO L226 Difference]: Without dead ends: 722 [2021-01-06 20:58:44,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:58:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-01-06 20:58:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 312. [2021-01-06 20:58:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 20:58:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 400 transitions. [2021-01-06 20:58:44,617 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 400 transitions. Word has length 63 [2021-01-06 20:58:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:44,618 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 400 transitions. [2021-01-06 20:58:44,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 400 transitions. [2021-01-06 20:58:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:58:44,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:44,620 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] [2021-01-06 20:58:44,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:58:44,620 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:44,621 INFO L82 PathProgramCache]: Analyzing trace with hash 202563885, now seen corresponding path program 1 times [2021-01-06 20:58:44,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:44,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784373898] [2021-01-06 20:58:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:44,765 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:58:44,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784373898] [2021-01-06 20:58:44,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:44,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:44,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17171493] [2021-01-06 20:58:44,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:44,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:44,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:44,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:44,769 INFO L87 Difference]: Start difference. First operand 312 states and 400 transitions. Second operand 9 states. [2021-01-06 20:58:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:45,554 INFO L93 Difference]: Finished difference Result 874 states and 1189 transitions. [2021-01-06 20:58:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:45,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2021-01-06 20:58:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:45,559 INFO L225 Difference]: With dead ends: 874 [2021-01-06 20:58:45,559 INFO L226 Difference]: Without dead ends: 722 [2021-01-06 20:58:45,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:58:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-01-06 20:58:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 312. [2021-01-06 20:58:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 20:58:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 399 transitions. [2021-01-06 20:58:45,596 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 399 transitions. Word has length 63 [2021-01-06 20:58:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:45,597 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 399 transitions. [2021-01-06 20:58:45,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 399 transitions. [2021-01-06 20:58:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:58:45,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:45,598 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] [2021-01-06 20:58:45,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:58:45,599 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1398072207, now seen corresponding path program 1 times [2021-01-06 20:58:45,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:45,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789690709] [2021-01-06 20:58:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:45,766 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:58:45,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789690709] [2021-01-06 20:58:45,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:45,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:58:45,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490675725] [2021-01-06 20:58:45,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 20:58:45,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:45,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 20:58:45,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:58:45,769 INFO L87 Difference]: Start difference. First operand 312 states and 399 transitions. Second operand 8 states. [2021-01-06 20:58:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:46,292 INFO L93 Difference]: Finished difference Result 698 states and 921 transitions. [2021-01-06 20:58:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 20:58:46,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2021-01-06 20:58:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:46,298 INFO L225 Difference]: With dead ends: 698 [2021-01-06 20:58:46,298 INFO L226 Difference]: Without dead ends: 507 [2021-01-06 20:58:46,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-01-06 20:58:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-01-06 20:58:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 312. [2021-01-06 20:58:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 20:58:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 398 transitions. [2021-01-06 20:58:46,336 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 398 transitions. Word has length 63 [2021-01-06 20:58:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:46,336 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 398 transitions. [2021-01-06 20:58:46,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 20:58:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 398 transitions. [2021-01-06 20:58:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:58:46,345 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:46,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:46,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:58:46,346 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -620136770, now seen corresponding path program 1 times [2021-01-06 20:58:46,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:46,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291982581] [2021-01-06 20:58:46,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:46,578 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:58:46,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291982581] [2021-01-06 20:58:46,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:46,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:46,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936533216] [2021-01-06 20:58:46,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:46,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:46,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:46,581 INFO L87 Difference]: Start difference. First operand 312 states and 398 transitions. Second operand 9 states. [2021-01-06 20:58:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:47,467 INFO L93 Difference]: Finished difference Result 820 states and 1117 transitions. [2021-01-06 20:58:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:47,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2021-01-06 20:58:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:47,472 INFO L225 Difference]: With dead ends: 820 [2021-01-06 20:58:47,472 INFO L226 Difference]: Without dead ends: 710 [2021-01-06 20:58:47,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:58:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-01-06 20:58:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 312. [2021-01-06 20:58:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 20:58:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 397 transitions. [2021-01-06 20:58:47,515 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 397 transitions. Word has length 65 [2021-01-06 20:58:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:47,516 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 397 transitions. [2021-01-06 20:58:47,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 397 transitions. [2021-01-06 20:58:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:58:47,517 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:47,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:47,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:58:47,518 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1292060332, now seen corresponding path program 1 times [2021-01-06 20:58:47,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:47,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491470004] [2021-01-06 20:58:47,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:47,741 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:58:47,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491470004] [2021-01-06 20:58:47,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:47,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:58:47,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773900287] [2021-01-06 20:58:47,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:58:47,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:58:47,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:58:47,744 INFO L87 Difference]: Start difference. First operand 312 states and 397 transitions. Second operand 11 states. [2021-01-06 20:58:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:50,622 INFO L93 Difference]: Finished difference Result 1861 states and 2629 transitions. [2021-01-06 20:58:50,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 20:58:50,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2021-01-06 20:58:50,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:50,633 INFO L225 Difference]: With dead ends: 1861 [2021-01-06 20:58:50,634 INFO L226 Difference]: Without dead ends: 1739 [2021-01-06 20:58:50,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=374, Invalid=1186, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 20:58:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-01-06 20:58:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 316. [2021-01-06 20:58:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2021-01-06 20:58:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 401 transitions. [2021-01-06 20:58:50,698 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 401 transitions. Word has length 65 [2021-01-06 20:58:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:50,698 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 401 transitions. [2021-01-06 20:58:50,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:58:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 401 transitions. [2021-01-06 20:58:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:58:50,699 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:50,699 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:50,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:58:50,700 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash -109241464, now seen corresponding path program 1 times [2021-01-06 20:58:50,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:50,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009756141] [2021-01-06 20:58:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:50,836 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:58:50,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009756141] [2021-01-06 20:58:50,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:50,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:50,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415953802] [2021-01-06 20:58:50,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:50,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:50,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:50,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:50,839 INFO L87 Difference]: Start difference. First operand 316 states and 401 transitions. Second operand 9 states. [2021-01-06 20:58:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:51,854 INFO L93 Difference]: Finished difference Result 821 states and 1117 transitions. [2021-01-06 20:58:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:51,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2021-01-06 20:58:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:51,859 INFO L225 Difference]: With dead ends: 821 [2021-01-06 20:58:51,859 INFO L226 Difference]: Without dead ends: 714 [2021-01-06 20:58:51,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:58:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-01-06 20:58:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2021-01-06 20:58:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2021-01-06 20:58:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 400 transitions. [2021-01-06 20:58:51,923 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 400 transitions. Word has length 65 [2021-01-06 20:58:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:51,923 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 400 transitions. [2021-01-06 20:58:51,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 400 transitions. [2021-01-06 20:58:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:58:51,925 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:51,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:51,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:58:51,926 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:51,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1375273345, now seen corresponding path program 1 times [2021-01-06 20:58:51,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:51,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816402101] [2021-01-06 20:58:51,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:52,143 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:58:52,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816402101] [2021-01-06 20:58:52,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:52,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:58:52,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509396532] [2021-01-06 20:58:52,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:58:52,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:52,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:58:52,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:58:52,146 INFO L87 Difference]: Start difference. First operand 316 states and 400 transitions. Second operand 11 states. [2021-01-06 20:58:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:54,364 INFO L93 Difference]: Finished difference Result 1276 states and 1770 transitions. [2021-01-06 20:58:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 20:58:54,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2021-01-06 20:58:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:54,372 INFO L225 Difference]: With dead ends: 1276 [2021-01-06 20:58:54,372 INFO L226 Difference]: Without dead ends: 1271 [2021-01-06 20:58:54,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2021-01-06 20:58:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2021-01-06 20:58:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 320. [2021-01-06 20:58:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2021-01-06 20:58:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 404 transitions. [2021-01-06 20:58:54,437 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 404 transitions. Word has length 65 [2021-01-06 20:58:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:54,438 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 404 transitions. [2021-01-06 20:58:54,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:58:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 404 transitions. [2021-01-06 20:58:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:58:54,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:54,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:54,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:58:54,439 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2058271748, now seen corresponding path program 1 times [2021-01-06 20:58:54,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:54,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005007875] [2021-01-06 20:58:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:54,571 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:58:54,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005007875] [2021-01-06 20:58:54,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:54,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:54,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779759373] [2021-01-06 20:58:54,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:54,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:54,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:54,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:54,573 INFO L87 Difference]: Start difference. First operand 320 states and 404 transitions. Second operand 9 states. [2021-01-06 20:58:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:55,584 INFO L93 Difference]: Finished difference Result 719 states and 961 transitions. [2021-01-06 20:58:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:55,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2021-01-06 20:58:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:55,589 INFO L225 Difference]: With dead ends: 719 [2021-01-06 20:58:55,589 INFO L226 Difference]: Without dead ends: 714 [2021-01-06 20:58:55,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:58:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-01-06 20:58:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 320. [2021-01-06 20:58:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2021-01-06 20:58:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 403 transitions. [2021-01-06 20:58:55,651 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 403 transitions. Word has length 65 [2021-01-06 20:58:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:55,651 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 403 transitions. [2021-01-06 20:58:55,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 403 transitions. [2021-01-06 20:58:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:58:55,653 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:55,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:55,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:58:55,653 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash -324498446, now seen corresponding path program 1 times [2021-01-06 20:58:55,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:55,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166079166] [2021-01-06 20:58:55,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:55,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:58:55,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166079166] [2021-01-06 20:58:55,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:55,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:55,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178126658] [2021-01-06 20:58:55,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:55,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:55,786 INFO L87 Difference]: Start difference. First operand 320 states and 403 transitions. Second operand 9 states. [2021-01-06 20:58:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:56,834 INFO L93 Difference]: Finished difference Result 743 states and 994 transitions. [2021-01-06 20:58:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:56,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2021-01-06 20:58:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:56,841 INFO L225 Difference]: With dead ends: 743 [2021-01-06 20:58:56,842 INFO L226 Difference]: Without dead ends: 726 [2021-01-06 20:58:56,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:58:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-01-06 20:58:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 320. [2021-01-06 20:58:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2021-01-06 20:58:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 402 transitions. [2021-01-06 20:58:56,908 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 402 transitions. Word has length 65 [2021-01-06 20:58:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:56,908 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 402 transitions. [2021-01-06 20:58:56,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 402 transitions. [2021-01-06 20:58:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:58:56,909 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:56,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:56,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:58:56,910 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash 50031272, now seen corresponding path program 1 times [2021-01-06 20:58:56,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:56,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861652915] [2021-01-06 20:58:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:57,051 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:58:57,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861652915] [2021-01-06 20:58:57,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:57,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:57,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565452513] [2021-01-06 20:58:57,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:57,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:57,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:57,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:57,054 INFO L87 Difference]: Start difference. First operand 320 states and 402 transitions. Second operand 9 states. [2021-01-06 20:58:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:58,360 INFO L93 Difference]: Finished difference Result 719 states and 959 transitions. [2021-01-06 20:58:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:58,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2021-01-06 20:58:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:58,365 INFO L225 Difference]: With dead ends: 719 [2021-01-06 20:58:58,365 INFO L226 Difference]: Without dead ends: 714 [2021-01-06 20:58:58,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:58:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-01-06 20:58:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2021-01-06 20:58:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2021-01-06 20:58:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 397 transitions. [2021-01-06 20:58:58,435 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 397 transitions. Word has length 66 [2021-01-06 20:58:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:58,436 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 397 transitions. [2021-01-06 20:58:58,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 397 transitions. [2021-01-06 20:58:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:58:58,437 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:58,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:58,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:58:58,437 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:58,438 INFO L82 PathProgramCache]: Analyzing trace with hash -849466761, now seen corresponding path program 1 times [2021-01-06 20:58:58,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:58,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137424607] [2021-01-06 20:58:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:58:58,566 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:58:58,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137424607] [2021-01-06 20:58:58,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:58:58,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:58:58,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304328262] [2021-01-06 20:58:58,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:58:58,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:58:58,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:58:58,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:58:58,569 INFO L87 Difference]: Start difference. First operand 316 states and 397 transitions. Second operand 9 states. [2021-01-06 20:58:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:58:59,610 INFO L93 Difference]: Finished difference Result 844 states and 1145 transitions. [2021-01-06 20:58:59,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:58:59,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2021-01-06 20:58:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:58:59,615 INFO L225 Difference]: With dead ends: 844 [2021-01-06 20:58:59,615 INFO L226 Difference]: Without dead ends: 722 [2021-01-06 20:58:59,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:58:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-01-06 20:58:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 312. [2021-01-06 20:58:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 20:58:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 392 transitions. [2021-01-06 20:58:59,677 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 392 transitions. Word has length 66 [2021-01-06 20:58:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:58:59,677 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 392 transitions. [2021-01-06 20:58:59,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:58:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 392 transitions. [2021-01-06 20:58:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 20:58:59,678 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:58:59,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:58:59,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:58:59,679 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:58:59,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:58:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -809481061, now seen corresponding path program 1 times [2021-01-06 20:58:59,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:58:59,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939407052] [2021-01-06 20:58:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:58:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:59:00,453 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:59:00,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939407052] [2021-01-06 20:59:00,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:59:00,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-01-06 20:59:00,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121024510] [2021-01-06 20:59:00,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 20:59:00,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:59:00,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 20:59:00,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:59:00,455 INFO L87 Difference]: Start difference. First operand 312 states and 392 transitions. Second operand 22 states. [2021-01-06 20:59:00,738 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2021-01-06 20:59:01,688 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2021-01-06 20:59:01,904 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2021-01-06 20:59:02,053 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-01-06 20:59:02,455 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2021-01-06 20:59:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:59:06,421 INFO L93 Difference]: Finished difference Result 1337 states and 1771 transitions. [2021-01-06 20:59:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-06 20:59:06,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2021-01-06 20:59:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:59:06,427 INFO L225 Difference]: With dead ends: 1337 [2021-01-06 20:59:06,427 INFO L226 Difference]: Without dead ends: 1228 [2021-01-06 20:59:06,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 20:59:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2021-01-06 20:59:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 323. [2021-01-06 20:59:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2021-01-06 20:59:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 406 transitions. [2021-01-06 20:59:06,495 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 406 transitions. Word has length 67 [2021-01-06 20:59:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:59:06,496 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 406 transitions. [2021-01-06 20:59:06,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 20:59:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 406 transitions. [2021-01-06 20:59:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 20:59:06,496 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:59:06,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:59:06,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:59:06,497 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:59:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:59:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1704969087, now seen corresponding path program 1 times [2021-01-06 20:59:06,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:59:06,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70328612] [2021-01-06 20:59:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:59:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:59:07,513 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:59:07,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70328612] [2021-01-06 20:59:07,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:59:07,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-01-06 20:59:07,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317308712] [2021-01-06 20:59:07,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-06 20:59:07,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:59:07,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-06 20:59:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2021-01-06 20:59:07,515 INFO L87 Difference]: Start difference. First operand 323 states and 406 transitions. Second operand 24 states. [2021-01-06 20:59:07,913 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2021-01-06 20:59:08,424 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-01-06 20:59:08,594 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-01-06 20:59:08,763 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2021-01-06 20:59:09,076 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-01-06 20:59:09,341 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2021-01-06 20:59:09,647 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2021-01-06 20:59:09,890 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2021-01-06 20:59:10,133 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2021-01-06 20:59:10,373 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-01-06 20:59:10,656 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2021-01-06 20:59:10,886 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2021-01-06 20:59:15,040 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2021-01-06 20:59:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:59:15,987 INFO L93 Difference]: Finished difference Result 1480 states and 2021 transitions. [2021-01-06 20:59:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-06 20:59:15,988 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2021-01-06 20:59:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:59:15,994 INFO L225 Difference]: With dead ends: 1480 [2021-01-06 20:59:15,994 INFO L226 Difference]: Without dead ends: 1368 [2021-01-06 20:59:15,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=402, Invalid=1668, Unknown=0, NotChecked=0, Total=2070 [2021-01-06 20:59:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2021-01-06 20:59:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 328. [2021-01-06 20:59:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2021-01-06 20:59:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 412 transitions. [2021-01-06 20:59:16,089 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 412 transitions. Word has length 67 [2021-01-06 20:59:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:59:16,089 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 412 transitions. [2021-01-06 20:59:16,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-06 20:59:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 412 transitions. [2021-01-06 20:59:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 20:59:16,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:59:16,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:59:16,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 20:59:16,091 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:59:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:59:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1258064571, now seen corresponding path program 1 times [2021-01-06 20:59:16,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:59:16,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827101579] [2021-01-06 20:59:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:59:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:59:17,166 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:59:17,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827101579] [2021-01-06 20:59:17,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:59:17,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-01-06 20:59:17,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26100210] [2021-01-06 20:59:17,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-06 20:59:17,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:59:17,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-06 20:59:17,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2021-01-06 20:59:17,170 INFO L87 Difference]: Start difference. First operand 328 states and 412 transitions. Second operand 25 states. [2021-01-06 20:59:17,625 WARN L197 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 120 [2021-01-06 20:59:18,313 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2021-01-06 20:59:18,500 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-06 20:59:18,693 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2021-01-06 20:59:19,053 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-01-06 20:59:19,362 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2021-01-06 20:59:19,731 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2021-01-06 20:59:20,017 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-01-06 20:59:20,305 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-01-06 20:59:20,583 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-01-06 20:59:20,917 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2021-01-06 20:59:21,187 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2021-01-06 20:59:21,618 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2021-01-06 20:59:21,956 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2021-01-06 20:59:22,260 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2021-01-06 20:59:22,621 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-01-06 20:59:22,787 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2021-01-06 20:59:23,095 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2021-01-06 20:59:23,386 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-01-06 20:59:27,804 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2021-01-06 20:59:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:59:28,761 INFO L93 Difference]: Finished difference Result 1781 states and 2443 transitions. [2021-01-06 20:59:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-01-06 20:59:28,763 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2021-01-06 20:59:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:59:28,770 INFO L225 Difference]: With dead ends: 1781 [2021-01-06 20:59:28,771 INFO L226 Difference]: Without dead ends: 1673 [2021-01-06 20:59:28,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=571, Invalid=2291, Unknown=0, NotChecked=0, Total=2862 [2021-01-06 20:59:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2021-01-06 20:59:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 325. [2021-01-06 20:59:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2021-01-06 20:59:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2021-01-06 20:59:28,870 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 67 [2021-01-06 20:59:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:59:28,870 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2021-01-06 20:59:28,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-06 20:59:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2021-01-06 20:59:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 20:59:28,872 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:59:28,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:59:28,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 20:59:28,872 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:59:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:59:28,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1868195616, now seen corresponding path program 1 times [2021-01-06 20:59:28,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:59:28,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390931755] [2021-01-06 20:59:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:59:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:59:29,761 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:59:29,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390931755] [2021-01-06 20:59:29,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:59:29,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-01-06 20:59:29,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471036638] [2021-01-06 20:59:29,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 20:59:29,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:59:29,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 20:59:29,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2021-01-06 20:59:29,764 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 23 states. [2021-01-06 20:59:30,166 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2021-01-06 20:59:30,898 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2021-01-06 20:59:31,087 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-01-06 20:59:31,416 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-01-06 20:59:31,684 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-01-06 20:59:31,999 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2021-01-06 20:59:32,249 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-01-06 20:59:32,483 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-01-06 20:59:32,912 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-01-06 20:59:33,170 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-01-06 20:59:33,451 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-06 20:59:33,716 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-01-06 20:59:33,980 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-06 20:59:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:59:38,513 INFO L93 Difference]: Finished difference Result 1205 states and 1585 transitions. [2021-01-06 20:59:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 20:59:38,514 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2021-01-06 20:59:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:59:38,518 INFO L225 Difference]: With dead ends: 1205 [2021-01-06 20:59:38,518 INFO L226 Difference]: Without dead ends: 1093 [2021-01-06 20:59:38,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 20:59:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-01-06 20:59:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 331. [2021-01-06 20:59:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2021-01-06 20:59:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 414 transitions. [2021-01-06 20:59:38,607 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 414 transitions. Word has length 67 [2021-01-06 20:59:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:59:38,608 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 414 transitions. [2021-01-06 20:59:38,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 20:59:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 414 transitions. [2021-01-06 20:59:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 20:59:38,609 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:59:38,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:59:38,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 20:59:38,609 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:59:38,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:59:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash -827796874, now seen corresponding path program 1 times [2021-01-06 20:59:38,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:59:38,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104018732] [2021-01-06 20:59:38,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:59:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:59:39,603 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:59:39,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104018732] [2021-01-06 20:59:39,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:59:39,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-01-06 20:59:39,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392791318] [2021-01-06 20:59:39,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 20:59:39,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:59:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 20:59:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-01-06 20:59:39,605 INFO L87 Difference]: Start difference. First operand 331 states and 414 transitions. Second operand 23 states. [2021-01-06 20:59:39,908 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2021-01-06 20:59:40,859 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-01-06 20:59:41,087 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2021-01-06 20:59:41,354 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2021-01-06 20:59:41,538 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-06 20:59:41,720 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-06 20:59:43,417 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-01-06 20:59:44,063 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2021-01-06 20:59:45,298 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2021-01-06 20:59:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:59:47,018 INFO L93 Difference]: Finished difference Result 1101 states and 1435 transitions. [2021-01-06 20:59:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 20:59:47,020 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2021-01-06 20:59:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:59:47,025 INFO L225 Difference]: With dead ends: 1101 [2021-01-06 20:59:47,025 INFO L226 Difference]: Without dead ends: 992 [2021-01-06 20:59:47,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=360, Invalid=1896, Unknown=0, NotChecked=0, Total=2256 [2021-01-06 20:59:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-01-06 20:59:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 346. [2021-01-06 20:59:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2021-01-06 20:59:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 435 transitions. [2021-01-06 20:59:47,135 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 435 transitions. Word has length 67 [2021-01-06 20:59:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:59:47,135 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 435 transitions. [2021-01-06 20:59:47,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 20:59:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 435 transitions. [2021-01-06 20:59:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 20:59:47,137 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:59:47,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:59:47,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 20:59:47,138 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:59:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:59:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash 455689729, now seen corresponding path program 1 times [2021-01-06 20:59:47,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:59:47,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786717274] [2021-01-06 20:59:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:59:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:59:48,369 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:59:48,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786717274] [2021-01-06 20:59:48,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:59:48,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-01-06 20:59:48,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787747081] [2021-01-06 20:59:48,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 20:59:48,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:59:48,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 20:59:48,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:59:48,371 INFO L87 Difference]: Start difference. First operand 346 states and 435 transitions. Second operand 22 states. [2021-01-06 20:59:48,748 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2021-01-06 20:59:49,188 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2021-01-06 20:59:49,359 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2021-01-06 20:59:49,533 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2021-01-06 20:59:49,866 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-01-06 20:59:50,155 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2021-01-06 20:59:50,514 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2021-01-06 20:59:50,770 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2021-01-06 20:59:51,003 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2021-01-06 20:59:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:59:56,389 INFO L93 Difference]: Finished difference Result 1128 states and 1461 transitions. [2021-01-06 20:59:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 20:59:56,394 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2021-01-06 20:59:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:59:56,400 INFO L225 Difference]: With dead ends: 1128 [2021-01-06 20:59:56,400 INFO L226 Difference]: Without dead ends: 1124 [2021-01-06 20:59:56,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=279, Invalid=1361, Unknown=0, NotChecked=0, Total=1640 [2021-01-06 20:59:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-01-06 20:59:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 356. [2021-01-06 20:59:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2021-01-06 20:59:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 449 transitions. [2021-01-06 20:59:56,534 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 449 transitions. Word has length 67 [2021-01-06 20:59:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:59:56,535 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 449 transitions. [2021-01-06 20:59:56,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 20:59:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 449 transitions. [2021-01-06 20:59:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 20:59:56,536 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:59:56,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:59:56,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 20:59:56,537 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:59:56,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:59:56,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1324827419, now seen corresponding path program 1 times [2021-01-06 20:59:56,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:59:56,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880866122] [2021-01-06 20:59:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:59:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:59:57,679 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:59:57,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880866122] [2021-01-06 20:59:57,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:59:57,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-01-06 20:59:57,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562262433] [2021-01-06 20:59:57,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 20:59:57,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:59:57,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 20:59:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2021-01-06 20:59:57,682 INFO L87 Difference]: Start difference. First operand 356 states and 449 transitions. Second operand 23 states. [2021-01-06 20:59:58,005 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2021-01-06 20:59:58,652 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-01-06 20:59:58,838 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-01-06 20:59:59,030 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-01-06 20:59:59,339 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-01-06 20:59:59,581 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-06 20:59:59,882 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2021-01-06 21:00:00,157 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-06 21:00:00,425 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-06 21:00:00,608 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-01-06 21:00:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:05,304 INFO L93 Difference]: Finished difference Result 1071 states and 1409 transitions. [2021-01-06 21:00:05,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 21:00:05,305 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2021-01-06 21:00:05,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:05,309 INFO L225 Difference]: With dead ends: 1071 [2021-01-06 21:00:05,309 INFO L226 Difference]: Without dead ends: 959 [2021-01-06 21:00:05,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2021-01-06 21:00:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-01-06 21:00:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 361. [2021-01-06 21:00:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2021-01-06 21:00:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 455 transitions. [2021-01-06 21:00:05,418 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 455 transitions. Word has length 67 [2021-01-06 21:00:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:05,419 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 455 transitions. [2021-01-06 21:00:05,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 21:00:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 455 transitions. [2021-01-06 21:00:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:05,420 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:05,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:05,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 21:00:05,420 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:05,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1391401820, now seen corresponding path program 1 times [2021-01-06 21:00:05,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:05,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704044156] [2021-01-06 21:00:05,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:05,686 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 21:00:05,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704044156] [2021-01-06 21:00:05,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:05,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:00:05,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667721780] [2021-01-06 21:00:05,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 21:00:05,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:05,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 21:00:05,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 21:00:05,688 INFO L87 Difference]: Start difference. First operand 361 states and 455 transitions. Second operand 11 states. [2021-01-06 21:00:06,260 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2021-01-06 21:00:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:08,866 INFO L93 Difference]: Finished difference Result 1318 states and 1819 transitions. [2021-01-06 21:00:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 21:00:08,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2021-01-06 21:00:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:08,873 INFO L225 Difference]: With dead ends: 1318 [2021-01-06 21:00:08,874 INFO L226 Difference]: Without dead ends: 1311 [2021-01-06 21:00:08,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2021-01-06 21:00:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2021-01-06 21:00:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 365. [2021-01-06 21:00:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2021-01-06 21:00:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 458 transitions. [2021-01-06 21:00:09,006 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 458 transitions. Word has length 68 [2021-01-06 21:00:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:09,007 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 458 transitions. [2021-01-06 21:00:09,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 21:00:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 458 transitions. [2021-01-06 21:00:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:09,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:09,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:09,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 21:00:09,008 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash 851991008, now seen corresponding path program 1 times [2021-01-06 21:00:09,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:09,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015329785] [2021-01-06 21:00:09,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:09,836 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 21:00:09,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015329785] [2021-01-06 21:00:09,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:09,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 21:00:09,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535772479] [2021-01-06 21:00:09,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 21:00:09,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:09,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 21:00:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-01-06 21:00:09,838 INFO L87 Difference]: Start difference. First operand 365 states and 458 transitions. Second operand 19 states. [2021-01-06 21:00:10,047 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2021-01-06 21:00:10,518 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2021-01-06 21:00:10,724 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2021-01-06 21:00:11,022 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2021-01-06 21:00:11,393 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-01-06 21:00:11,715 WARN L197 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-01-06 21:00:12,043 WARN L197 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-01-06 21:00:12,379 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-01-06 21:00:12,665 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2021-01-06 21:00:13,020 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-01-06 21:00:13,290 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-01-06 21:00:13,548 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2021-01-06 21:00:13,889 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2021-01-06 21:00:14,183 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2021-01-06 21:00:14,539 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2021-01-06 21:00:15,386 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-01-06 21:00:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:18,299 INFO L93 Difference]: Finished difference Result 1218 states and 1646 transitions. [2021-01-06 21:00:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-06 21:00:18,302 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2021-01-06 21:00:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:18,306 INFO L225 Difference]: With dead ends: 1218 [2021-01-06 21:00:18,306 INFO L226 Difference]: Without dead ends: 1103 [2021-01-06 21:00:18,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 21:00:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2021-01-06 21:00:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 361. [2021-01-06 21:00:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2021-01-06 21:00:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 453 transitions. [2021-01-06 21:00:18,429 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 453 transitions. Word has length 68 [2021-01-06 21:00:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:18,430 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 453 transitions. [2021-01-06 21:00:18,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 21:00:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 453 transitions. [2021-01-06 21:00:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:18,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:18,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:18,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 21:00:18,432 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1015007640, now seen corresponding path program 1 times [2021-01-06 21:00:18,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:18,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309832188] [2021-01-06 21:00:18,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:19,262 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 21:00:19,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309832188] [2021-01-06 21:00:19,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:19,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 21:00:19,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412619859] [2021-01-06 21:00:19,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 21:00:19,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:19,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 21:00:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:00:19,265 INFO L87 Difference]: Start difference. First operand 361 states and 453 transitions. Second operand 14 states. [2021-01-06 21:00:19,707 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2021-01-06 21:00:19,920 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2021-01-06 21:00:20,067 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2021-01-06 21:00:20,266 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-01-06 21:00:20,462 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2021-01-06 21:00:20,683 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2021-01-06 21:00:21,077 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-01-06 21:00:21,531 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2021-01-06 21:00:22,130 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2021-01-06 21:00:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:23,056 INFO L93 Difference]: Finished difference Result 684 states and 900 transitions. [2021-01-06 21:00:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 21:00:23,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2021-01-06 21:00:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:23,060 INFO L225 Difference]: With dead ends: 684 [2021-01-06 21:00:23,061 INFO L226 Difference]: Without dead ends: 575 [2021-01-06 21:00:23,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2021-01-06 21:00:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-01-06 21:00:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 361. [2021-01-06 21:00:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2021-01-06 21:00:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 453 transitions. [2021-01-06 21:00:23,162 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 453 transitions. Word has length 68 [2021-01-06 21:00:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:23,162 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 453 transitions. [2021-01-06 21:00:23,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 21:00:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 453 transitions. [2021-01-06 21:00:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:23,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:23,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:23,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 21:00:23,163 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:23,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1491365129, now seen corresponding path program 1 times [2021-01-06 21:00:23,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:23,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537577234] [2021-01-06 21:00:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:23,803 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 21:00:23,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537577234] [2021-01-06 21:00:23,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:23,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 21:00:23,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52514425] [2021-01-06 21:00:23,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 21:00:23,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:23,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 21:00:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-01-06 21:00:23,805 INFO L87 Difference]: Start difference. First operand 361 states and 453 transitions. Second operand 12 states. [2021-01-06 21:00:24,077 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2021-01-06 21:00:24,239 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2021-01-06 21:00:24,410 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2021-01-06 21:00:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:25,492 INFO L93 Difference]: Finished difference Result 582 states and 752 transitions. [2021-01-06 21:00:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 21:00:25,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2021-01-06 21:00:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:25,495 INFO L225 Difference]: With dead ends: 582 [2021-01-06 21:00:25,495 INFO L226 Difference]: Without dead ends: 470 [2021-01-06 21:00:25,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-01-06 21:00:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-01-06 21:00:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 354. [2021-01-06 21:00:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2021-01-06 21:00:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 444 transitions. [2021-01-06 21:00:25,621 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 444 transitions. Word has length 68 [2021-01-06 21:00:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:25,621 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 444 transitions. [2021-01-06 21:00:25,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 21:00:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 444 transitions. [2021-01-06 21:00:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:25,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:25,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:25,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 21:00:25,623 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash -448466355, now seen corresponding path program 1 times [2021-01-06 21:00:25,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:25,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547180659] [2021-01-06 21:00:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:26,072 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 21:00:26,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547180659] [2021-01-06 21:00:26,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:26,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 21:00:26,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368519580] [2021-01-06 21:00:26,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 21:00:26,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 21:00:26,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-06 21:00:26,074 INFO L87 Difference]: Start difference. First operand 354 states and 444 transitions. Second operand 11 states. [2021-01-06 21:00:26,562 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2021-01-06 21:00:26,724 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-01-06 21:00:26,875 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-01-06 21:00:27,137 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-01-06 21:00:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:28,475 INFO L93 Difference]: Finished difference Result 840 states and 1136 transitions. [2021-01-06 21:00:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 21:00:28,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2021-01-06 21:00:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:28,479 INFO L225 Difference]: With dead ends: 840 [2021-01-06 21:00:28,480 INFO L226 Difference]: Without dead ends: 735 [2021-01-06 21:00:28,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-01-06 21:00:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-01-06 21:00:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 354. [2021-01-06 21:00:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2021-01-06 21:00:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 443 transitions. [2021-01-06 21:00:28,588 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 443 transitions. Word has length 68 [2021-01-06 21:00:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:28,588 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 443 transitions. [2021-01-06 21:00:28,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 21:00:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 443 transitions. [2021-01-06 21:00:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:28,589 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:28,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:28,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 21:00:28,589 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1832247928, now seen corresponding path program 1 times [2021-01-06 21:00:28,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:28,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351871419] [2021-01-06 21:00:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:29,294 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 21:00:29,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351871419] [2021-01-06 21:00:29,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:29,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 21:00:29,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574546687] [2021-01-06 21:00:29,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 21:00:29,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:29,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 21:00:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:00:29,296 INFO L87 Difference]: Start difference. First operand 354 states and 443 transitions. Second operand 13 states. [2021-01-06 21:00:29,429 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-01-06 21:00:29,971 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-01-06 21:00:30,195 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-01-06 21:00:30,383 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-01-06 21:00:30,542 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-01-06 21:00:30,749 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2021-01-06 21:00:30,911 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-01-06 21:00:31,196 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2021-01-06 21:00:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:32,795 INFO L93 Difference]: Finished difference Result 1164 states and 1563 transitions. [2021-01-06 21:00:32,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 21:00:32,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2021-01-06 21:00:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:32,801 INFO L225 Difference]: With dead ends: 1164 [2021-01-06 21:00:32,801 INFO L226 Difference]: Without dead ends: 977 [2021-01-06 21:00:32,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=219, Invalid=537, Unknown=0, NotChecked=0, Total=756 [2021-01-06 21:00:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-01-06 21:00:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 272. [2021-01-06 21:00:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-06 21:00:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 348 transitions. [2021-01-06 21:00:32,896 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 348 transitions. Word has length 68 [2021-01-06 21:00:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:32,896 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 348 transitions. [2021-01-06 21:00:32,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 21:00:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 348 transitions. [2021-01-06 21:00:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:32,897 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:32,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:32,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 21:00:32,898 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash -922376210, now seen corresponding path program 1 times [2021-01-06 21:00:32,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:32,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076069402] [2021-01-06 21:00:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:33,549 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 21:00:33,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076069402] [2021-01-06 21:00:33,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:33,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 21:00:33,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193791571] [2021-01-06 21:00:33,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 21:00:33,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:33,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 21:00:33,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:00:33,551 INFO L87 Difference]: Start difference. First operand 272 states and 348 transitions. Second operand 13 states. [2021-01-06 21:00:33,912 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-01-06 21:00:34,051 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2021-01-06 21:00:34,228 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2021-01-06 21:00:34,396 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-01-06 21:00:34,586 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-01-06 21:00:34,951 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-01-06 21:00:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:35,739 INFO L93 Difference]: Finished difference Result 647 states and 877 transitions. [2021-01-06 21:00:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 21:00:35,740 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2021-01-06 21:00:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:35,742 INFO L225 Difference]: With dead ends: 647 [2021-01-06 21:00:35,742 INFO L226 Difference]: Without dead ends: 538 [2021-01-06 21:00:35,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2021-01-06 21:00:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-01-06 21:00:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 258. [2021-01-06 21:00:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2021-01-06 21:00:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 328 transitions. [2021-01-06 21:00:35,832 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 328 transitions. Word has length 68 [2021-01-06 21:00:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:35,832 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 328 transitions. [2021-01-06 21:00:35,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 21:00:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 328 transitions. [2021-01-06 21:00:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:35,833 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:35,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:35,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 21:00:35,834 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash 361110393, now seen corresponding path program 1 times [2021-01-06 21:00:35,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:35,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982670214] [2021-01-06 21:00:35,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:36,496 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 21:00:36,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982670214] [2021-01-06 21:00:36,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:36,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 21:00:36,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711169811] [2021-01-06 21:00:36,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 21:00:36,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:36,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 21:00:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:00:36,498 INFO L87 Difference]: Start difference. First operand 258 states and 328 transitions. Second operand 14 states. [2021-01-06 21:00:37,186 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2021-01-06 21:00:37,395 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2021-01-06 21:00:37,562 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2021-01-06 21:00:37,762 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2021-01-06 21:00:37,966 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-01-06 21:00:38,244 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-01-06 21:00:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:39,568 INFO L93 Difference]: Finished difference Result 895 states and 1232 transitions. [2021-01-06 21:00:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 21:00:39,570 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2021-01-06 21:00:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:39,573 INFO L225 Difference]: With dead ends: 895 [2021-01-06 21:00:39,573 INFO L226 Difference]: Without dead ends: 757 [2021-01-06 21:00:39,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-01-06 21:00:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2021-01-06 21:00:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 249. [2021-01-06 21:00:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-01-06 21:00:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 314 transitions. [2021-01-06 21:00:39,703 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 314 transitions. Word has length 68 [2021-01-06 21:00:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:39,703 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 314 transitions. [2021-01-06 21:00:39,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 21:00:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 314 transitions. [2021-01-06 21:00:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:39,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:39,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:39,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 21:00:39,704 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash 823611388, now seen corresponding path program 1 times [2021-01-06 21:00:39,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:39,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109822869] [2021-01-06 21:00:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:39,892 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 21:00:39,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109822869] [2021-01-06 21:00:39,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:39,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:00:39,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243660479] [2021-01-06 21:00:39,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:00:39,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:39,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:00:39,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:00:39,894 INFO L87 Difference]: Start difference. First operand 249 states and 314 transitions. Second operand 9 states. [2021-01-06 21:00:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:40,994 INFO L93 Difference]: Finished difference Result 399 states and 515 transitions. [2021-01-06 21:00:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 21:00:40,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2021-01-06 21:00:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:41,000 INFO L225 Difference]: With dead ends: 399 [2021-01-06 21:00:41,000 INFO L226 Difference]: Without dead ends: 392 [2021-01-06 21:00:41,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-01-06 21:00:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-01-06 21:00:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 249. [2021-01-06 21:00:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-01-06 21:00:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 313 transitions. [2021-01-06 21:00:41,107 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 313 transitions. Word has length 68 [2021-01-06 21:00:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:41,107 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 313 transitions. [2021-01-06 21:00:41,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:00:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 313 transitions. [2021-01-06 21:00:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:41,108 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:41,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 21:00:41,108 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash 520441226, now seen corresponding path program 1 times [2021-01-06 21:00:41,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:41,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220544975] [2021-01-06 21:00:41,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:41,378 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 21:00:41,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220544975] [2021-01-06 21:00:41,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:41,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:00:41,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894357047] [2021-01-06 21:00:41,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 21:00:41,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:41,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 21:00:41,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 21:00:41,380 INFO L87 Difference]: Start difference. First operand 249 states and 313 transitions. Second operand 11 states. [2021-01-06 21:00:42,009 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-01-06 21:00:42,918 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-01-06 21:00:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:46,887 INFO L93 Difference]: Finished difference Result 1771 states and 2508 transitions. [2021-01-06 21:00:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 21:00:46,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2021-01-06 21:00:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:46,895 INFO L225 Difference]: With dead ends: 1771 [2021-01-06 21:00:46,896 INFO L226 Difference]: Without dead ends: 1641 [2021-01-06 21:00:46,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=374, Invalid=1186, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 21:00:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2021-01-06 21:00:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 253. [2021-01-06 21:00:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2021-01-06 21:00:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 317 transitions. [2021-01-06 21:00:47,025 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 317 transitions. Word has length 68 [2021-01-06 21:00:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:47,026 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 317 transitions. [2021-01-06 21:00:47,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 21:00:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 317 transitions. [2021-01-06 21:00:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:47,026 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:47,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:47,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 21:00:47,027 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1956990499, now seen corresponding path program 1 times [2021-01-06 21:00:47,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:47,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196920174] [2021-01-06 21:00:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:47,358 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 21:00:47,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196920174] [2021-01-06 21:00:47,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:47,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:00:47,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765302090] [2021-01-06 21:00:47,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 21:00:47,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 21:00:47,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 21:00:47,360 INFO L87 Difference]: Start difference. First operand 253 states and 317 transitions. Second operand 11 states. [2021-01-06 21:00:47,759 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2021-01-06 21:00:48,130 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2021-01-06 21:00:49,103 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2021-01-06 21:00:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:50,374 INFO L93 Difference]: Finished difference Result 686 states and 926 transitions. [2021-01-06 21:00:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 21:00:50,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2021-01-06 21:00:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:50,378 INFO L225 Difference]: With dead ends: 686 [2021-01-06 21:00:50,378 INFO L226 Difference]: Without dead ends: 679 [2021-01-06 21:00:50,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2021-01-06 21:00:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-01-06 21:00:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 253. [2021-01-06 21:00:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2021-01-06 21:00:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 316 transitions. [2021-01-06 21:00:50,487 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 316 transitions. Word has length 68 [2021-01-06 21:00:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:50,488 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 316 transitions. [2021-01-06 21:00:50,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 21:00:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 316 transitions. [2021-01-06 21:00:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:50,488 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:50,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:50,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 21:00:50,489 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1580596319, now seen corresponding path program 1 times [2021-01-06 21:00:50,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:50,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197820994] [2021-01-06 21:00:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:51,349 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 21:00:51,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197820994] [2021-01-06 21:00:51,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:51,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 21:00:51,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106052884] [2021-01-06 21:00:51,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 21:00:51,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:51,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 21:00:51,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:00:51,351 INFO L87 Difference]: Start difference. First operand 253 states and 316 transitions. Second operand 14 states. [2021-01-06 21:00:51,499 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2021-01-06 21:00:51,676 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2021-01-06 21:00:51,831 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2021-01-06 21:00:52,059 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2021-01-06 21:00:52,229 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2021-01-06 21:00:52,458 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-01-06 21:00:52,670 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2021-01-06 21:00:52,899 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2021-01-06 21:00:53,261 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-01-06 21:00:53,616 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2021-01-06 21:00:54,042 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2021-01-06 21:00:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:54,805 INFO L93 Difference]: Finished difference Result 441 states and 575 transitions. [2021-01-06 21:00:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 21:00:54,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2021-01-06 21:00:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:54,808 INFO L225 Difference]: With dead ends: 441 [2021-01-06 21:00:54,808 INFO L226 Difference]: Without dead ends: 437 [2021-01-06 21:00:54,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2021-01-06 21:00:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-01-06 21:00:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 247. [2021-01-06 21:00:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2021-01-06 21:00:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2021-01-06 21:00:54,935 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 68 [2021-01-06 21:00:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:00:54,936 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2021-01-06 21:00:54,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 21:00:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2021-01-06 21:00:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:00:54,936 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:00:54,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:00:54,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 21:00:54,937 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:00:54,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:00:54,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1417579687, now seen corresponding path program 1 times [2021-01-06 21:00:54,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:00:54,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578389495] [2021-01-06 21:00:54,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:00:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:00:55,496 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-01-06 21:00:56,035 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 21:00:56,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578389495] [2021-01-06 21:00:56,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:00:56,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 21:00:56,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465607402] [2021-01-06 21:00:56,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 21:00:56,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:00:56,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 21:00:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:00:56,037 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand 14 states. [2021-01-06 21:00:56,188 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2021-01-06 21:00:56,417 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2021-01-06 21:00:56,567 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2021-01-06 21:00:56,756 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2021-01-06 21:00:57,063 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-01-06 21:00:57,392 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2021-01-06 21:00:57,677 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2021-01-06 21:00:57,933 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2021-01-06 21:00:58,551 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-01-06 21:00:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:00:59,891 INFO L93 Difference]: Finished difference Result 900 states and 1230 transitions. [2021-01-06 21:00:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 21:00:59,895 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2021-01-06 21:00:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:00:59,897 INFO L225 Difference]: With dead ends: 900 [2021-01-06 21:00:59,898 INFO L226 Difference]: Without dead ends: 868 [2021-01-06 21:00:59,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2021-01-06 21:00:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2021-01-06 21:01:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 209. [2021-01-06 21:01:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-01-06 21:01:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 267 transitions. [2021-01-06 21:01:00,004 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 267 transitions. Word has length 68 [2021-01-06 21:01:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:00,005 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 267 transitions. [2021-01-06 21:01:00,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 21:01:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 267 transitions. [2021-01-06 21:01:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 21:01:00,005 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:00,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:01:00,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 21:01:00,006 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:00,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1317093723, now seen corresponding path program 1 times [2021-01-06 21:01:00,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:00,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810115103] [2021-01-06 21:01:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:00,206 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 21:01:00,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810115103] [2021-01-06 21:01:00,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:00,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:01:00,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145864258] [2021-01-06 21:01:00,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:01:00,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:01:00,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:01:00,208 INFO L87 Difference]: Start difference. First operand 209 states and 267 transitions. Second operand 9 states. [2021-01-06 21:01:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:01,504 INFO L93 Difference]: Finished difference Result 488 states and 654 transitions. [2021-01-06 21:01:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 21:01:01,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2021-01-06 21:01:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:01,507 INFO L225 Difference]: With dead ends: 488 [2021-01-06 21:01:01,507 INFO L226 Difference]: Without dead ends: 358 [2021-01-06 21:01:01,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-01-06 21:01:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-01-06 21:01:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 205. [2021-01-06 21:01:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2021-01-06 21:01:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 262 transitions. [2021-01-06 21:01:01,651 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 262 transitions. Word has length 69 [2021-01-06 21:01:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:01,653 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 262 transitions. [2021-01-06 21:01:01,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:01:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 262 transitions. [2021-01-06 21:01:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:01:01,654 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:01,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:01:01,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 21:01:01,655 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1997555533, now seen corresponding path program 1 times [2021-01-06 21:01:01,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:01,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232927232] [2021-01-06 21:01:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:03,190 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 21:01:03,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232927232] [2021-01-06 21:01:03,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:03,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-01-06 21:01:03,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364912173] [2021-01-06 21:01:03,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 21:01:03,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 21:01:03,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-01-06 21:01:03,192 INFO L87 Difference]: Start difference. First operand 205 states and 262 transitions. Second operand 23 states. [2021-01-06 21:01:03,709 WARN L197 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2021-01-06 21:01:03,959 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2021-01-06 21:01:04,139 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2021-01-06 21:01:04,375 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2021-01-06 21:01:04,619 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2021-01-06 21:01:04,847 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2021-01-06 21:01:05,284 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-01-06 21:01:05,641 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-01-06 21:01:06,104 WARN L197 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2021-01-06 21:01:06,499 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-01-06 21:01:06,853 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-01-06 21:01:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:14,243 INFO L93 Difference]: Finished difference Result 1270 states and 1773 transitions. [2021-01-06 21:01:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 21:01:14,245 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2021-01-06 21:01:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:14,248 INFO L225 Difference]: With dead ends: 1270 [2021-01-06 21:01:14,248 INFO L226 Difference]: Without dead ends: 1264 [2021-01-06 21:01:14,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2021-01-06 21:01:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2021-01-06 21:01:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 221. [2021-01-06 21:01:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2021-01-06 21:01:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 282 transitions. [2021-01-06 21:01:14,384 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 282 transitions. Word has length 70 [2021-01-06 21:01:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:14,384 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 282 transitions. [2021-01-06 21:01:14,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 21:01:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 282 transitions. [2021-01-06 21:01:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:01:14,385 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:14,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:01:14,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 21:01:14,385 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:14,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1662348756, now seen corresponding path program 1 times [2021-01-06 21:01:14,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:14,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129355954] [2021-01-06 21:01:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:15,831 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 21:01:15,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129355954] [2021-01-06 21:01:15,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:15,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-01-06 21:01:15,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771894032] [2021-01-06 21:01:15,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 21:01:15,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 21:01:15,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2021-01-06 21:01:15,833 INFO L87 Difference]: Start difference. First operand 221 states and 282 transitions. Second operand 23 states. [2021-01-06 21:01:16,400 WARN L197 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2021-01-06 21:01:16,826 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-01-06 21:01:17,035 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2021-01-06 21:01:17,229 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2021-01-06 21:01:17,474 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2021-01-06 21:01:17,715 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-01-06 21:01:18,178 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-01-06 21:01:18,613 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2021-01-06 21:01:19,159 WARN L197 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2021-01-06 21:01:19,491 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-01-06 21:01:19,828 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-01-06 21:01:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:25,110 INFO L93 Difference]: Finished difference Result 716 states and 964 transitions. [2021-01-06 21:01:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 21:01:25,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2021-01-06 21:01:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:25,113 INFO L225 Difference]: With dead ends: 716 [2021-01-06 21:01:25,113 INFO L226 Difference]: Without dead ends: 708 [2021-01-06 21:01:25,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2021-01-06 21:01:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2021-01-06 21:01:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 225. [2021-01-06 21:01:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-06 21:01:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 287 transitions. [2021-01-06 21:01:25,254 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 287 transitions. Word has length 70 [2021-01-06 21:01:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:25,254 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 287 transitions. [2021-01-06 21:01:25,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 21:01:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 287 transitions. [2021-01-06 21:01:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 21:01:25,254 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:25,255 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 21:01:25,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 21:01:25,255 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2112008133, now seen corresponding path program 1 times [2021-01-06 21:01:25,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:25,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670468247] [2021-01-06 21:01:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:25,585 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-01-06 21:01:25,721 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-01-06 21:01:26,915 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 21:01:26,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670468247] [2021-01-06 21:01:26,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:26,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-01-06 21:01:26,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944838365] [2021-01-06 21:01:26,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 21:01:26,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:26,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 21:01:26,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-01-06 21:01:26,917 INFO L87 Difference]: Start difference. First operand 225 states and 287 transitions. Second operand 20 states. [2021-01-06 21:01:27,111 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2021-01-06 21:01:27,451 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2021-01-06 21:01:27,642 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2021-01-06 21:01:27,970 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2021-01-06 21:01:28,227 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2021-01-06 21:01:28,541 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-01-06 21:01:28,925 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2021-01-06 21:01:29,223 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2021-01-06 21:01:29,534 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2021-01-06 21:01:31,295 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-01-06 21:01:32,608 WARN L197 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2021-01-06 21:01:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:38,566 INFO L93 Difference]: Finished difference Result 1084 states and 1520 transitions. [2021-01-06 21:01:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-06 21:01:38,569 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2021-01-06 21:01:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:38,571 INFO L225 Difference]: With dead ends: 1084 [2021-01-06 21:01:38,572 INFO L226 Difference]: Without dead ends: 1078 [2021-01-06 21:01:38,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=265, Invalid=1141, Unknown=0, NotChecked=0, Total=1406 [2021-01-06 21:01:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-01-06 21:01:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 230. [2021-01-06 21:01:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 21:01:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 293 transitions. [2021-01-06 21:01:38,739 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 293 transitions. Word has length 71 [2021-01-06 21:01:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:38,739 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 293 transitions. [2021-01-06 21:01:38,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 21:01:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 293 transitions. [2021-01-06 21:01:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 21:01:38,740 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:38,740 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 21:01:38,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 21:01:38,741 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1776801356, now seen corresponding path program 1 times [2021-01-06 21:01:38,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:38,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850798512] [2021-01-06 21:01:38,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:39,435 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-01-06 21:01:39,772 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-01-06 21:01:39,943 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-01-06 21:01:40,136 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-01-06 21:01:40,335 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-01-06 21:01:40,954 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 21:01:40,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850798512] [2021-01-06 21:01:40,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:40,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 21:01:40,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685410780] [2021-01-06 21:01:40,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 21:01:40,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:40,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 21:01:40,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-01-06 21:01:40,957 INFO L87 Difference]: Start difference. First operand 230 states and 293 transitions. Second operand 19 states. [2021-01-06 21:01:41,198 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2021-01-06 21:01:42,047 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2021-01-06 21:01:42,327 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2021-01-06 21:01:42,763 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2021-01-06 21:01:43,294 WARN L197 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2021-01-06 21:01:43,687 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-01-06 21:01:44,006 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-01-06 21:01:44,205 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-01-06 21:01:45,128 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2021-01-06 21:01:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:48,176 INFO L93 Difference]: Finished difference Result 574 states and 773 transitions. [2021-01-06 21:01:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 21:01:48,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2021-01-06 21:01:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:48,180 INFO L225 Difference]: With dead ends: 574 [2021-01-06 21:01:48,180 INFO L226 Difference]: Without dead ends: 566 [2021-01-06 21:01:48,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=260, Invalid=1072, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 21:01:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-01-06 21:01:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 220. [2021-01-06 21:01:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2021-01-06 21:01:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 281 transitions. [2021-01-06 21:01:48,310 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 281 transitions. Word has length 71 [2021-01-06 21:01:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:48,311 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 281 transitions. [2021-01-06 21:01:48,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 21:01:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 281 transitions. [2021-01-06 21:01:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 21:01:48,311 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:48,311 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 21:01:48,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 21:01:48,312 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:48,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1979298898, now seen corresponding path program 1 times [2021-01-06 21:01:48,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:48,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257389362] [2021-01-06 21:01:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:48,527 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2021-01-06 21:01:48,659 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-01-06 21:01:49,068 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 21:01:49,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257389362] [2021-01-06 21:01:49,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:49,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 21:01:49,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460002193] [2021-01-06 21:01:49,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 21:01:49,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:49,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 21:01:49,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-01-06 21:01:49,069 INFO L87 Difference]: Start difference. First operand 220 states and 281 transitions. Second operand 12 states. [2021-01-06 21:01:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:51,407 INFO L93 Difference]: Finished difference Result 777 states and 1096 transitions. [2021-01-06 21:01:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 21:01:51,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2021-01-06 21:01:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:51,410 INFO L225 Difference]: With dead ends: 777 [2021-01-06 21:01:51,411 INFO L226 Difference]: Without dead ends: 771 [2021-01-06 21:01:51,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-01-06 21:01:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2021-01-06 21:01:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 208. [2021-01-06 21:01:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-06 21:01:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 267 transitions. [2021-01-06 21:01:51,546 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 267 transitions. Word has length 71 [2021-01-06 21:01:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:51,547 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 267 transitions. [2021-01-06 21:01:51,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 21:01:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 267 transitions. [2021-01-06 21:01:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 21:01:51,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:51,548 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 21:01:51,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 21:01:51,548 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash 998415278, now seen corresponding path program 1 times [2021-01-06 21:01:51,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:51,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967163305] [2021-01-06 21:01:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:52,189 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 21:01:52,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967163305] [2021-01-06 21:01:52,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:52,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 21:01:52,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214137249] [2021-01-06 21:01:52,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 21:01:52,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 21:01:52,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-01-06 21:01:52,191 INFO L87 Difference]: Start difference. First operand 208 states and 267 transitions. Second operand 12 states. [2021-01-06 21:01:52,631 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2021-01-06 21:01:52,876 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2021-01-06 21:01:53,096 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2021-01-06 21:01:53,343 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2021-01-06 21:01:53,556 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2021-01-06 21:01:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:54,738 INFO L93 Difference]: Finished difference Result 583 states and 801 transitions. [2021-01-06 21:01:54,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:01:54,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2021-01-06 21:01:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:54,744 INFO L225 Difference]: With dead ends: 583 [2021-01-06 21:01:54,744 INFO L226 Difference]: Without dead ends: 568 [2021-01-06 21:01:54,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-01-06 21:01:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-01-06 21:01:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 187. [2021-01-06 21:01:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-01-06 21:01:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2021-01-06 21:01:54,898 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 71 [2021-01-06 21:01:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:54,899 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2021-01-06 21:01:54,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 21:01:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2021-01-06 21:01:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:01:54,900 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:54,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:01:54,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 21:01:54,900 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:54,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:54,901 INFO L82 PathProgramCache]: Analyzing trace with hash 161471129, now seen corresponding path program 1 times [2021-01-06 21:01:54,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:54,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132173296] [2021-01-06 21:01:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:54,980 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 21:01:54,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132173296] [2021-01-06 21:01:54,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:54,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:01:54,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446051689] [2021-01-06 21:01:54,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:01:54,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:01:54,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:01:54,983 INFO L87 Difference]: Start difference. First operand 187 states and 243 transitions. Second operand 3 states. [2021-01-06 21:01:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:55,472 INFO L93 Difference]: Finished difference Result 389 states and 539 transitions. [2021-01-06 21:01:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:01:55,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-01-06 21:01:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:55,477 INFO L225 Difference]: With dead ends: 389 [2021-01-06 21:01:55,477 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 21:01:55,478 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 21:01:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 21:01:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-01-06 21:01:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2021-01-06 21:01:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 380 transitions. [2021-01-06 21:01:55,794 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 380 transitions. Word has length 93 [2021-01-06 21:01:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:55,794 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 380 transitions. [2021-01-06 21:01:55,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:01:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 380 transitions. [2021-01-06 21:01:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:01:55,796 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:55,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:01:55,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 21:01:55,796 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash -880942767, now seen corresponding path program 1 times [2021-01-06 21:01:55,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:55,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683756935] [2021-01-06 21:01:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:55,901 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 21:01:55,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683756935] [2021-01-06 21:01:55,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:55,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:01:55,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876128954] [2021-01-06 21:01:55,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:01:55,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:01:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:01:55,904 INFO L87 Difference]: Start difference. First operand 282 states and 380 transitions. Second operand 5 states. [2021-01-06 21:01:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:57,254 INFO L93 Difference]: Finished difference Result 886 states and 1248 transitions. [2021-01-06 21:01:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:01:57,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2021-01-06 21:01:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:57,259 INFO L225 Difference]: With dead ends: 886 [2021-01-06 21:01:57,259 INFO L226 Difference]: Without dead ends: 686 [2021-01-06 21:01:57,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:01:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-01-06 21:01:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 332. [2021-01-06 21:01:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2021-01-06 21:01:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 446 transitions. [2021-01-06 21:01:57,599 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 446 transitions. Word has length 95 [2021-01-06 21:01:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:01:57,599 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 446 transitions. [2021-01-06 21:01:57,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:01:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 446 transitions. [2021-01-06 21:01:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:01:57,600 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:01:57,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:01:57,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 21:01:57,601 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:01:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:01:57,602 INFO L82 PathProgramCache]: Analyzing trace with hash 284809815, now seen corresponding path program 1 times [2021-01-06 21:01:57,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:01:57,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123259847] [2021-01-06 21:01:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:01:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:01:57,702 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 21:01:57,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123259847] [2021-01-06 21:01:57,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:01:57,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:01:57,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573162116] [2021-01-06 21:01:57,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:01:57,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:01:57,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:01:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:01:57,704 INFO L87 Difference]: Start difference. First operand 332 states and 446 transitions. Second operand 5 states. [2021-01-06 21:01:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:01:59,669 INFO L93 Difference]: Finished difference Result 1484 states and 2094 transitions. [2021-01-06 21:01:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:01:59,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2021-01-06 21:01:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:01:59,676 INFO L225 Difference]: With dead ends: 1484 [2021-01-06 21:01:59,676 INFO L226 Difference]: Without dead ends: 1234 [2021-01-06 21:01:59,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:01:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2021-01-06 21:02:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 596. [2021-01-06 21:02:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2021-01-06 21:02:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 820 transitions. [2021-01-06 21:02:00,231 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 820 transitions. Word has length 95 [2021-01-06 21:02:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:02:00,231 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 820 transitions. [2021-01-06 21:02:00,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:02:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 820 transitions. [2021-01-06 21:02:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:02:00,232 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:02:00,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:02:00,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 21:02:00,233 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:02:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:02:00,233 INFO L82 PathProgramCache]: Analyzing trace with hash -736748582, now seen corresponding path program 1 times [2021-01-06 21:02:00,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:02:00,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017291356] [2021-01-06 21:02:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:02:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:02:00,307 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 21:02:00,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017291356] [2021-01-06 21:02:00,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:02:00,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:02:00,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501949468] [2021-01-06 21:02:00,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:02:00,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:02:00,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:02:00,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:02:00,309 INFO L87 Difference]: Start difference. First operand 596 states and 820 transitions. Second operand 3 states. [2021-01-06 21:02:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:02:01,184 INFO L93 Difference]: Finished difference Result 1384 states and 1948 transitions. [2021-01-06 21:02:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:02:01,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 21:02:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:02:01,189 INFO L225 Difference]: With dead ends: 1384 [2021-01-06 21:02:01,189 INFO L226 Difference]: Without dead ends: 870 [2021-01-06 21:02:01,191 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 21:02:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2021-01-06 21:02:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2021-01-06 21:02:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2021-01-06 21:02:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1198 transitions. [2021-01-06 21:02:01,922 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1198 transitions. Word has length 95 [2021-01-06 21:02:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:02:01,922 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 1198 transitions. [2021-01-06 21:02:01,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:02:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1198 transitions. [2021-01-06 21:02:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:02:01,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:02:01,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:02:01,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 21:02:01,924 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:02:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:02:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1506041575, now seen corresponding path program 1 times [2021-01-06 21:02:01,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:02:01,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818230695] [2021-01-06 21:02:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:02:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:02:01,977 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 21:02:01,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818230695] [2021-01-06 21:02:01,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:02:01,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:02:01,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095032139] [2021-01-06 21:02:01,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:02:01,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:02:01,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:02:01,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:02:01,979 INFO L87 Difference]: Start difference. First operand 868 states and 1198 transitions. Second operand 3 states. [2021-01-06 21:02:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:02:03,170 INFO L93 Difference]: Finished difference Result 2064 states and 2869 transitions. [2021-01-06 21:02:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:02:03,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 21:02:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:02:03,174 INFO L225 Difference]: With dead ends: 2064 [2021-01-06 21:02:03,174 INFO L226 Difference]: Without dead ends: 1278 [2021-01-06 21:02:03,176 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 21:02:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2021-01-06 21:02:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1276. [2021-01-06 21:02:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2021-01-06 21:02:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1733 transitions. [2021-01-06 21:02:04,390 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1733 transitions. Word has length 95 [2021-01-06 21:02:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:02:04,391 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 1733 transitions. [2021-01-06 21:02:04,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:02:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1733 transitions. [2021-01-06 21:02:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:02:04,392 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:02:04,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:02:04,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 21:02:04,392 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:02:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:02:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1675387619, now seen corresponding path program 1 times [2021-01-06 21:02:04,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:02:04,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570066691] [2021-01-06 21:02:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:02:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:02:04,469 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 21:02:04,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570066691] [2021-01-06 21:02:04,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:02:04,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:02:04,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125793442] [2021-01-06 21:02:04,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:02:04,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:02:04,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:02:04,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:02:04,471 INFO L87 Difference]: Start difference. First operand 1276 states and 1733 transitions. Second operand 5 states. [2021-01-06 21:02:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:02:09,263 INFO L93 Difference]: Finished difference Result 5448 states and 7429 transitions. [2021-01-06 21:02:09,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:02:09,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2021-01-06 21:02:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:02:09,281 INFO L225 Difference]: With dead ends: 5448 [2021-01-06 21:02:09,281 INFO L226 Difference]: Without dead ends: 4254 [2021-01-06 21:02:09,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:02:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2021-01-06 21:02:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 2540. [2021-01-06 21:02:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2540 states. [2021-01-06 21:02:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3450 transitions. [2021-01-06 21:02:12,412 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3450 transitions. Word has length 95 [2021-01-06 21:02:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:02:12,412 INFO L481 AbstractCegarLoop]: Abstraction has 2540 states and 3450 transitions. [2021-01-06 21:02:12,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:02:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3450 transitions. [2021-01-06 21:02:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:02:12,414 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:02:12,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:02:12,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 21:02:12,415 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:02:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:02:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1554031907, now seen corresponding path program 1 times [2021-01-06 21:02:12,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:02:12,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569454158] [2021-01-06 21:02:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:02:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:02:12,532 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 21:02:12,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569454158] [2021-01-06 21:02:12,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:02:12,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:02:12,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910748005] [2021-01-06 21:02:12,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:02:12,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:02:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:02:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:02:12,536 INFO L87 Difference]: Start difference. First operand 2540 states and 3450 transitions. Second operand 5 states. [2021-01-06 21:02:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:02:21,452 INFO L93 Difference]: Finished difference Result 10564 states and 14386 transitions. [2021-01-06 21:02:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:02:21,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2021-01-06 21:02:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:02:21,470 INFO L225 Difference]: With dead ends: 10564 [2021-01-06 21:02:21,470 INFO L226 Difference]: Without dead ends: 8106 [2021-01-06 21:02:21,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:02:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8106 states. [2021-01-06 21:02:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8106 to 5140. [2021-01-06 21:02:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2021-01-06 21:02:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 6956 transitions. [2021-01-06 21:02:26,389 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 6956 transitions. Word has length 95 [2021-01-06 21:02:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:02:26,389 INFO L481 AbstractCegarLoop]: Abstraction has 5140 states and 6956 transitions. [2021-01-06 21:02:26,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:02:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 6956 transitions. [2021-01-06 21:02:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 21:02:26,391 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:02:26,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:02:26,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 21:02:26,391 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:02:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:02:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1423537109, now seen corresponding path program 1 times [2021-01-06 21:02:26,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:02:26,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938158142] [2021-01-06 21:02:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:02:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:02:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:02:26,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938158142] [2021-01-06 21:02:26,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:02:26,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:02:26,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789207444] [2021-01-06 21:02:26,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:02:26,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:02:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:02:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:02:26,463 INFO L87 Difference]: Start difference. First operand 5140 states and 6956 transitions. Second operand 3 states.