/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:53:31,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:53:31,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:53:31,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:53:31,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:53:31,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:53:31,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:53:31,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:53:31,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:53:31,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:53:31,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:53:31,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:53:31,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:53:31,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:53:31,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:53:31,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:53:31,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:53:31,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:53:31,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:53:31,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:53:31,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:53:31,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:53:31,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:53:31,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:53:31,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:53:31,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:53:31,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:53:31,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:53:31,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:53:31,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:53:31,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:53:31,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:53:31,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:53:31,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:53:31,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:53:31,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:53:31,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:53:31,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:53:31,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:53:31,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:53:31,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:53:31,301 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:53:31,357 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:53:31,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:53:31,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:53:31,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:53:31,360 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:53:31,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:53:31,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:53:31,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:53:31,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:53:31,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:53:31,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:53:31,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:53:31,363 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:53:31,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:53:31,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:53:31,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:53:31,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:53:31,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:53:31,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:53:31,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:53:31,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:53:31,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:53:31,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:53:31,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:53:31,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:53:31,366 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:53:31,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:53:31,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:53:31,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:53:31,809 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:53:31,810 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:53:31,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2021-01-06 20:53:31,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9452ea3c6/028445776b6f44928d7aa0f2d52f71c6/FLAG91ca699bc [2021-01-06 20:53:32,760 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:53:32,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2021-01-06 20:53:32,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9452ea3c6/028445776b6f44928d7aa0f2d52f71c6/FLAG91ca699bc [2021-01-06 20:53:33,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9452ea3c6/028445776b6f44928d7aa0f2d52f71c6 [2021-01-06 20:53:33,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:53:33,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:53:33,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:53:33,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:53:33,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:53:33,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:53:33" (1/1) ... [2021-01-06 20:53:33,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371127d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:33, skipping insertion in model container [2021-01-06 20:53:33,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:53:33" (1/1) ... [2021-01-06 20:53:33,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:53:33,124 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_95~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_413~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1146~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 20:53:33,413 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5415,5428] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_399~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_1035~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:53:33,473 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8088,8101] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_385~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_5~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~4,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__return_942~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:53:33,532 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[10895,10908] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~__return_371~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_7~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~6,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__return_848~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:53:33,583 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13470,13483] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~5,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~6,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_357~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_9~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~8,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~__return_766~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:53:33,631 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16476,16489] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_343~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_11~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~10,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_672~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:53:33,678 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19066,19079] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~9,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_329~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_13~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~12,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__return_593~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_14~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~13,] [2021-01-06 20:53:33,718 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[21826,21839] 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[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__return_315~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~14,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__return_513~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~15,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_1296~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] [2021-01-06 20:53:33,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:53:33,785 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_95~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_413~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1146~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 20:53:33,825 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5415,5428] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_399~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_1035~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:53:33,841 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8088,8101] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_385~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_5~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~4,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__return_942~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:53:33,876 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[10895,10908] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~__return_371~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_7~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~6,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__return_848~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:53:33,891 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13470,13483] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~5,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~6,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_357~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_9~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~8,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~__return_766~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:53:33,905 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16476,16489] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_343~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_11~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~10,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_672~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:53:33,917 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19066,19079] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~9,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_329~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_13~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~12,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__return_593~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_14~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~13,] [2021-01-06 20:53:33,931 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[21826,21839] 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[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__return_315~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~14,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__return_513~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~15,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_1296~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] [2021-01-06 20:53:33,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:53:34,000 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:53:34,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34 WrapperNode [2021-01-06 20:53:34,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:53:34,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:53:34,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:53:34,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:53:34,015 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:53:34" (1/1) ... [2021-01-06 20:53:34,056 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:53:34" (1/1) ... [2021-01-06 20:53:34,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:53:34,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:53:34,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:53:34,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:53:34,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (1/1) ... [2021-01-06 20:53:34,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (1/1) ... [2021-01-06 20:53:34,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (1/1) ... [2021-01-06 20:53:34,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (1/1) ... [2021-01-06 20:53:34,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (1/1) ... [2021-01-06 20:53:34,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (1/1) ... [2021-01-06 20:53:34,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (1/1) ... [2021-01-06 20:53:34,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:53:34,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:53:34,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:53:34,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:53:34,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (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:53:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:53:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:53:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:53:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:53:35,850 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:53:35,851 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:53:35,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:53:35 BoogieIcfgContainer [2021-01-06 20:53:35,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:53:35,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:53:35,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:53:35,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:53:35,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:53:33" (1/3) ... [2021-01-06 20:53:35,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcc17a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:53:35, skipping insertion in model container [2021-01-06 20:53:35,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:53:34" (2/3) ... [2021-01-06 20:53:35,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcc17a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:53:35, skipping insertion in model container [2021-01-06 20:53:35,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:53:35" (3/3) ... [2021-01-06 20:53:35,863 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2021-01-06 20:53:35,871 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:53:35,877 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2021-01-06 20:53:35,899 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-06 20:53:35,930 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:53:35,931 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:53:35,931 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:53:35,931 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:53:35,931 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:53:35,931 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:53:35,931 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:53:35,931 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:53:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2021-01-06 20:53:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 20:53:35,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:35,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:35,977 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -102713619, now seen corresponding path program 1 times [2021-01-06 20:53:35,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:35,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569623090] [2021-01-06 20:53:35,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:36,483 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:53:36,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569623090] [2021-01-06 20:53:36,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:36,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:53:36,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328226443] [2021-01-06 20:53:36,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:53:36,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:53:36,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:36,536 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 5 states. [2021-01-06 20:53:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:37,028 INFO L93 Difference]: Finished difference Result 375 states and 642 transitions. [2021-01-06 20:53:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:53:37,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2021-01-06 20:53:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:37,046 INFO L225 Difference]: With dead ends: 375 [2021-01-06 20:53:37,046 INFO L226 Difference]: Without dead ends: 231 [2021-01-06 20:53:37,050 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:53:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-06 20:53:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2021-01-06 20:53:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2021-01-06 20:53:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 288 transitions. [2021-01-06 20:53:37,128 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 288 transitions. Word has length 47 [2021-01-06 20:53:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:37,129 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 288 transitions. [2021-01-06 20:53:37,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:53:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 288 transitions. [2021-01-06 20:53:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 20:53:37,136 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:37,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:37,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:53:37,137 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1937910484, now seen corresponding path program 1 times [2021-01-06 20:53:37,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:37,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740691480] [2021-01-06 20:53:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:37,368 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:53:37,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740691480] [2021-01-06 20:53:37,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:37,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:53:37,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418937044] [2021-01-06 20:53:37,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:53:37,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:53:37,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:37,373 INFO L87 Difference]: Start difference. First operand 231 states and 288 transitions. Second operand 5 states. [2021-01-06 20:53:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:37,614 INFO L93 Difference]: Finished difference Result 299 states and 376 transitions. [2021-01-06 20:53:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:53:37,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2021-01-06 20:53:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:37,617 INFO L225 Difference]: With dead ends: 299 [2021-01-06 20:53:37,617 INFO L226 Difference]: Without dead ends: 177 [2021-01-06 20:53:37,619 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:53:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-01-06 20:53:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-01-06 20:53:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2021-01-06 20:53:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 219 transitions. [2021-01-06 20:53:37,636 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 219 transitions. Word has length 47 [2021-01-06 20:53:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:37,637 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 219 transitions. [2021-01-06 20:53:37,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:53:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2021-01-06 20:53:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 20:53:37,639 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:37,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:37,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:53:37,640 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:37,641 INFO L82 PathProgramCache]: Analyzing trace with hash 458596476, now seen corresponding path program 1 times [2021-01-06 20:53:37,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:37,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646553569] [2021-01-06 20:53:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:37,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:53:37,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646553569] [2021-01-06 20:53:37,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:37,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:53:37,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355663708] [2021-01-06 20:53:37,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:53:37,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:53:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:37,772 INFO L87 Difference]: Start difference. First operand 177 states and 219 transitions. Second operand 5 states. [2021-01-06 20:53:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:38,030 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2021-01-06 20:53:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:53:38,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2021-01-06 20:53:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:38,041 INFO L225 Difference]: With dead ends: 339 [2021-01-06 20:53:38,041 INFO L226 Difference]: Without dead ends: 239 [2021-01-06 20:53:38,044 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:53:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-06 20:53:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2021-01-06 20:53:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-06 20:53:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2021-01-06 20:53:38,094 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 47 [2021-01-06 20:53:38,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:38,095 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2021-01-06 20:53:38,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:53:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2021-01-06 20:53:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:53:38,096 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:38,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:38,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:53:38,097 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1498085814, now seen corresponding path program 1 times [2021-01-06 20:53:38,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:38,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64153904] [2021-01-06 20:53:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:53:38,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64153904] [2021-01-06 20:53:38,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:38,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:53:38,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423972723] [2021-01-06 20:53:38,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:53:38,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:38,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:53:38,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:53:38,356 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand 9 states. [2021-01-06 20:53:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:39,024 INFO L93 Difference]: Finished difference Result 530 states and 734 transitions. [2021-01-06 20:53:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:53:39,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2021-01-06 20:53:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:39,028 INFO L225 Difference]: With dead ends: 530 [2021-01-06 20:53:39,029 INFO L226 Difference]: Without dead ends: 525 [2021-01-06 20:53:39,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:53:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-01-06 20:53:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 215. [2021-01-06 20:53:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-06 20:53:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 280 transitions. [2021-01-06 20:53:39,054 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 280 transitions. Word has length 48 [2021-01-06 20:53:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:39,054 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 280 transitions. [2021-01-06 20:53:39,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:53:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 280 transitions. [2021-01-06 20:53:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:53:39,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:39,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:39,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:53:39,057 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash 267052195, now seen corresponding path program 1 times [2021-01-06 20:53:39,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:39,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614162464] [2021-01-06 20:53:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:39,195 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:53:39,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614162464] [2021-01-06 20:53:39,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:39,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:53:39,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11935212] [2021-01-06 20:53:39,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:53:39,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:39,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:53:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:53:39,198 INFO L87 Difference]: Start difference. First operand 215 states and 280 transitions. Second operand 9 states. [2021-01-06 20:53:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:40,022 INFO L93 Difference]: Finished difference Result 622 states and 869 transitions. [2021-01-06 20:53:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 20:53:40,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2021-01-06 20:53:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:40,027 INFO L225 Difference]: With dead ends: 622 [2021-01-06 20:53:40,027 INFO L226 Difference]: Without dead ends: 521 [2021-01-06 20:53:40,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2021-01-06 20:53:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-01-06 20:53:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 215. [2021-01-06 20:53:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-06 20:53:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2021-01-06 20:53:40,065 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 48 [2021-01-06 20:53:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:40,066 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2021-01-06 20:53:40,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:53:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2021-01-06 20:53:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:53:40,068 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:40,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:40,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:53:40,069 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1788008380, now seen corresponding path program 1 times [2021-01-06 20:53:40,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:40,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999204152] [2021-01-06 20:53:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:40,298 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:53:40,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999204152] [2021-01-06 20:53:40,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:40,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:53:40,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113306763] [2021-01-06 20:53:40,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 20:53:40,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:40,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 20:53:40,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:53:40,305 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand 8 states. [2021-01-06 20:53:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:40,733 INFO L93 Difference]: Finished difference Result 459 states and 614 transitions. [2021-01-06 20:53:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 20:53:40,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2021-01-06 20:53:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:40,737 INFO L225 Difference]: With dead ends: 459 [2021-01-06 20:53:40,738 INFO L226 Difference]: Without dead ends: 335 [2021-01-06 20:53:40,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:53:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-01-06 20:53:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2021-01-06 20:53:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-06 20:53:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2021-01-06 20:53:40,764 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 48 [2021-01-06 20:53:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:40,764 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2021-01-06 20:53:40,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 20:53:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2021-01-06 20:53:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:53:40,766 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:40,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:40,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:53:40,766 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:40,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:40,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1932349207, now seen corresponding path program 1 times [2021-01-06 20:53:40,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:40,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863532731] [2021-01-06 20:53:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:41,406 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:53:41,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863532731] [2021-01-06 20:53:41,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:41,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:53:41,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817106441] [2021-01-06 20:53:41,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:53:41,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:41,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:53:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:53:41,418 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand 19 states. [2021-01-06 20:53:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:43,566 INFO L93 Difference]: Finished difference Result 403 states and 529 transitions. [2021-01-06 20:53:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 20:53:43,567 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2021-01-06 20:53:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:43,569 INFO L225 Difference]: With dead ends: 403 [2021-01-06 20:53:43,570 INFO L226 Difference]: Without dead ends: 399 [2021-01-06 20:53:43,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 20:53:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-01-06 20:53:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 219. [2021-01-06 20:53:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-01-06 20:53:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2021-01-06 20:53:43,604 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 50 [2021-01-06 20:53:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:43,605 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2021-01-06 20:53:43,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:53:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2021-01-06 20:53:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:53:43,606 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:43,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:43,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:53:43,607 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:43,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:43,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1779763646, now seen corresponding path program 1 times [2021-01-06 20:53:43,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:43,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008826534] [2021-01-06 20:53:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:44,123 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:53:44,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008826534] [2021-01-06 20:53:44,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:44,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:53:44,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910731900] [2021-01-06 20:53:44,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:53:44,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:44,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:53:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:53:44,126 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand 19 states. [2021-01-06 20:53:44,331 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2021-01-06 20:53:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:46,318 INFO L93 Difference]: Finished difference Result 472 states and 643 transitions. [2021-01-06 20:53:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 20:53:46,319 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2021-01-06 20:53:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:46,321 INFO L225 Difference]: With dead ends: 472 [2021-01-06 20:53:46,321 INFO L226 Difference]: Without dead ends: 384 [2021-01-06 20:53:46,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 20:53:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-01-06 20:53:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 225. [2021-01-06 20:53:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-06 20:53:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2021-01-06 20:53:46,350 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 50 [2021-01-06 20:53:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:46,350 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2021-01-06 20:53:46,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:53:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2021-01-06 20:53:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:53:46,352 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:46,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:46,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:53:46,352 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:46,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1793833253, now seen corresponding path program 1 times [2021-01-06 20:53:46,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:46,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186103695] [2021-01-06 20:53:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:46,964 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:53:46,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186103695] [2021-01-06 20:53:46,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:46,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:53:46,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182850930] [2021-01-06 20:53:46,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:53:46,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:46,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:53:46,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:53:46,967 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 19 states. [2021-01-06 20:53:47,225 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2021-01-06 20:53:47,820 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-01-06 20:53:48,012 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-06 20:53:48,331 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-01-06 20:53:48,661 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2021-01-06 20:53:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:50,105 INFO L93 Difference]: Finished difference Result 503 states and 695 transitions. [2021-01-06 20:53:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-06 20:53:50,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2021-01-06 20:53:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:50,109 INFO L225 Difference]: With dead ends: 503 [2021-01-06 20:53:50,109 INFO L226 Difference]: Without dead ends: 497 [2021-01-06 20:53:50,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=306, Invalid=1026, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 20:53:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-01-06 20:53:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 225. [2021-01-06 20:53:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-06 20:53:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 291 transitions. [2021-01-06 20:53:50,139 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 291 transitions. Word has length 50 [2021-01-06 20:53:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:50,139 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 291 transitions. [2021-01-06 20:53:50,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:53:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 291 transitions. [2021-01-06 20:53:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:53:50,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:50,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:50,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:53:50,141 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1827600366, now seen corresponding path program 1 times [2021-01-06 20:53:50,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:50,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600170246] [2021-01-06 20:53:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:50,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 20:53:50,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600170246] [2021-01-06 20:53:50,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:50,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 20:53:50,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229460777] [2021-01-06 20:53:50,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 20:53:50,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 20:53:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-06 20:53:50,471 INFO L87 Difference]: Start difference. First operand 225 states and 291 transitions. Second operand 12 states. [2021-01-06 20:53:50,866 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2021-01-06 20:53:50,989 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2021-01-06 20:53:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:51,412 INFO L93 Difference]: Finished difference Result 444 states and 618 transitions. [2021-01-06 20:53:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:53:51,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2021-01-06 20:53:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:51,416 INFO L225 Difference]: With dead ends: 444 [2021-01-06 20:53:51,416 INFO L226 Difference]: Without dead ends: 349 [2021-01-06 20:53:51,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:53:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-01-06 20:53:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2021-01-06 20:53:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2021-01-06 20:53:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2021-01-06 20:53:51,454 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 50 [2021-01-06 20:53:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:51,454 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2021-01-06 20:53:51,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 20:53:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2021-01-06 20:53:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:53:51,455 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:51,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:51,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:53:51,456 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash -767196360, now seen corresponding path program 1 times [2021-01-06 20:53:51,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:51,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241668388] [2021-01-06 20:53:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:51,643 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:53:51,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241668388] [2021-01-06 20:53:51,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:51,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:53:51,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955762218] [2021-01-06 20:53:51,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:53:51,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:51,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:53:51,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:53:51,648 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand 9 states. [2021-01-06 20:53:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:52,144 INFO L93 Difference]: Finished difference Result 349 states and 461 transitions. [2021-01-06 20:53:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 20:53:52,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2021-01-06 20:53:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:52,147 INFO L225 Difference]: With dead ends: 349 [2021-01-06 20:53:52,147 INFO L226 Difference]: Without dead ends: 342 [2021-01-06 20:53:52,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:53:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-01-06 20:53:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 214. [2021-01-06 20:53:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2021-01-06 20:53:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 277 transitions. [2021-01-06 20:53:52,177 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 277 transitions. Word has length 51 [2021-01-06 20:53:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:52,178 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 277 transitions. [2021-01-06 20:53:52,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:53:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 277 transitions. [2021-01-06 20:53:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:53:52,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:52,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:52,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:53:52,179 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1195663953, now seen corresponding path program 1 times [2021-01-06 20:53:52,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:52,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415282913] [2021-01-06 20:53:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:52,327 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:53:52,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415282913] [2021-01-06 20:53:52,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:52,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 20:53:52,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483924974] [2021-01-06 20:53:52,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:53:52,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:52,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:53:52,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:53:52,330 INFO L87 Difference]: Start difference. First operand 214 states and 277 transitions. Second operand 10 states. [2021-01-06 20:53:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:53,425 INFO L93 Difference]: Finished difference Result 553 states and 764 transitions. [2021-01-06 20:53:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 20:53:53,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2021-01-06 20:53:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:53,427 INFO L225 Difference]: With dead ends: 553 [2021-01-06 20:53:53,428 INFO L226 Difference]: Without dead ends: 451 [2021-01-06 20:53:53,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2021-01-06 20:53:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-01-06 20:53:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 214. [2021-01-06 20:53:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2021-01-06 20:53:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 276 transitions. [2021-01-06 20:53:53,458 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 276 transitions. Word has length 51 [2021-01-06 20:53:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:53,459 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 276 transitions. [2021-01-06 20:53:53,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:53:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 276 transitions. [2021-01-06 20:53:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:53:53,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:53,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:53,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:53:53,460 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 72941877, now seen corresponding path program 1 times [2021-01-06 20:53:53,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:53,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014070945] [2021-01-06 20:53:53,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:54,114 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:53:54,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014070945] [2021-01-06 20:53:54,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:54,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:53:54,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732723594] [2021-01-06 20:53:54,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:53:54,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:53:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:53:54,117 INFO L87 Difference]: Start difference. First operand 214 states and 276 transitions. Second operand 16 states. [2021-01-06 20:53:54,659 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-01-06 20:53:54,874 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2021-01-06 20:53:55,067 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-06 20:53:55,225 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-06 20:53:55,431 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-01-06 20:53:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:56,600 INFO L93 Difference]: Finished difference Result 605 states and 837 transitions. [2021-01-06 20:53:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 20:53:56,601 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2021-01-06 20:53:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:56,604 INFO L225 Difference]: With dead ends: 605 [2021-01-06 20:53:56,604 INFO L226 Difference]: Without dead ends: 589 [2021-01-06 20:53:56,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2021-01-06 20:53:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-01-06 20:53:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 206. [2021-01-06 20:53:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-06 20:53:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 266 transitions. [2021-01-06 20:53:56,640 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 266 transitions. Word has length 51 [2021-01-06 20:53:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:56,641 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 266 transitions. [2021-01-06 20:53:56,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:53:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 266 transitions. [2021-01-06 20:53:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:53:56,642 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:56,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:56,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:53:56,642 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:56,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash -314877430, now seen corresponding path program 1 times [2021-01-06 20:53:56,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:56,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084088347] [2021-01-06 20:53:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:56,825 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:53:56,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084088347] [2021-01-06 20:53:56,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:56,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:53:56,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130766174] [2021-01-06 20:53:56,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:53:56,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:53:56,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:53:56,828 INFO L87 Difference]: Start difference. First operand 206 states and 266 transitions. Second operand 11 states. [2021-01-06 20:53:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:59,503 INFO L93 Difference]: Finished difference Result 1132 states and 1598 transitions. [2021-01-06 20:53:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 20:53:59,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2021-01-06 20:53:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:59,509 INFO L225 Difference]: With dead ends: 1132 [2021-01-06 20:53:59,509 INFO L226 Difference]: Without dead ends: 1125 [2021-01-06 20:53:59,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=374, Invalid=1186, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 20:53:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2021-01-06 20:53:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 206. [2021-01-06 20:53:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-06 20:53:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 265 transitions. [2021-01-06 20:53:59,558 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 265 transitions. Word has length 51 [2021-01-06 20:53:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:59,559 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 265 transitions. [2021-01-06 20:53:59,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:53:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 265 transitions. [2021-01-06 20:53:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:53:59,560 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:59,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:59,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:53:59,560 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:59,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1266894549, now seen corresponding path program 1 times [2021-01-06 20:53:59,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:59,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613384245] [2021-01-06 20:53:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:00,113 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:54:00,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613384245] [2021-01-06 20:54:00,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:00,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:54:00,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541160591] [2021-01-06 20:54:00,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:54:00,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:54:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:54:00,116 INFO L87 Difference]: Start difference. First operand 206 states and 265 transitions. Second operand 16 states. [2021-01-06 20:54:01,066 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2021-01-06 20:54:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:01,575 INFO L93 Difference]: Finished difference Result 306 states and 407 transitions. [2021-01-06 20:54:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 20:54:01,575 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2021-01-06 20:54:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:01,577 INFO L225 Difference]: With dead ends: 306 [2021-01-06 20:54:01,577 INFO L226 Difference]: Without dead ends: 218 [2021-01-06 20:54:01,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-01-06 20:54:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-01-06 20:54:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2021-01-06 20:54:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2021-01-06 20:54:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 257 transitions. [2021-01-06 20:54:01,633 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 257 transitions. Word has length 51 [2021-01-06 20:54:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:01,633 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 257 transitions. [2021-01-06 20:54:01,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:54:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 257 transitions. [2021-01-06 20:54:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:54:01,634 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:01,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:01,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:54:01,635 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash -611388429, now seen corresponding path program 1 times [2021-01-06 20:54:01,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:01,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201120806] [2021-01-06 20:54:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:01,757 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:54:01,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201120806] [2021-01-06 20:54:01,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:01,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:54:01,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799046359] [2021-01-06 20:54:01,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:54:01,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:01,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:54:01,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:54:01,759 INFO L87 Difference]: Start difference. First operand 200 states and 257 transitions. Second operand 9 states. [2021-01-06 20:54:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:02,294 INFO L93 Difference]: Finished difference Result 349 states and 474 transitions. [2021-01-06 20:54:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:54:02,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2021-01-06 20:54:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:02,297 INFO L225 Difference]: With dead ends: 349 [2021-01-06 20:54:02,297 INFO L226 Difference]: Without dead ends: 247 [2021-01-06 20:54:02,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:54:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-01-06 20:54:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 200. [2021-01-06 20:54:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2021-01-06 20:54:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 256 transitions. [2021-01-06 20:54:02,339 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 256 transitions. Word has length 52 [2021-01-06 20:54:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:02,340 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 256 transitions. [2021-01-06 20:54:02,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:54:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 256 transitions. [2021-01-06 20:54:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:54:02,341 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:02,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:02,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:54:02,342 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash 966049747, now seen corresponding path program 1 times [2021-01-06 20:54:02,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:02,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151306975] [2021-01-06 20:54:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:02,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 20:54:02,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151306975] [2021-01-06 20:54:02,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:02,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:54:02,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169815092] [2021-01-06 20:54:02,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:54:02,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:54:02,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:54:02,471 INFO L87 Difference]: Start difference. First operand 200 states and 256 transitions. Second operand 9 states. [2021-01-06 20:54:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:03,040 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2021-01-06 20:54:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:54:03,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2021-01-06 20:54:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:03,042 INFO L225 Difference]: With dead ends: 337 [2021-01-06 20:54:03,042 INFO L226 Difference]: Without dead ends: 330 [2021-01-06 20:54:03,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:54:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-01-06 20:54:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 196. [2021-01-06 20:54:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2021-01-06 20:54:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 251 transitions. [2021-01-06 20:54:03,080 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 251 transitions. Word has length 52 [2021-01-06 20:54:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:03,081 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 251 transitions. [2021-01-06 20:54:03,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:54:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 251 transitions. [2021-01-06 20:54:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:54:03,082 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:03,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:03,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:54:03,082 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1837589620, now seen corresponding path program 1 times [2021-01-06 20:54:03,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:03,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834606279] [2021-01-06 20:54:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:03,563 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:54:03,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834606279] [2021-01-06 20:54:03,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:03,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:54:03,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230918537] [2021-01-06 20:54:03,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:54:03,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:54:03,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:54:03,566 INFO L87 Difference]: Start difference. First operand 196 states and 251 transitions. Second operand 18 states. [2021-01-06 20:54:03,741 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-01-06 20:54:04,346 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-01-06 20:54:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:05,767 INFO L93 Difference]: Finished difference Result 412 states and 556 transitions. [2021-01-06 20:54:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:54:05,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2021-01-06 20:54:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:05,770 INFO L225 Difference]: With dead ends: 412 [2021-01-06 20:54:05,771 INFO L226 Difference]: Without dead ends: 406 [2021-01-06 20:54:05,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 20:54:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-01-06 20:54:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 202. [2021-01-06 20:54:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2021-01-06 20:54:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2021-01-06 20:54:05,819 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 53 [2021-01-06 20:54:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:05,820 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2021-01-06 20:54:05,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:54:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2021-01-06 20:54:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:54:05,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:05,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:05,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 20:54:05,821 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash 916052531, now seen corresponding path program 1 times [2021-01-06 20:54:05,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:05,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605581374] [2021-01-06 20:54:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:06,148 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:54:06,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605581374] [2021-01-06 20:54:06,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:06,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:54:06,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817946596] [2021-01-06 20:54:06,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:54:06,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:54:06,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:54:06,151 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand 16 states. [2021-01-06 20:54:06,288 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2021-01-06 20:54:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:07,667 INFO L93 Difference]: Finished difference Result 232 states and 287 transitions. [2021-01-06 20:54:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 20:54:07,671 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2021-01-06 20:54:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:07,672 INFO L225 Difference]: With dead ends: 232 [2021-01-06 20:54:07,672 INFO L226 Difference]: Without dead ends: 224 [2021-01-06 20:54:07,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2021-01-06 20:54:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-01-06 20:54:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2021-01-06 20:54:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2021-01-06 20:54:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 258 transitions. [2021-01-06 20:54:07,709 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 258 transitions. Word has length 53 [2021-01-06 20:54:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:07,710 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 258 transitions. [2021-01-06 20:54:07,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:54:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 258 transitions. [2021-01-06 20:54:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:54:07,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:07,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:07,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 20:54:07,711 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:07,711 INFO L82 PathProgramCache]: Analyzing trace with hash 202849221, now seen corresponding path program 1 times [2021-01-06 20:54:07,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:07,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579128653] [2021-01-06 20:54:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:08,212 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:54:08,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579128653] [2021-01-06 20:54:08,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:08,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:54:08,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173931321] [2021-01-06 20:54:08,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:54:08,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:08,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:54:08,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:54:08,215 INFO L87 Difference]: Start difference. First operand 202 states and 258 transitions. Second operand 18 states. [2021-01-06 20:54:08,390 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2021-01-06 20:54:08,924 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2021-01-06 20:54:09,455 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2021-01-06 20:54:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:10,106 INFO L93 Difference]: Finished difference Result 232 states and 286 transitions. [2021-01-06 20:54:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 20:54:10,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2021-01-06 20:54:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:10,108 INFO L225 Difference]: With dead ends: 232 [2021-01-06 20:54:10,108 INFO L226 Difference]: Without dead ends: 224 [2021-01-06 20:54:10,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2021-01-06 20:54:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-01-06 20:54:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2021-01-06 20:54:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2021-01-06 20:54:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 263 transitions. [2021-01-06 20:54:10,153 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 263 transitions. Word has length 53 [2021-01-06 20:54:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:10,153 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 263 transitions. [2021-01-06 20:54:10,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:54:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 263 transitions. [2021-01-06 20:54:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:54:10,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:10,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:10,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 20:54:10,155 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash 576756188, now seen corresponding path program 1 times [2021-01-06 20:54:10,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:10,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481708052] [2021-01-06 20:54:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:10,872 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:54:10,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481708052] [2021-01-06 20:54:10,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:10,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:54:10,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413835731] [2021-01-06 20:54:10,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:54:10,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:10,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:54:10,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:54:10,877 INFO L87 Difference]: Start difference. First operand 207 states and 263 transitions. Second operand 18 states. [2021-01-06 20:54:11,227 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2021-01-06 20:54:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:12,700 INFO L93 Difference]: Finished difference Result 693 states and 969 transitions. [2021-01-06 20:54:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 20:54:12,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2021-01-06 20:54:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:12,704 INFO L225 Difference]: With dead ends: 693 [2021-01-06 20:54:12,704 INFO L226 Difference]: Without dead ends: 687 [2021-01-06 20:54:12,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2021-01-06 20:54:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-01-06 20:54:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 201. [2021-01-06 20:54:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2021-01-06 20:54:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 254 transitions. [2021-01-06 20:54:12,758 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 254 transitions. Word has length 54 [2021-01-06 20:54:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:12,758 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 254 transitions. [2021-01-06 20:54:12,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:54:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 254 transitions. [2021-01-06 20:54:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:54:12,759 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:12,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:12,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 20:54:12,760 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash -787967428, now seen corresponding path program 1 times [2021-01-06 20:54:12,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:12,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580648842] [2021-01-06 20:54:12,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:13,423 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:54:13,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580648842] [2021-01-06 20:54:13,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:13,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 20:54:13,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041842989] [2021-01-06 20:54:13,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 20:54:13,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 20:54:13,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:54:13,425 INFO L87 Difference]: Start difference. First operand 201 states and 254 transitions. Second operand 14 states. [2021-01-06 20:54:13,983 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2021-01-06 20:54:14,147 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2021-01-06 20:54:14,320 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2021-01-06 20:54:14,485 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2021-01-06 20:54:14,871 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-01-06 20:54:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:15,432 INFO L93 Difference]: Finished difference Result 494 states and 682 transitions. [2021-01-06 20:54:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 20:54:15,436 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2021-01-06 20:54:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:15,438 INFO L225 Difference]: With dead ends: 494 [2021-01-06 20:54:15,438 INFO L226 Difference]: Without dead ends: 482 [2021-01-06 20:54:15,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2021-01-06 20:54:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-01-06 20:54:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 189. [2021-01-06 20:54:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2021-01-06 20:54:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 242 transitions. [2021-01-06 20:54:15,479 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 242 transitions. Word has length 54 [2021-01-06 20:54:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:15,480 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 242 transitions. [2021-01-06 20:54:15,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 20:54:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 242 transitions. [2021-01-06 20:54:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:54:15,481 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:15,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:15,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 20:54:15,481 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1046826158, now seen corresponding path program 1 times [2021-01-06 20:54:15,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:15,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424315032] [2021-01-06 20:54:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:15,875 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:54:15,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424315032] [2021-01-06 20:54:15,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:15,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 20:54:15,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430081770] [2021-01-06 20:54:15,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 20:54:15,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:15,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 20:54:15,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-01-06 20:54:15,877 INFO L87 Difference]: Start difference. First operand 189 states and 242 transitions. Second operand 13 states. [2021-01-06 20:54:16,214 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2021-01-06 20:54:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:17,523 INFO L93 Difference]: Finished difference Result 676 states and 948 transitions. [2021-01-06 20:54:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:54:17,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2021-01-06 20:54:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:17,527 INFO L225 Difference]: With dead ends: 676 [2021-01-06 20:54:17,527 INFO L226 Difference]: Without dead ends: 670 [2021-01-06 20:54:17,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:54:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-01-06 20:54:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 195. [2021-01-06 20:54:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-01-06 20:54:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 250 transitions. [2021-01-06 20:54:17,577 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 250 transitions. Word has length 54 [2021-01-06 20:54:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:17,577 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 250 transitions. [2021-01-06 20:54:17,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 20:54:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 250 transitions. [2021-01-06 20:54:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:54:17,578 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:17,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:17,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 20:54:17,578 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash -534929533, now seen corresponding path program 1 times [2021-01-06 20:54:17,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:17,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119925117] [2021-01-06 20:54:17,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:17,874 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:54:17,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119925117] [2021-01-06 20:54:17,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:17,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 20:54:17,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413810648] [2021-01-06 20:54:17,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:54:17,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:54:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:54:17,877 INFO L87 Difference]: Start difference. First operand 195 states and 250 transitions. Second operand 11 states. [2021-01-06 20:54:18,267 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-01-06 20:54:18,393 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-01-06 20:54:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:19,152 INFO L93 Difference]: Finished difference Result 547 states and 778 transitions. [2021-01-06 20:54:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 20:54:19,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2021-01-06 20:54:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:19,155 INFO L225 Difference]: With dead ends: 547 [2021-01-06 20:54:19,155 INFO L226 Difference]: Without dead ends: 524 [2021-01-06 20:54:19,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2021-01-06 20:54:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-01-06 20:54:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 172. [2021-01-06 20:54:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2021-01-06 20:54:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 225 transitions. [2021-01-06 20:54:19,205 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 225 transitions. Word has length 54 [2021-01-06 20:54:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:19,206 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 225 transitions. [2021-01-06 20:54:19,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:54:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 225 transitions. [2021-01-06 20:54:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 20:54:19,207 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:19,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:19,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 20:54:19,207 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash -200667910, now seen corresponding path program 1 times [2021-01-06 20:54:19,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:19,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879190641] [2021-01-06 20:54:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:19,505 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:54:19,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879190641] [2021-01-06 20:54:19,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:19,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 20:54:19,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437256442] [2021-01-06 20:54:19,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:54:19,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:54:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:54:19,507 INFO L87 Difference]: Start difference. First operand 172 states and 225 transitions. Second operand 11 states. [2021-01-06 20:54:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:20,202 INFO L93 Difference]: Finished difference Result 472 states and 659 transitions. [2021-01-06 20:54:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:54:20,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2021-01-06 20:54:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:20,204 INFO L225 Difference]: With dead ends: 472 [2021-01-06 20:54:20,204 INFO L226 Difference]: Without dead ends: 466 [2021-01-06 20:54:20,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-01-06 20:54:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-01-06 20:54:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 160. [2021-01-06 20:54:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2021-01-06 20:54:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2021-01-06 20:54:20,242 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 55 [2021-01-06 20:54:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:20,242 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2021-01-06 20:54:20,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:54:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2021-01-06 20:54:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 20:54:20,243 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:20,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:20,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 20:54:20,244 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:20,244 INFO L82 PathProgramCache]: Analyzing trace with hash 415256315, now seen corresponding path program 1 times [2021-01-06 20:54:20,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:20,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532404075] [2021-01-06 20:54:20,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:20,291 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:54:20,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532404075] [2021-01-06 20:54:20,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:20,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:54:20,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518186277] [2021-01-06 20:54:20,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:54:20,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:54:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:20,293 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand 3 states. [2021-01-06 20:54:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:20,395 INFO L93 Difference]: Finished difference Result 320 states and 451 transitions. [2021-01-06 20:54:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:54:20,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2021-01-06 20:54:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:20,396 INFO L225 Difference]: With dead ends: 320 [2021-01-06 20:54:20,396 INFO L226 Difference]: Without dead ends: 236 [2021-01-06 20:54:20,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-01-06 20:54:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2021-01-06 20:54:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 20:54:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 320 transitions. [2021-01-06 20:54:20,460 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 320 transitions. Word has length 71 [2021-01-06 20:54:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:20,460 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 320 transitions. [2021-01-06 20:54:20,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:54:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 320 transitions. [2021-01-06 20:54:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:54:20,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:20,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:20,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 20:54:20,462 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash -237734748, now seen corresponding path program 1 times [2021-01-06 20:54:20,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:20,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268275072] [2021-01-06 20:54:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:20,536 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:54:20,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268275072] [2021-01-06 20:54:20,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:20,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:54:20,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312614748] [2021-01-06 20:54:20,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:54:20,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:54:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:20,538 INFO L87 Difference]: Start difference. First operand 234 states and 320 transitions. Second operand 5 states. [2021-01-06 20:54:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:20,875 INFO L93 Difference]: Finished difference Result 744 states and 1084 transitions. [2021-01-06 20:54:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:54:20,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2021-01-06 20:54:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:20,879 INFO L225 Difference]: With dead ends: 744 [2021-01-06 20:54:20,879 INFO L226 Difference]: Without dead ends: 586 [2021-01-06 20:54:20,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-01-06 20:54:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 316. [2021-01-06 20:54:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2021-01-06 20:54:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 445 transitions. [2021-01-06 20:54:20,970 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 445 transitions. Word has length 73 [2021-01-06 20:54:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:20,970 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 445 transitions. [2021-01-06 20:54:20,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:54:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 445 transitions. [2021-01-06 20:54:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:54:20,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:20,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:20,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 20:54:20,972 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -871401261, now seen corresponding path program 1 times [2021-01-06 20:54:20,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:20,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104149022] [2021-01-06 20:54:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:21,023 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:54:21,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104149022] [2021-01-06 20:54:21,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:21,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:54:21,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618747592] [2021-01-06 20:54:21,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:54:21,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:21,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:54:21,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:21,026 INFO L87 Difference]: Start difference. First operand 316 states and 445 transitions. Second operand 3 states. [2021-01-06 20:54:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:21,339 INFO L93 Difference]: Finished difference Result 722 states and 1058 transitions. [2021-01-06 20:54:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:54:21,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 20:54:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:21,344 INFO L225 Difference]: With dead ends: 722 [2021-01-06 20:54:21,344 INFO L226 Difference]: Without dead ends: 482 [2021-01-06 20:54:21,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-01-06 20:54:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 480. [2021-01-06 20:54:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2021-01-06 20:54:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 687 transitions. [2021-01-06 20:54:21,667 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 687 transitions. Word has length 73 [2021-01-06 20:54:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:21,668 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 687 transitions. [2021-01-06 20:54:21,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:54:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 687 transitions. [2021-01-06 20:54:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:54:21,669 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:21,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:21,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 20:54:21,670 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:21,670 INFO L82 PathProgramCache]: Analyzing trace with hash -937894773, now seen corresponding path program 1 times [2021-01-06 20:54:21,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:21,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705504078] [2021-01-06 20:54:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:21,730 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:54:21,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705504078] [2021-01-06 20:54:21,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:21,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:54:21,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463456378] [2021-01-06 20:54:21,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:54:21,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:54:21,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:21,732 INFO L87 Difference]: Start difference. First operand 480 states and 687 transitions. Second operand 3 states. [2021-01-06 20:54:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:22,211 INFO L93 Difference]: Finished difference Result 1228 states and 1793 transitions. [2021-01-06 20:54:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:54:22,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 20:54:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:22,216 INFO L225 Difference]: With dead ends: 1228 [2021-01-06 20:54:22,216 INFO L226 Difference]: Without dead ends: 824 [2021-01-06 20:54:22,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-01-06 20:54:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 812. [2021-01-06 20:54:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2021-01-06 20:54:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1156 transitions. [2021-01-06 20:54:22,521 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1156 transitions. Word has length 73 [2021-01-06 20:54:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:22,522 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 1156 transitions. [2021-01-06 20:54:22,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:54:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1156 transitions. [2021-01-06 20:54:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:54:22,523 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:22,523 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:22,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 20:54:22,524 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash -852412764, now seen corresponding path program 1 times [2021-01-06 20:54:22,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:22,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029891142] [2021-01-06 20:54:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:22,596 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:54:22,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029891142] [2021-01-06 20:54:22,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:22,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:54:22,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206132408] [2021-01-06 20:54:22,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:54:22,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:54:22,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:22,598 INFO L87 Difference]: Start difference. First operand 812 states and 1156 transitions. Second operand 5 states. [2021-01-06 20:54:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:23,290 INFO L93 Difference]: Finished difference Result 2152 states and 3102 transitions. [2021-01-06 20:54:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:54:23,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2021-01-06 20:54:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:23,296 INFO L225 Difference]: With dead ends: 2152 [2021-01-06 20:54:23,297 INFO L226 Difference]: Without dead ends: 1714 [2021-01-06 20:54:23,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2021-01-06 20:54:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1260. [2021-01-06 20:54:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2021-01-06 20:54:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1806 transitions. [2021-01-06 20:54:23,800 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1806 transitions. Word has length 73 [2021-01-06 20:54:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:23,800 INFO L481 AbstractCegarLoop]: Abstraction has 1260 states and 1806 transitions. [2021-01-06 20:54:23,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:54:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1806 transitions. [2021-01-06 20:54:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:54:23,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:23,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:23,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 20:54:23,802 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:23,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:23,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1459706699, now seen corresponding path program 1 times [2021-01-06 20:54:23,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:23,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441601945] [2021-01-06 20:54:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:23,841 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:54:23,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441601945] [2021-01-06 20:54:23,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:23,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:54:23,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236894119] [2021-01-06 20:54:23,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:54:23,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:54:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:23,843 INFO L87 Difference]: Start difference. First operand 1260 states and 1806 transitions. Second operand 3 states. [2021-01-06 20:54:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:24,640 INFO L93 Difference]: Finished difference Result 2848 states and 4117 transitions. [2021-01-06 20:54:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:54:24,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 20:54:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:24,646 INFO L225 Difference]: With dead ends: 2848 [2021-01-06 20:54:24,646 INFO L226 Difference]: Without dead ends: 1664 [2021-01-06 20:54:24,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2021-01-06 20:54:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1644. [2021-01-06 20:54:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2021-01-06 20:54:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2345 transitions. [2021-01-06 20:54:25,218 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2345 transitions. Word has length 74 [2021-01-06 20:54:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:25,219 INFO L481 AbstractCegarLoop]: Abstraction has 1644 states and 2345 transitions. [2021-01-06 20:54:25,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:54:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2345 transitions. [2021-01-06 20:54:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:54:25,220 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:25,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:25,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 20:54:25,221 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1468955342, now seen corresponding path program 1 times [2021-01-06 20:54:25,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:25,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643319075] [2021-01-06 20:54:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:25,299 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:54:25,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643319075] [2021-01-06 20:54:25,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:25,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:54:25,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098959233] [2021-01-06 20:54:25,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:54:25,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:25,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:54:25,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:25,302 INFO L87 Difference]: Start difference. First operand 1644 states and 2345 transitions. Second operand 5 states. [2021-01-06 20:54:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:26,394 INFO L93 Difference]: Finished difference Result 3268 states and 4693 transitions. [2021-01-06 20:54:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:54:26,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2021-01-06 20:54:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:26,403 INFO L225 Difference]: With dead ends: 3268 [2021-01-06 20:54:26,403 INFO L226 Difference]: Without dead ends: 2676 [2021-01-06 20:54:26,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2021-01-06 20:54:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2034. [2021-01-06 20:54:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2021-01-06 20:54:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2907 transitions. [2021-01-06 20:54:27,140 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2907 transitions. Word has length 74 [2021-01-06 20:54:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:27,140 INFO L481 AbstractCegarLoop]: Abstraction has 2034 states and 2907 transitions. [2021-01-06 20:54:27,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:54:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2907 transitions. [2021-01-06 20:54:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:54:27,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:27,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:27,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 20:54:27,142 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1631844587, now seen corresponding path program 1 times [2021-01-06 20:54:27,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:27,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458819012] [2021-01-06 20:54:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:27,200 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:54:27,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458819012] [2021-01-06 20:54:27,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:27,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:54:27,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980429996] [2021-01-06 20:54:27,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:54:27,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:27,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:54:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:27,203 INFO L87 Difference]: Start difference. First operand 2034 states and 2907 transitions. Second operand 3 states. [2021-01-06 20:54:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:28,944 INFO L93 Difference]: Finished difference Result 5710 states and 8135 transitions. [2021-01-06 20:54:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:54:28,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 20:54:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:28,965 INFO L225 Difference]: With dead ends: 5710 [2021-01-06 20:54:28,966 INFO L226 Difference]: Without dead ends: 3752 [2021-01-06 20:54:28,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2021-01-06 20:54:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3510. [2021-01-06 20:54:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3510 states. [2021-01-06 20:54:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 4950 transitions. [2021-01-06 20:54:30,266 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 4950 transitions. Word has length 74 [2021-01-06 20:54:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:30,267 INFO L481 AbstractCegarLoop]: Abstraction has 3510 states and 4950 transitions. [2021-01-06 20:54:30,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:54:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 4950 transitions. [2021-01-06 20:54:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 20:54:30,268 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:30,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:30,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 20:54:30,269 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash -536068422, now seen corresponding path program 1 times [2021-01-06 20:54:30,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:30,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907835181] [2021-01-06 20:54:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:30,340 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:54:30,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907835181] [2021-01-06 20:54:30,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:30,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:54:30,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792657352] [2021-01-06 20:54:30,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:54:30,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:30,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:54:30,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:30,343 INFO L87 Difference]: Start difference. First operand 3510 states and 4950 transitions. Second operand 3 states. [2021-01-06 20:54:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:32,881 INFO L93 Difference]: Finished difference Result 9898 states and 13844 transitions. [2021-01-06 20:54:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:54:32,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 20:54:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:32,911 INFO L225 Difference]: With dead ends: 9898 [2021-01-06 20:54:32,912 INFO L226 Difference]: Without dead ends: 6464 [2021-01-06 20:54:32,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6464 states. [2021-01-06 20:54:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6464 to 5982. [2021-01-06 20:54:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5982 states. [2021-01-06 20:54:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5982 states to 5982 states and 8256 transitions. [2021-01-06 20:54:35,312 INFO L78 Accepts]: Start accepts. Automaton has 5982 states and 8256 transitions. Word has length 75 [2021-01-06 20:54:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:35,313 INFO L481 AbstractCegarLoop]: Abstraction has 5982 states and 8256 transitions. [2021-01-06 20:54:35,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:54:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5982 states and 8256 transitions. [2021-01-06 20:54:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 20:54:35,314 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:35,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:35,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 20:54:35,314 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:35,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:35,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1852091383, now seen corresponding path program 1 times [2021-01-06 20:54:35,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:35,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557817143] [2021-01-06 20:54:35,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:35,394 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:54:35,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557817143] [2021-01-06 20:54:35,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:35,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 20:54:35,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993373666] [2021-01-06 20:54:35,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:54:35,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:54:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:54:35,396 INFO L87 Difference]: Start difference. First operand 5982 states and 8256 transitions. Second operand 6 states. [2021-01-06 20:54:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:39,348 INFO L93 Difference]: Finished difference Result 9282 states and 12692 transitions. [2021-01-06 20:54:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 20:54:39,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2021-01-06 20:54:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:39,367 INFO L225 Difference]: With dead ends: 9282 [2021-01-06 20:54:39,368 INFO L226 Difference]: Without dead ends: 9280 [2021-01-06 20:54:39,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:54:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9280 states. [2021-01-06 20:54:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9280 to 6078. [2021-01-06 20:54:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6078 states. [2021-01-06 20:54:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6078 states to 6078 states and 8312 transitions. [2021-01-06 20:54:41,648 INFO L78 Accepts]: Start accepts. Automaton has 6078 states and 8312 transitions. Word has length 76 [2021-01-06 20:54:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:41,649 INFO L481 AbstractCegarLoop]: Abstraction has 6078 states and 8312 transitions. [2021-01-06 20:54:41,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:54:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6078 states and 8312 transitions. [2021-01-06 20:54:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:54:41,650 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:41,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:41,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 20:54:41,650 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash -966335138, now seen corresponding path program 1 times [2021-01-06 20:54:41,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:41,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667448149] [2021-01-06 20:54:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:41,693 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:54:41,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667448149] [2021-01-06 20:54:41,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:41,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:54:41,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627174141] [2021-01-06 20:54:41,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:54:41,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:54:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:41,695 INFO L87 Difference]: Start difference. First operand 6078 states and 8312 transitions. Second operand 3 states. [2021-01-06 20:54:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:44,789 INFO L93 Difference]: Finished difference Result 13922 states and 18994 transitions. [2021-01-06 20:54:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:54:44,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 20:54:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:44,811 INFO L225 Difference]: With dead ends: 13922 [2021-01-06 20:54:44,811 INFO L226 Difference]: Without dead ends: 7920 [2021-01-06 20:54:44,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:44,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7920 states. [2021-01-06 20:54:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7920 to 7310. [2021-01-06 20:54:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2021-01-06 20:54:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 9776 transitions. [2021-01-06 20:54:47,690 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 9776 transitions. Word has length 77 [2021-01-06 20:54:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:47,690 INFO L481 AbstractCegarLoop]: Abstraction has 7310 states and 9776 transitions. [2021-01-06 20:54:47,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:54:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 9776 transitions. [2021-01-06 20:54:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 20:54:47,694 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:47,694 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:47,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 20:54:47,694 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash 914913403, now seen corresponding path program 1 times [2021-01-06 20:54:47,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:47,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039211062] [2021-01-06 20:54:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 20:54:47,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039211062] [2021-01-06 20:54:47,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:47,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:54:47,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755235603] [2021-01-06 20:54:47,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:54:47,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:47,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:54:47,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:54:47,872 INFO L87 Difference]: Start difference. First operand 7310 states and 9776 transitions. Second operand 11 states. [2021-01-06 20:55:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:04,399 INFO L93 Difference]: Finished difference Result 41992 states and 55558 transitions. [2021-01-06 20:55:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 20:55:04,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2021-01-06 20:55:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:04,471 INFO L225 Difference]: With dead ends: 41992 [2021-01-06 20:55:04,472 INFO L226 Difference]: Without dead ends: 34746 [2021-01-06 20:55:04,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=342, Invalid=1064, Unknown=0, NotChecked=0, Total=1406 [2021-01-06 20:55:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34746 states. [2021-01-06 20:55:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34746 to 7318. [2021-01-06 20:55:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7318 states. [2021-01-06 20:55:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7318 states to 7318 states and 9784 transitions. [2021-01-06 20:55:07,963 INFO L78 Accepts]: Start accepts. Automaton has 7318 states and 9784 transitions. Word has length 98 [2021-01-06 20:55:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:07,963 INFO L481 AbstractCegarLoop]: Abstraction has 7318 states and 9784 transitions. [2021-01-06 20:55:07,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:55:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7318 states and 9784 transitions. [2021-01-06 20:55:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 20:55:07,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:07,972 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:07,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 20:55:07,973 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1709276203, now seen corresponding path program 1 times [2021-01-06 20:55:07,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:07,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454491819] [2021-01-06 20:55:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 20:55:08,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454491819] [2021-01-06 20:55:08,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:08,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:55:08,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113273788] [2021-01-06 20:55:08,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:55:08,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:08,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:55:08,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:55:08,136 INFO L87 Difference]: Start difference. First operand 7318 states and 9784 transitions. Second operand 9 states. [2021-01-06 20:55:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:14,831 INFO L93 Difference]: Finished difference Result 22064 states and 29450 transitions. [2021-01-06 20:55:14,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:55:14,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2021-01-06 20:55:14,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:14,866 INFO L225 Difference]: With dead ends: 22064 [2021-01-06 20:55:14,867 INFO L226 Difference]: Without dead ends: 14818 [2021-01-06 20:55:14,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:55:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14818 states. [2021-01-06 20:55:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14818 to 7310. [2021-01-06 20:55:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2021-01-06 20:55:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 9774 transitions. [2021-01-06 20:55:18,156 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 9774 transitions. Word has length 99 [2021-01-06 20:55:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:18,157 INFO L481 AbstractCegarLoop]: Abstraction has 7310 states and 9774 transitions. [2021-01-06 20:55:18,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:55:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 9774 transitions. [2021-01-06 20:55:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 20:55:18,159 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:18,159 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:18,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 20:55:18,160 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:55:18,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1310697750, now seen corresponding path program 1 times [2021-01-06 20:55:18,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:18,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504663967] [2021-01-06 20:55:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:18,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504663967] [2021-01-06 20:55:18,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065656035] [2021-01-06 20:55:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:55:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:18,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 20:55:18,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:55:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 20:55:19,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:55:19,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2021-01-06 20:55:19,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953607489] [2021-01-06 20:55:19,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 20:55:19,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:19,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 20:55:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:55:19,119 INFO L87 Difference]: Start difference. First operand 7310 states and 9774 transitions. Second operand 14 states. [2021-01-06 20:55:19,678 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2021-01-06 20:55:20,802 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2021-01-06 20:55:21,107 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-01-06 20:55:21,500 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 20:55:21,760 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-01-06 20:55:21,974 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 20:55:22,149 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-01-06 20:55:22,426 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-01-06 20:55:25,982 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2021-01-06 20:55:26,809 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-01-06 20:55:27,258 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2021-01-06 20:55:27,435 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 20:55:27,749 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-01-06 20:55:29,999 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2021-01-06 20:55:30,399 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 20:55:32,831 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 20:55:33,082 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2021-01-06 20:55:33,277 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-01-06 20:55:33,868 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-01-06 20:55:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:51,795 INFO L93 Difference]: Finished difference Result 50260 states and 65858 transitions. [2021-01-06 20:55:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-01-06 20:55:51,795 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 100 [2021-01-06 20:55:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:51,877 INFO L225 Difference]: With dead ends: 50260 [2021-01-06 20:55:51,877 INFO L226 Difference]: Without dead ends: 43026 [2021-01-06 20:55:51,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4284 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1674, Invalid=9456, Unknown=0, NotChecked=0, Total=11130 [2021-01-06 20:55:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43026 states. [2021-01-06 20:56:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43026 to 17294. [2021-01-06 20:56:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17294 states. [2021-01-06 20:56:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17294 states to 17294 states and 23029 transitions. [2021-01-06 20:56:00,595 INFO L78 Accepts]: Start accepts. Automaton has 17294 states and 23029 transitions. Word has length 100 [2021-01-06 20:56:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:00,595 INFO L481 AbstractCegarLoop]: Abstraction has 17294 states and 23029 transitions. [2021-01-06 20:56:00,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 20:56:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17294 states and 23029 transitions. [2021-01-06 20:56:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 20:56:00,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:00,599 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:56:00,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-06 20:56:00,815 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:00,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2089944216, now seen corresponding path program 1 times [2021-01-06 20:56:00,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:00,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76929527] [2021-01-06 20:56:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:00,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76929527] [2021-01-06 20:56:00,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:56:00,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:56:00,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387793077] [2021-01-06 20:56:00,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:56:00,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:56:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:00,879 INFO L87 Difference]: Start difference. First operand 17294 states and 23029 transitions. Second operand 3 states. [2021-01-06 20:56:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:07,376 INFO L93 Difference]: Finished difference Result 29815 states and 39652 transitions. [2021-01-06 20:56:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:56:07,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 20:56:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:07,392 INFO L225 Difference]: With dead ends: 29815 [2021-01-06 20:56:07,392 INFO L226 Difference]: Without dead ends: 12601 [2021-01-06 20:56:07,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:56:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12601 states. [2021-01-06 20:56:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12601 to 12549. [2021-01-06 20:56:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12549 states. [2021-01-06 20:56:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12549 states to 12549 states and 16354 transitions. [2021-01-06 20:56:13,501 INFO L78 Accepts]: Start accepts. Automaton has 12549 states and 16354 transitions. Word has length 100 [2021-01-06 20:56:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:13,501 INFO L481 AbstractCegarLoop]: Abstraction has 12549 states and 16354 transitions. [2021-01-06 20:56:13,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:56:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 12549 states and 16354 transitions. [2021-01-06 20:56:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 20:56:13,503 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:13,503 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:56:13,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 20:56:13,504 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:13,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:13,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1949073466, now seen corresponding path program 1 times [2021-01-06 20:56:13,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:13,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267414701] [2021-01-06 20:56:13,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:13,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267414701] [2021-01-06 20:56:13,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627761220] [2021-01-06 20:56:13,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:56:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:14,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 20:56:14,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:56:14,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 20:56:15,118 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 20:56:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:15,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:56:15,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-01-06 20:56:15,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635620601] [2021-01-06 20:56:15,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 20:56:15,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:15,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 20:56:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:56:15,251 INFO L87 Difference]: Start difference. First operand 12549 states and 16354 transitions. Second operand 20 states. [2021-01-06 20:56:15,801 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-01-06 20:56:15,981 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-01-06 20:56:16,403 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-01-06 20:56:16,612 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-01-06 20:56:16,863 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 20:56:17,003 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-01-06 20:56:17,400 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 20:56:17,861 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 20:56:18,188 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 20:56:18,434 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 20:56:18,944 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-01-06 20:56:19,441 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 20:56:19,697 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 20:56:20,102 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-01-06 20:56:20,422 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 20:56:20,653 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-01-06 20:56:20,845 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-01-06 20:56:21,142 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 20:56:21,732 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-01-06 20:56:22,172 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-01-06 20:56:22,569 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 20:56:26,165 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-01-06 20:56:26,579 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 20:56:27,074 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 20:56:27,391 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 20:56:27,791 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-01-06 20:56:27,982 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-01-06 20:56:28,267 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-06 20:56:28,736 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 20:56:29,138 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-01-06 20:56:29,407 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-01-06 20:56:29,921 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 20:56:30,289 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-01-06 20:56:31,436 WARN L197 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-01-06 20:56:32,360 WARN L197 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-01-06 20:57:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:57:08,446 INFO L93 Difference]: Finished difference Result 80334 states and 103292 transitions. [2021-01-06 20:57:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-01-06 20:57:08,448 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2021-01-06 20:57:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:57:08,534 INFO L225 Difference]: With dead ends: 80334 [2021-01-06 20:57:08,535 INFO L226 Difference]: Without dead ends: 68359 [2021-01-06 20:57:08,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2021-01-06 20:57:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68359 states. [2021-01-06 20:57:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68359 to 30621. [2021-01-06 20:57:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30621 states. [2021-01-06 20:57:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30621 states to 30621 states and 39855 transitions. [2021-01-06 20:57:25,872 INFO L78 Accepts]: Start accepts. Automaton has 30621 states and 39855 transitions. Word has length 101 [2021-01-06 20:57:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:57:25,872 INFO L481 AbstractCegarLoop]: Abstraction has 30621 states and 39855 transitions. [2021-01-06 20:57:25,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 20:57:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 30621 states and 39855 transitions. [2021-01-06 20:57:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 20:57:25,876 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:57:25,876 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:57:26,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:57:26,090 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:57:26,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:57:26,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1968061963, now seen corresponding path program 1 times [2021-01-06 20:57:26,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:57:26,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276340022] [2021-01-06 20:57:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:57:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:57:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 20:57:26,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276340022] [2021-01-06 20:57:26,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:57:26,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:57:26,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837287119] [2021-01-06 20:57:26,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:57:26,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:57:26,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:57:26,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:57:26,632 INFO L87 Difference]: Start difference. First operand 30621 states and 39855 transitions. Second operand 16 states. [2021-01-06 20:57:26,811 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-01-06 20:57:27,406 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2021-01-06 20:57:27,670 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31