/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.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:11:59,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:11:59,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:11:59,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:11:59,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:11:59,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:11:59,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:11:59,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:11:59,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:11:59,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:11:59,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:11:59,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:11:59,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:11:59,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:11:59,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:11:59,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:11:59,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:11:59,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:11:59,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:11:59,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:11:59,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:11:59,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:11:59,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:11:59,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:11:59,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:11:59,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:11:59,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:11:59,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:11:59,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:11:59,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:11:59,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:11:59,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:11:59,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:11:59,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:11:59,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:11:59,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:11:59,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:11:59,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:11:59,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:11:59,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:11:59,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:11:59,344 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 21:11:59,377 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:11:59,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:11:59,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:11:59,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:11:59,381 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:11:59,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:11:59,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:11:59,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:11:59,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:11:59,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:11:59,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:11:59,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:11:59,385 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:11:59,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:11:59,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:11:59,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:11:59,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:11:59,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:11:59,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:11:59,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:11:59,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:11:59,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:11:59,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:11:59,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:11:59,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:11:59,389 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 21:11:59,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:11:59,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:11:59,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:11:59,810 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:11:59,810 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:11:59,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.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2021-01-06 21:11:59,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7590f0a00/ddaffecc1af4405a98c18a4def8ee105/FLAGaa00ea337 [2021-01-06 21:12:00,492 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:12:00,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2021-01-06 21:12:00,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7590f0a00/ddaffecc1af4405a98c18a4def8ee105/FLAGaa00ea337 [2021-01-06 21:12:00,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7590f0a00/ddaffecc1af4405a98c18a4def8ee105 [2021-01-06 21:12:00,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:12:00,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:12:00,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:12:00,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:12:00,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:12:00,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:12:00" (1/1) ... [2021-01-06 21:12:00,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c786738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:00, skipping insertion in model container [2021-01-06 21:12:00,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:12:00" (1/1) ... [2021-01-06 21:12:00,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:12:00,902 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28618~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28763~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_28984_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_29020~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 21:12:01,180 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.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c[10123,10136] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] 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[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_28984_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_28899~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~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[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2021-01-06 21:12:01,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:12:01,372 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28618~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28763~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_28984_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_29020~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 21:12:01,559 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.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c[10123,10136] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] 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[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_28984_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_28899~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~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[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2021-01-06 21:12:01,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:12:01,682 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:12:01,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01 WrapperNode [2021-01-06 21:12:01,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:12:01,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:12:01,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:12:01,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:12:01,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:01,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:01,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:12:01,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:12:01,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:12:01,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:12:01,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:01,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:01,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:01,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:01,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:01,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:01,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (1/1) ... [2021-01-06 21:12:02,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:12:02,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:12:02,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:12:02,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:12:02,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (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 21:12:02,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:12:02,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:12:02,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:12:02,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:12:03,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:12:03,200 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:12:03,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:12:03 BoogieIcfgContainer [2021-01-06 21:12:03,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:12:03,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:12:03,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:12:03,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:12:03,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:12:00" (1/3) ... [2021-01-06 21:12:03,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c26d786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:12:03, skipping insertion in model container [2021-01-06 21:12:03,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:01" (2/3) ... [2021-01-06 21:12:03,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c26d786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:12:03, skipping insertion in model container [2021-01-06 21:12:03,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:12:03" (3/3) ... [2021-01-06 21:12:03,216 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2021-01-06 21:12:03,224 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:12:03,249 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:12:03,269 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:12:03,312 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:12:03,312 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:12:03,313 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:12:03,313 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:12:03,313 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:12:03,313 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:12:03,313 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:12:03,313 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:12:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states. [2021-01-06 21:12:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 21:12:03,348 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:03,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:03,350 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2055920229, now seen corresponding path program 1 times [2021-01-06 21:12:03,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:03,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026301276] [2021-01-06 21:12:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:03,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026301276] [2021-01-06 21:12:03,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:03,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:03,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210914784] [2021-01-06 21:12:03,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:03,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:03,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:03,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:04,000 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 3 states. [2021-01-06 21:12:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:04,187 INFO L93 Difference]: Finished difference Result 392 states and 655 transitions. [2021-01-06 21:12:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:04,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2021-01-06 21:12:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:04,215 INFO L225 Difference]: With dead ends: 392 [2021-01-06 21:12:04,215 INFO L226 Difference]: Without dead ends: 302 [2021-01-06 21:12:04,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-06 21:12:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2021-01-06 21:12:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2021-01-06 21:12:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 430 transitions. [2021-01-06 21:12:04,303 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 430 transitions. Word has length 108 [2021-01-06 21:12:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:04,306 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 430 transitions. [2021-01-06 21:12:04,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 430 transitions. [2021-01-06 21:12:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 21:12:04,311 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:04,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:04,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:12:04,312 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash -924120728, now seen corresponding path program 1 times [2021-01-06 21:12:04,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:04,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848092158] [2021-01-06 21:12:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:04,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848092158] [2021-01-06 21:12:04,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:04,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:12:04,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766791533] [2021-01-06 21:12:04,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:12:04,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:04,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:12:04,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:12:04,643 INFO L87 Difference]: Start difference. First operand 300 states and 430 transitions. Second operand 5 states. [2021-01-06 21:12:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:04,868 INFO L93 Difference]: Finished difference Result 523 states and 777 transitions. [2021-01-06 21:12:04,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:04,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2021-01-06 21:12:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:04,872 INFO L225 Difference]: With dead ends: 523 [2021-01-06 21:12:04,872 INFO L226 Difference]: Without dead ends: 300 [2021-01-06 21:12:04,874 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 21:12:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-01-06 21:12:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2021-01-06 21:12:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2021-01-06 21:12:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 427 transitions. [2021-01-06 21:12:04,909 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 427 transitions. Word has length 110 [2021-01-06 21:12:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:04,912 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 427 transitions. [2021-01-06 21:12:04,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:12:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 427 transitions. [2021-01-06 21:12:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 21:12:04,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:04,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:04,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:12:04,917 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash -60688016, now seen corresponding path program 1 times [2021-01-06 21:12:04,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:04,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865220632] [2021-01-06 21:12:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:05,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865220632] [2021-01-06 21:12:05,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:05,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:12:05,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236199513] [2021-01-06 21:12:05,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:12:05,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:05,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:12:05,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:12:05,162 INFO L87 Difference]: Start difference. First operand 300 states and 427 transitions. Second operand 6 states. [2021-01-06 21:12:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:05,448 INFO L93 Difference]: Finished difference Result 744 states and 1110 transitions. [2021-01-06 21:12:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:05,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2021-01-06 21:12:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:05,452 INFO L225 Difference]: With dead ends: 744 [2021-01-06 21:12:05,452 INFO L226 Difference]: Without dead ends: 501 [2021-01-06 21:12:05,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:12:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-01-06 21:12:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2021-01-06 21:12:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2021-01-06 21:12:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 737 transitions. [2021-01-06 21:12:05,497 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 737 transitions. Word has length 111 [2021-01-06 21:12:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:05,497 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 737 transitions. [2021-01-06 21:12:05,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:12:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 737 transitions. [2021-01-06 21:12:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 21:12:05,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:05,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:05,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:12:05,501 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1379929356, now seen corresponding path program 1 times [2021-01-06 21:12:05,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:05,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083344119] [2021-01-06 21:12:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:05,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083344119] [2021-01-06 21:12:05,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:05,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:12:05,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416880741] [2021-01-06 21:12:05,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:12:05,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:12:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:12:05,678 INFO L87 Difference]: Start difference. First operand 499 states and 737 transitions. Second operand 6 states. [2021-01-06 21:12:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:05,962 INFO L93 Difference]: Finished difference Result 1253 states and 1906 transitions. [2021-01-06 21:12:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:05,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2021-01-06 21:12:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:05,970 INFO L225 Difference]: With dead ends: 1253 [2021-01-06 21:12:05,970 INFO L226 Difference]: Without dead ends: 827 [2021-01-06 21:12:05,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:12:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-01-06 21:12:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 825. [2021-01-06 21:12:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2021-01-06 21:12:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1240 transitions. [2021-01-06 21:12:06,042 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1240 transitions. Word has length 112 [2021-01-06 21:12:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:06,043 INFO L481 AbstractCegarLoop]: Abstraction has 825 states and 1240 transitions. [2021-01-06 21:12:06,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:12:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1240 transitions. [2021-01-06 21:12:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 21:12:06,047 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:06,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:06,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:12:06,048 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:06,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1876446736, now seen corresponding path program 1 times [2021-01-06 21:12:06,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:06,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147088561] [2021-01-06 21:12:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:06,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147088561] [2021-01-06 21:12:06,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:06,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:12:06,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8321971] [2021-01-06 21:12:06,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:12:06,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:06,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:12:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:12:06,260 INFO L87 Difference]: Start difference. First operand 825 states and 1240 transitions. Second operand 6 states. [2021-01-06 21:12:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:06,575 INFO L93 Difference]: Finished difference Result 2251 states and 3445 transitions. [2021-01-06 21:12:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:06,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2021-01-06 21:12:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:06,584 INFO L225 Difference]: With dead ends: 2251 [2021-01-06 21:12:06,584 INFO L226 Difference]: Without dead ends: 1495 [2021-01-06 21:12:06,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:12:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2021-01-06 21:12:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1493. [2021-01-06 21:12:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2021-01-06 21:12:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2267 transitions. [2021-01-06 21:12:06,697 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2267 transitions. Word has length 113 [2021-01-06 21:12:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:06,697 INFO L481 AbstractCegarLoop]: Abstraction has 1493 states and 2267 transitions. [2021-01-06 21:12:06,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:12:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2267 transitions. [2021-01-06 21:12:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 21:12:06,700 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:06,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:06,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:12:06,700 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash 280743296, now seen corresponding path program 1 times [2021-01-06 21:12:06,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:06,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264707172] [2021-01-06 21:12:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:06,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264707172] [2021-01-06 21:12:06,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:06,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:12:06,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27954975] [2021-01-06 21:12:06,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:12:06,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:06,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:12:06,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:12:06,867 INFO L87 Difference]: Start difference. First operand 1493 states and 2267 transitions. Second operand 6 states. [2021-01-06 21:12:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:07,290 INFO L93 Difference]: Finished difference Result 4099 states and 6291 transitions. [2021-01-06 21:12:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:07,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2021-01-06 21:12:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:07,305 INFO L225 Difference]: With dead ends: 4099 [2021-01-06 21:12:07,306 INFO L226 Difference]: Without dead ends: 2687 [2021-01-06 21:12:07,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:12:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2021-01-06 21:12:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2685. [2021-01-06 21:12:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2021-01-06 21:12:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 4090 transitions. [2021-01-06 21:12:07,523 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 4090 transitions. Word has length 114 [2021-01-06 21:12:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:07,524 INFO L481 AbstractCegarLoop]: Abstraction has 2685 states and 4090 transitions. [2021-01-06 21:12:07,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:12:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 4090 transitions. [2021-01-06 21:12:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 21:12:07,526 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:07,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:07,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:12:07,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:07,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:07,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1479037516, now seen corresponding path program 1 times [2021-01-06 21:12:07,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:07,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38815920] [2021-01-06 21:12:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:07,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38815920] [2021-01-06 21:12:07,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:07,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:12:07,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836681965] [2021-01-06 21:12:07,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:12:07,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:07,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:12:07,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:12:07,679 INFO L87 Difference]: Start difference. First operand 2685 states and 4090 transitions. Second operand 5 states. [2021-01-06 21:12:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:08,006 INFO L93 Difference]: Finished difference Result 5305 states and 8113 transitions. [2021-01-06 21:12:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:08,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2021-01-06 21:12:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:08,020 INFO L225 Difference]: With dead ends: 5305 [2021-01-06 21:12:08,021 INFO L226 Difference]: Without dead ends: 2685 [2021-01-06 21:12:08,028 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 21:12:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2021-01-06 21:12:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2021-01-06 21:12:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2021-01-06 21:12:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 4057 transitions. [2021-01-06 21:12:08,240 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 4057 transitions. Word has length 115 [2021-01-06 21:12:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:08,240 INFO L481 AbstractCegarLoop]: Abstraction has 2685 states and 4057 transitions. [2021-01-06 21:12:08,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:12:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 4057 transitions. [2021-01-06 21:12:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:12:08,243 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:08,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:08,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:12:08,244 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash -313559600, now seen corresponding path program 1 times [2021-01-06 21:12:08,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:08,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38044244] [2021-01-06 21:12:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:08,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38044244] [2021-01-06 21:12:08,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:08,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:12:08,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648261124] [2021-01-06 21:12:08,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:12:08,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:08,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:12:08,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:12:08,367 INFO L87 Difference]: Start difference. First operand 2685 states and 4057 transitions. Second operand 5 states. [2021-01-06 21:12:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:08,793 INFO L93 Difference]: Finished difference Result 5309 states and 8052 transitions. [2021-01-06 21:12:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:08,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2021-01-06 21:12:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:08,813 INFO L225 Difference]: With dead ends: 5309 [2021-01-06 21:12:08,813 INFO L226 Difference]: Without dead ends: 2685 [2021-01-06 21:12:08,819 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 21:12:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2021-01-06 21:12:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2021-01-06 21:12:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2021-01-06 21:12:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 4024 transitions. [2021-01-06 21:12:09,039 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 4024 transitions. Word has length 116 [2021-01-06 21:12:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:09,039 INFO L481 AbstractCegarLoop]: Abstraction has 2685 states and 4024 transitions. [2021-01-06 21:12:09,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:12:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 4024 transitions. [2021-01-06 21:12:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:12:09,042 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:09,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:09,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:12:09,042 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash 804140096, now seen corresponding path program 1 times [2021-01-06 21:12:09,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:09,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316928037] [2021-01-06 21:12:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:09,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316928037] [2021-01-06 21:12:09,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:09,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:12:09,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704944978] [2021-01-06 21:12:09,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:12:09,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:09,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:12:09,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:12:09,305 INFO L87 Difference]: Start difference. First operand 2685 states and 4024 transitions. Second operand 9 states. [2021-01-06 21:12:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:11,137 INFO L93 Difference]: Finished difference Result 20753 states and 31348 transitions. [2021-01-06 21:12:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:12:11,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2021-01-06 21:12:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:11,237 INFO L225 Difference]: With dead ends: 20753 [2021-01-06 21:12:11,237 INFO L226 Difference]: Without dead ends: 18351 [2021-01-06 21:12:11,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:12:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18351 states. [2021-01-06 21:12:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18351 to 3912. [2021-01-06 21:12:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3912 states. [2021-01-06 21:12:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5888 transitions. [2021-01-06 21:12:11,978 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5888 transitions. Word has length 117 [2021-01-06 21:12:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:11,979 INFO L481 AbstractCegarLoop]: Abstraction has 3912 states and 5888 transitions. [2021-01-06 21:12:11,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:12:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5888 transitions. [2021-01-06 21:12:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:12:11,981 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:11,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:11,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:12:11,982 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 435341244, now seen corresponding path program 1 times [2021-01-06 21:12:11,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:11,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859297644] [2021-01-06 21:12:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:12,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859297644] [2021-01-06 21:12:12,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:12,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:12:12,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39593764] [2021-01-06 21:12:12,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:12:12,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:12,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:12:12,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:12:12,214 INFO L87 Difference]: Start difference. First operand 3912 states and 5888 transitions. Second operand 9 states. [2021-01-06 21:12:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:14,711 INFO L93 Difference]: Finished difference Result 21869 states and 33048 transitions. [2021-01-06 21:12:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:12:14,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2021-01-06 21:12:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:14,756 INFO L225 Difference]: With dead ends: 21869 [2021-01-06 21:12:14,756 INFO L226 Difference]: Without dead ends: 19467 [2021-01-06 21:12:14,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:12:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19467 states. [2021-01-06 21:12:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19467 to 6508. [2021-01-06 21:12:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6508 states. [2021-01-06 21:12:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 9836 transitions. [2021-01-06 21:12:15,601 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 9836 transitions. Word has length 117 [2021-01-06 21:12:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:15,601 INFO L481 AbstractCegarLoop]: Abstraction has 6508 states and 9836 transitions. [2021-01-06 21:12:15,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:12:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 9836 transitions. [2021-01-06 21:12:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:12:15,604 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:15,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:15,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:12:15,605 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash 433127764, now seen corresponding path program 1 times [2021-01-06 21:12:15,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:15,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114729844] [2021-01-06 21:12:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:15,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114729844] [2021-01-06 21:12:15,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:15,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:12:15,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831023153] [2021-01-06 21:12:15,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:12:15,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:12:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:12:15,797 INFO L87 Difference]: Start difference. First operand 6508 states and 9836 transitions. Second operand 9 states. [2021-01-06 21:12:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:18,462 INFO L93 Difference]: Finished difference Result 23019 states and 34800 transitions. [2021-01-06 21:12:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:12:18,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2021-01-06 21:12:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:18,502 INFO L225 Difference]: With dead ends: 23019 [2021-01-06 21:12:18,502 INFO L226 Difference]: Without dead ends: 20617 [2021-01-06 21:12:18,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:12:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20617 states. [2021-01-06 21:12:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20617 to 7818. [2021-01-06 21:12:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7818 states. [2021-01-06 21:12:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7818 states to 7818 states and 11828 transitions. [2021-01-06 21:12:19,528 INFO L78 Accepts]: Start accepts. Automaton has 7818 states and 11828 transitions. Word has length 117 [2021-01-06 21:12:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:19,528 INFO L481 AbstractCegarLoop]: Abstraction has 7818 states and 11828 transitions. [2021-01-06 21:12:19,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:12:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 7818 states and 11828 transitions. [2021-01-06 21:12:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:12:19,532 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:19,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:19,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:12:19,533 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:19,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1843774360, now seen corresponding path program 1 times [2021-01-06 21:12:19,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:19,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106467921] [2021-01-06 21:12:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:19,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106467921] [2021-01-06 21:12:19,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:19,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:12:19,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47322526] [2021-01-06 21:12:19,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:12:19,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:12:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:12:19,722 INFO L87 Difference]: Start difference. First operand 7818 states and 11828 transitions. Second operand 9 states. [2021-01-06 21:12:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:22,660 INFO L93 Difference]: Finished difference Result 23993 states and 36278 transitions. [2021-01-06 21:12:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:12:22,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2021-01-06 21:12:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:22,697 INFO L225 Difference]: With dead ends: 23993 [2021-01-06 21:12:22,697 INFO L226 Difference]: Without dead ends: 21591 [2021-01-06 21:12:22,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:12:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21591 states. [2021-01-06 21:12:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21591 to 9074. [2021-01-06 21:12:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2021-01-06 21:12:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 13736 transitions. [2021-01-06 21:12:24,123 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 13736 transitions. Word has length 117 [2021-01-06 21:12:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:24,123 INFO L481 AbstractCegarLoop]: Abstraction has 9074 states and 13736 transitions. [2021-01-06 21:12:24,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:12:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 13736 transitions. [2021-01-06 21:12:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:12:24,128 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:24,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:24,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:12:24,128 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:24,129 INFO L82 PathProgramCache]: Analyzing trace with hash 202891668, now seen corresponding path program 1 times [2021-01-06 21:12:24,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:24,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038487047] [2021-01-06 21:12:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:24,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038487047] [2021-01-06 21:12:24,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:24,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:12:24,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423645101] [2021-01-06 21:12:24,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:12:24,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:24,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:12:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:12:24,286 INFO L87 Difference]: Start difference. First operand 9074 states and 13736 transitions. Second operand 9 states. [2021-01-06 21:12:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:27,568 INFO L93 Difference]: Finished difference Result 25071 states and 37916 transitions. [2021-01-06 21:12:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:12:27,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2021-01-06 21:12:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:27,596 INFO L225 Difference]: With dead ends: 25071 [2021-01-06 21:12:27,596 INFO L226 Difference]: Without dead ends: 22669 [2021-01-06 21:12:27,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:12:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22669 states. [2021-01-06 21:12:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22669 to 10314. [2021-01-06 21:12:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10314 states. [2021-01-06 21:12:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10314 states to 10314 states and 15616 transitions. [2021-01-06 21:12:29,328 INFO L78 Accepts]: Start accepts. Automaton has 10314 states and 15616 transitions. Word has length 117 [2021-01-06 21:12:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:29,329 INFO L481 AbstractCegarLoop]: Abstraction has 10314 states and 15616 transitions. [2021-01-06 21:12:29,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:12:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 10314 states and 15616 transitions. [2021-01-06 21:12:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:12:29,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:29,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:29,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:12:29,335 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1380438633, now seen corresponding path program 1 times [2021-01-06 21:12:29,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:29,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545479509] [2021-01-06 21:12:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:29,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545479509] [2021-01-06 21:12:29,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:29,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:29,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806044640] [2021-01-06 21:12:29,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:29,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:29,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:29,458 INFO L87 Difference]: Start difference. First operand 10314 states and 15616 transitions. Second operand 3 states. [2021-01-06 21:12:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:31,756 INFO L93 Difference]: Finished difference Result 27502 states and 41714 transitions. [2021-01-06 21:12:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:31,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2021-01-06 21:12:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:31,782 INFO L225 Difference]: With dead ends: 27502 [2021-01-06 21:12:31,783 INFO L226 Difference]: Without dead ends: 17708 [2021-01-06 21:12:31,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17708 states. [2021-01-06 21:12:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17708 to 17706. [2021-01-06 21:12:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17706 states. [2021-01-06 21:12:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17706 states to 17706 states and 26624 transitions. [2021-01-06 21:12:34,229 INFO L78 Accepts]: Start accepts. Automaton has 17706 states and 26624 transitions. Word has length 117 [2021-01-06 21:12:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:34,229 INFO L481 AbstractCegarLoop]: Abstraction has 17706 states and 26624 transitions. [2021-01-06 21:12:34,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 17706 states and 26624 transitions. [2021-01-06 21:12:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:12:34,233 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:34,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:34,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:12:34,234 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:34,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:34,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1623562984, now seen corresponding path program 1 times [2021-01-06 21:12:34,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:34,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862566627] [2021-01-06 21:12:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:34,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862566627] [2021-01-06 21:12:34,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:34,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:34,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806771730] [2021-01-06 21:12:34,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:34,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:34,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:34,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:34,380 INFO L87 Difference]: Start difference. First operand 17706 states and 26624 transitions. Second operand 3 states. [2021-01-06 21:12:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:39,007 INFO L93 Difference]: Finished difference Result 50670 states and 76002 transitions. [2021-01-06 21:12:39,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:39,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2021-01-06 21:12:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:39,046 INFO L225 Difference]: With dead ends: 50670 [2021-01-06 21:12:39,046 INFO L226 Difference]: Without dead ends: 33484 [2021-01-06 21:12:39,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33484 states. [2021-01-06 21:12:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33484 to 33482. [2021-01-06 21:12:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33482 states. [2021-01-06 21:12:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33482 states to 33482 states and 49712 transitions. [2021-01-06 21:12:44,149 INFO L78 Accepts]: Start accepts. Automaton has 33482 states and 49712 transitions. Word has length 117 [2021-01-06 21:12:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:44,150 INFO L481 AbstractCegarLoop]: Abstraction has 33482 states and 49712 transitions. [2021-01-06 21:12:44,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33482 states and 49712 transitions. [2021-01-06 21:12:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:12:44,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:44,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:44,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:12:44,155 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash -475226918, now seen corresponding path program 1 times [2021-01-06 21:12:44,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:44,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650654784] [2021-01-06 21:12:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:12:44,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650654784] [2021-01-06 21:12:44,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:44,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:12:44,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155864606] [2021-01-06 21:12:44,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:12:44,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:44,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:12:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:12:44,373 INFO L87 Difference]: Start difference. First operand 33482 states and 49712 transitions. Second operand 9 states. [2021-01-06 21:12:44,490 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 21:12:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:56,107 INFO L93 Difference]: Finished difference Result 80393 states and 119542 transitions. [2021-01-06 21:12:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:12:56,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2021-01-06 21:12:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:56,178 INFO L225 Difference]: With dead ends: 80393 [2021-01-06 21:12:56,178 INFO L226 Difference]: Without dead ends: 73399 [2021-01-06 21:12:56,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:12:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73399 states. [2021-01-06 21:13:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73399 to 38202. [2021-01-06 21:13:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38202 states. [2021-01-06 21:13:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38202 states to 38202 states and 56720 transitions. [2021-01-06 21:13:02,397 INFO L78 Accepts]: Start accepts. Automaton has 38202 states and 56720 transitions. Word has length 117 [2021-01-06 21:13:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:02,397 INFO L481 AbstractCegarLoop]: Abstraction has 38202 states and 56720 transitions. [2021-01-06 21:13:02,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:13:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 38202 states and 56720 transitions. [2021-01-06 21:13:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:13:02,402 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:02,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:02,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:13:02,402 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash -876282968, now seen corresponding path program 1 times [2021-01-06 21:13:02,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:02,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630506623] [2021-01-06 21:13:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:13:02,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630506623] [2021-01-06 21:13:02,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:02,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:02,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048796096] [2021-01-06 21:13:02,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:13:02,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:02,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:13:02,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:13:02,593 INFO L87 Difference]: Start difference. First operand 38202 states and 56720 transitions. Second operand 9 states. [2021-01-06 21:13:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:16,214 INFO L93 Difference]: Finished difference Result 86085 states and 128008 transitions. [2021-01-06 21:13:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:13:16,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2021-01-06 21:13:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:16,289 INFO L225 Difference]: With dead ends: 86085 [2021-01-06 21:13:16,289 INFO L226 Difference]: Without dead ends: 79091 [2021-01-06 21:13:16,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:13:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79091 states. [2021-01-06 21:13:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79091 to 42956. [2021-01-06 21:13:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42956 states. [2021-01-06 21:13:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42956 states to 42956 states and 63780 transitions. [2021-01-06 21:13:23,633 INFO L78 Accepts]: Start accepts. Automaton has 42956 states and 63780 transitions. Word has length 117 [2021-01-06 21:13:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:23,634 INFO L481 AbstractCegarLoop]: Abstraction has 42956 states and 63780 transitions. [2021-01-06 21:13:23,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:13:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 42956 states and 63780 transitions. [2021-01-06 21:13:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 21:13:23,639 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:23,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:13:23,639 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash 154166167, now seen corresponding path program 1 times [2021-01-06 21:13:23,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:23,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092032334] [2021-01-06 21:13:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:13:23,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092032334] [2021-01-06 21:13:23,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:23,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:13:23,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704838896] [2021-01-06 21:13:23,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:13:23,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:13:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:13:23,737 INFO L87 Difference]: Start difference. First operand 42956 states and 63780 transitions. Second operand 5 states. [2021-01-06 21:13:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:36,345 INFO L93 Difference]: Finished difference Result 73510 states and 109117 transitions. [2021-01-06 21:13:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:13:36,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2021-01-06 21:13:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:36,411 INFO L225 Difference]: With dead ends: 73510 [2021-01-06 21:13:36,412 INFO L226 Difference]: Without dead ends: 73508 [2021-01-06 21:13:36,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:13:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73508 states. [2021-01-06 21:13:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73508 to 43212. [2021-01-06 21:13:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43212 states. [2021-01-06 21:13:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43212 states to 43212 states and 63892 transitions. [2021-01-06 21:13:44,287 INFO L78 Accepts]: Start accepts. Automaton has 43212 states and 63892 transitions. Word has length 118 [2021-01-06 21:13:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:44,287 INFO L481 AbstractCegarLoop]: Abstraction has 43212 states and 63892 transitions. [2021-01-06 21:13:44,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:13:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 43212 states and 63892 transitions. [2021-01-06 21:13:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 21:13:44,292 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:44,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:44,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:13:44,293 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1441850003, now seen corresponding path program 1 times [2021-01-06 21:13:44,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:44,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529584819] [2021-01-06 21:13:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:13:44,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529584819] [2021-01-06 21:13:44,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:44,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:44,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143892216] [2021-01-06 21:13:44,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:13:44,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:13:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:13:44,591 INFO L87 Difference]: Start difference. First operand 43212 states and 63892 transitions. Second operand 10 states. [2021-01-06 21:14:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:02,365 INFO L93 Difference]: Finished difference Result 130343 states and 192230 transitions. [2021-01-06 21:14:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:14:02,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 118 [2021-01-06 21:14:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:02,457 INFO L225 Difference]: With dead ends: 130343 [2021-01-06 21:14:02,458 INFO L226 Difference]: Without dead ends: 87361 [2021-01-06 21:14:02,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:14:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87361 states. [2021-01-06 21:14:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87361 to 43212. [2021-01-06 21:14:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43212 states. [2021-01-06 21:14:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43212 states to 43212 states and 63886 transitions. [2021-01-06 21:14:11,356 INFO L78 Accepts]: Start accepts. Automaton has 43212 states and 63886 transitions. Word has length 118 [2021-01-06 21:14:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:14:11,356 INFO L481 AbstractCegarLoop]: Abstraction has 43212 states and 63886 transitions. [2021-01-06 21:14:11,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:14:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 43212 states and 63886 transitions. [2021-01-06 21:14:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 21:14:11,361 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:14:11,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:14:11,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 21:14:11,361 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:14:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:14:11,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1556230175, now seen corresponding path program 1 times [2021-01-06 21:14:11,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:14:11,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995063186] [2021-01-06 21:14:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:14:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:14:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:14:11,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995063186] [2021-01-06 21:14:11,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:14:11,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:14:11,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367123173] [2021-01-06 21:14:11,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:14:11,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:14:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:14:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:14:11,624 INFO L87 Difference]: Start difference. First operand 43212 states and 63886 transitions. Second operand 10 states. [2021-01-06 21:14:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:26,338 INFO L93 Difference]: Finished difference Result 108259 states and 159753 transitions. [2021-01-06 21:14:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:14:26,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2021-01-06 21:14:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:26,399 INFO L225 Difference]: With dead ends: 108259 [2021-01-06 21:14:26,399 INFO L226 Difference]: Without dead ends: 65262 [2021-01-06 21:14:26,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:14:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65262 states. [2021-01-06 21:14:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65262 to 43212. [2021-01-06 21:14:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43212 states. [2021-01-06 21:14:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43212 states to 43212 states and 63883 transitions. [2021-01-06 21:14:35,753 INFO L78 Accepts]: Start accepts. Automaton has 43212 states and 63883 transitions. Word has length 119 [2021-01-06 21:14:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:14:35,754 INFO L481 AbstractCegarLoop]: Abstraction has 43212 states and 63883 transitions. [2021-01-06 21:14:35,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:14:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 43212 states and 63883 transitions. [2021-01-06 21:14:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 21:14:35,757 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:14:35,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:14:35,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 21:14:35,757 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:14:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:14:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash 510358621, now seen corresponding path program 1 times [2021-01-06 21:14:35,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:14:35,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541491336] [2021-01-06 21:14:35,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:14:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:14:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:14:36,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541491336] [2021-01-06 21:14:36,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:14:36,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:14:36,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530277862] [2021-01-06 21:14:36,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:14:36,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:14:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:14:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:14:36,037 INFO L87 Difference]: Start difference. First operand 43212 states and 63883 transitions. Second operand 9 states. [2021-01-06 21:14:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:51,539 INFO L93 Difference]: Finished difference Result 107383 states and 158721 transitions. [2021-01-06 21:14:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:14:51,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2021-01-06 21:14:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:51,603 INFO L225 Difference]: With dead ends: 107383 [2021-01-06 21:14:51,603 INFO L226 Difference]: Without dead ends: 64521 [2021-01-06 21:14:51,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:14:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64521 states. [2021-01-06 21:15:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64521 to 43047. [2021-01-06 21:15:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43047 states. [2021-01-06 21:15:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43047 states to 43047 states and 63633 transitions. [2021-01-06 21:15:01,722 INFO L78 Accepts]: Start accepts. Automaton has 43047 states and 63633 transitions. Word has length 119 [2021-01-06 21:15:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:15:01,722 INFO L481 AbstractCegarLoop]: Abstraction has 43047 states and 63633 transitions. [2021-01-06 21:15:01,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:15:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 43047 states and 63633 transitions. [2021-01-06 21:15:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 21:15:01,725 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:15:01,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:15:01,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 21:15:01,725 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:15:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:15:01,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1770166343, now seen corresponding path program 1 times [2021-01-06 21:15:01,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:15:01,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396415364] [2021-01-06 21:15:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:15:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:15:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:15:01,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396415364] [2021-01-06 21:15:01,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:15:01,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:15:01,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343206405] [2021-01-06 21:15:01,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:15:01,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:15:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:15:01,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:15:01,962 INFO L87 Difference]: Start difference. First operand 43047 states and 63633 transitions. Second operand 10 states. [2021-01-06 21:15:06,227 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2021-01-06 21:15:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:15:24,318 INFO L93 Difference]: Finished difference Result 129838 states and 191454 transitions. [2021-01-06 21:15:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:15:24,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2021-01-06 21:15:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:15:24,422 INFO L225 Difference]: With dead ends: 129838 [2021-01-06 21:15:24,422 INFO L226 Difference]: Without dead ends: 87070 [2021-01-06 21:15:24,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:15:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87070 states. [2021-01-06 21:15:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87070 to 43047. [2021-01-06 21:15:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43047 states. [2021-01-06 21:15:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43047 states to 43047 states and 63627 transitions. [2021-01-06 21:15:35,461 INFO L78 Accepts]: Start accepts. Automaton has 43047 states and 63627 transitions. Word has length 120 [2021-01-06 21:15:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:15:35,461 INFO L481 AbstractCegarLoop]: Abstraction has 43047 states and 63627 transitions. [2021-01-06 21:15:35,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:15:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 43047 states and 63627 transitions. [2021-01-06 21:15:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 21:15:35,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:15:35,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:15:35,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 21:15:35,464 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:15:35,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:15:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash -863997056, now seen corresponding path program 1 times [2021-01-06 21:15:35,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:15:35,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739410592] [2021-01-06 21:15:35,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:15:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:15:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:15:35,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739410592] [2021-01-06 21:15:35,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:15:35,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:15:35,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793620496] [2021-01-06 21:15:35,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:15:35,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:15:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:15:35,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:15:35,717 INFO L87 Difference]: Start difference. First operand 43047 states and 63627 transitions. Second operand 10 states. [2021-01-06 21:15:36,074 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21