/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-dcfa08f [2020-12-23 11:20:03,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 11:20:03,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 11:20:03,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 11:20:03,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 11:20:03,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 11:20:03,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 11:20:03,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 11:20:03,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 11:20:03,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 11:20:03,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 11:20:03,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 11:20:03,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 11:20:03,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 11:20:03,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 11:20:03,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 11:20:03,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 11:20:03,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 11:20:03,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 11:20:03,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 11:20:03,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 11:20:03,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 11:20:03,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 11:20:03,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 11:20:03,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 11:20:03,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 11:20:03,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 11:20:03,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 11:20:03,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 11:20:03,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 11:20:03,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 11:20:03,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 11:20:03,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 11:20:03,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 11:20:03,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 11:20:03,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 11:20:03,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 11:20:03,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 11:20:03,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 11:20:03,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 11:20:03,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 11:20:03,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 11:20:03,866 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 11:20:03,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 11:20:03,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 11:20:03,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 11:20:03,872 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 11:20:03,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 11:20:03,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 11:20:03,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 11:20:03,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 11:20:03,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 11:20:03,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 11:20:03,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 11:20:03,875 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 11:20:03,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 11:20:03,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 11:20:03,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 11:20:03,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 11:20:03,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:20:03,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 11:20:03,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 11:20:03,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 11:20:03,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 11:20:03,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 11:20:03,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 11:20:03,877 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 11:20:03,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 11:20:04,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 11:20:04,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 11:20:04,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 11:20:04,341 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 11:20:04,342 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 11:20:04,343 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 [2020-12-23 11:20:04,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7d5e3047f/984a8a47969a4da8bf52a8b8a79cfe57/FLAG231c64efe [2020-12-23 11:20:05,176 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 11:20:05,177 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 [2020-12-23 11:20:05,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7d5e3047f/984a8a47969a4da8bf52a8b8a79cfe57/FLAG231c64efe [2020-12-23 11:20:05,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7d5e3047f/984a8a47969a4da8bf52a8b8a79cfe57 [2020-12-23 11:20:05,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 11:20:05,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 11:20:05,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 11:20:05,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 11:20:05,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 11:20:05,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:20:05" (1/1) ... [2020-12-23 11:20:05,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3e2c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:05, skipping insertion in model container [2020-12-23 11:20:05,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:20:05" (1/1) ... [2020-12-23 11:20:05,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 11:20:05,506 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,] [2020-12-23 11:20:05,820 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,] [2020-12-23 11:20:05,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:20:05,952 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,] [2020-12-23 11:20:06,077 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,] [2020-12-23 11:20:06,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:20:06,227 INFO L208 MainTranslator]: Completed translation [2020-12-23 11:20:06,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06 WrapperNode [2020-12-23 11:20:06,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 11:20:06,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 11:20:06,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 11:20:06,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 11:20:06,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 11:20:06,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 11:20:06,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 11:20:06,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 11:20:06,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... [2020-12-23 11:20:06,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 11:20:06,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 11:20:06,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 11:20:06,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 11:20:06,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:20:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 11:20:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 11:20:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 11:20:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 11:20:07,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 11:20:07,729 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-23 11:20:07,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:20:07 BoogieIcfgContainer [2020-12-23 11:20:07,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 11:20:07,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 11:20:07,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 11:20:07,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 11:20:07,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:20:05" (1/3) ... [2020-12-23 11:20:07,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5e7fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:20:07, skipping insertion in model container [2020-12-23 11:20:07,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:20:06" (2/3) ... [2020-12-23 11:20:07,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5e7fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:20:07, skipping insertion in model container [2020-12-23 11:20:07,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:20:07" (3/3) ... [2020-12-23 11:20:07,742 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2020-12-23 11:20:07,749 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 11:20:07,755 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 11:20:07,776 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 11:20:07,807 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 11:20:07,807 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 11:20:07,807 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 11:20:07,807 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 11:20:07,808 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 11:20:07,808 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 11:20:07,808 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 11:20:07,808 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 11:20:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states. [2020-12-23 11:20:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 11:20:07,839 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:07,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:20:07,841 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2055920229, now seen corresponding path program 1 times [2020-12-23 11:20:07,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:07,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417733697] [2020-12-23 11:20:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:08,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417733697] [2020-12-23 11:20:08,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:08,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:20:08,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742893043] [2020-12-23 11:20:08,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:20:08,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:08,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:20:08,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:20:08,510 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 3 states. [2020-12-23 11:20:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:08,723 INFO L93 Difference]: Finished difference Result 392 states and 655 transitions. [2020-12-23 11:20:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:20:08,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2020-12-23 11:20:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:08,768 INFO L225 Difference]: With dead ends: 392 [2020-12-23 11:20:08,770 INFO L226 Difference]: Without dead ends: 302 [2020-12-23 11:20:08,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:20:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-12-23 11:20:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2020-12-23 11:20:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-12-23 11:20:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 430 transitions. [2020-12-23 11:20:08,875 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 430 transitions. Word has length 108 [2020-12-23 11:20:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:08,876 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 430 transitions. [2020-12-23 11:20:08,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:20:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 430 transitions. [2020-12-23 11:20:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 11:20:08,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:08,880 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] [2020-12-23 11:20:08,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 11:20:08,881 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash -924120728, now seen corresponding path program 1 times [2020-12-23 11:20:08,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:08,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545664193] [2020-12-23 11:20:08,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:09,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545664193] [2020-12-23 11:20:09,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:09,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:20:09,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454784625] [2020-12-23 11:20:09,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:20:09,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:20:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:20:09,214 INFO L87 Difference]: Start difference. First operand 300 states and 430 transitions. Second operand 5 states. [2020-12-23 11:20:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:09,476 INFO L93 Difference]: Finished difference Result 523 states and 777 transitions. [2020-12-23 11:20:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:20:09,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2020-12-23 11:20:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:09,480 INFO L225 Difference]: With dead ends: 523 [2020-12-23 11:20:09,481 INFO L226 Difference]: Without dead ends: 300 [2020-12-23 11:20:09,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:20:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-12-23 11:20:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2020-12-23 11:20:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-12-23 11:20:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 427 transitions. [2020-12-23 11:20:09,514 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 427 transitions. Word has length 110 [2020-12-23 11:20:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:09,515 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 427 transitions. [2020-12-23 11:20:09,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:20:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 427 transitions. [2020-12-23 11:20:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 11:20:09,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:09,523 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:20:09,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 11:20:09,524 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:09,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash -60688016, now seen corresponding path program 1 times [2020-12-23 11:20:09,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:09,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693024814] [2020-12-23 11:20:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:09,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693024814] [2020-12-23 11:20:09,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:09,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:20:09,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620353078] [2020-12-23 11:20:09,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:20:09,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:09,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:20:09,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:20:09,746 INFO L87 Difference]: Start difference. First operand 300 states and 427 transitions. Second operand 6 states. [2020-12-23 11:20:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:10,100 INFO L93 Difference]: Finished difference Result 744 states and 1110 transitions. [2020-12-23 11:20:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:20:10,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2020-12-23 11:20:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:10,105 INFO L225 Difference]: With dead ends: 744 [2020-12-23 11:20:10,105 INFO L226 Difference]: Without dead ends: 501 [2020-12-23 11:20:10,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:20:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-12-23 11:20:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2020-12-23 11:20:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-12-23 11:20:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 737 transitions. [2020-12-23 11:20:10,178 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 737 transitions. Word has length 111 [2020-12-23 11:20:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:10,186 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 737 transitions. [2020-12-23 11:20:10,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:20:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 737 transitions. [2020-12-23 11:20:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 11:20:10,195 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:10,196 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] [2020-12-23 11:20:10,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 11:20:10,196 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:10,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1379929356, now seen corresponding path program 1 times [2020-12-23 11:20:10,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:10,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498875473] [2020-12-23 11:20:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:10,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498875473] [2020-12-23 11:20:10,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:10,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:20:10,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391193810] [2020-12-23 11:20:10,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:20:10,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:10,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:20:10,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:20:10,461 INFO L87 Difference]: Start difference. First operand 499 states and 737 transitions. Second operand 6 states. [2020-12-23 11:20:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:10,827 INFO L93 Difference]: Finished difference Result 1253 states and 1906 transitions. [2020-12-23 11:20:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:20:10,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2020-12-23 11:20:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:10,833 INFO L225 Difference]: With dead ends: 1253 [2020-12-23 11:20:10,833 INFO L226 Difference]: Without dead ends: 827 [2020-12-23 11:20:10,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:20:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2020-12-23 11:20:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 825. [2020-12-23 11:20:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2020-12-23 11:20:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1240 transitions. [2020-12-23 11:20:10,893 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1240 transitions. Word has length 112 [2020-12-23 11:20:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:10,893 INFO L481 AbstractCegarLoop]: Abstraction has 825 states and 1240 transitions. [2020-12-23 11:20:10,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:20:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1240 transitions. [2020-12-23 11:20:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 11:20:10,895 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:10,896 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] [2020-12-23 11:20:10,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 11:20:10,896 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1876446736, now seen corresponding path program 1 times [2020-12-23 11:20:10,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:10,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208126749] [2020-12-23 11:20:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:11,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208126749] [2020-12-23 11:20:11,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:11,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:20:11,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039505002] [2020-12-23 11:20:11,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:20:11,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:20:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:20:11,045 INFO L87 Difference]: Start difference. First operand 825 states and 1240 transitions. Second operand 6 states. [2020-12-23 11:20:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:11,452 INFO L93 Difference]: Finished difference Result 2251 states and 3445 transitions. [2020-12-23 11:20:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:20:11,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-12-23 11:20:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:11,462 INFO L225 Difference]: With dead ends: 2251 [2020-12-23 11:20:11,463 INFO L226 Difference]: Without dead ends: 1495 [2020-12-23 11:20:11,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:20:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2020-12-23 11:20:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1493. [2020-12-23 11:20:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2020-12-23 11:20:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2267 transitions. [2020-12-23 11:20:11,590 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2267 transitions. Word has length 113 [2020-12-23 11:20:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:11,591 INFO L481 AbstractCegarLoop]: Abstraction has 1493 states and 2267 transitions. [2020-12-23 11:20:11,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:20:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2267 transitions. [2020-12-23 11:20:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-23 11:20:11,593 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:11,594 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] [2020-12-23 11:20:11,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 11:20:11,594 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash 280743296, now seen corresponding path program 1 times [2020-12-23 11:20:11,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:11,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122776962] [2020-12-23 11:20:11,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:11,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122776962] [2020-12-23 11:20:11,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:11,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:20:11,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580158795] [2020-12-23 11:20:11,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:20:11,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:11,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:20:11,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:20:11,764 INFO L87 Difference]: Start difference. First operand 1493 states and 2267 transitions. Second operand 6 states. [2020-12-23 11:20:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:12,263 INFO L93 Difference]: Finished difference Result 4099 states and 6291 transitions. [2020-12-23 11:20:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:20:12,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2020-12-23 11:20:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:12,279 INFO L225 Difference]: With dead ends: 4099 [2020-12-23 11:20:12,279 INFO L226 Difference]: Without dead ends: 2687 [2020-12-23 11:20:12,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:20:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2020-12-23 11:20:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2685. [2020-12-23 11:20:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2020-12-23 11:20:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 4090 transitions. [2020-12-23 11:20:12,482 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 4090 transitions. Word has length 114 [2020-12-23 11:20:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:12,483 INFO L481 AbstractCegarLoop]: Abstraction has 2685 states and 4090 transitions. [2020-12-23 11:20:12,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:20:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 4090 transitions. [2020-12-23 11:20:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:20:12,485 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:12,486 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] [2020-12-23 11:20:12,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 11:20:12,486 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:12,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1479037516, now seen corresponding path program 1 times [2020-12-23 11:20:12,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:12,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721591341] [2020-12-23 11:20:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:12,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721591341] [2020-12-23 11:20:12,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:12,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:20:12,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473364806] [2020-12-23 11:20:12,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:20:12,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:12,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:20:12,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:20:12,668 INFO L87 Difference]: Start difference. First operand 2685 states and 4090 transitions. Second operand 5 states. [2020-12-23 11:20:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:13,077 INFO L93 Difference]: Finished difference Result 5305 states and 8113 transitions. [2020-12-23 11:20:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:20:13,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2020-12-23 11:20:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:13,093 INFO L225 Difference]: With dead ends: 5305 [2020-12-23 11:20:13,093 INFO L226 Difference]: Without dead ends: 2685 [2020-12-23 11:20:13,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:20:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2020-12-23 11:20:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2020-12-23 11:20:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2020-12-23 11:20:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 4057 transitions. [2020-12-23 11:20:13,334 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 4057 transitions. Word has length 115 [2020-12-23 11:20:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:13,335 INFO L481 AbstractCegarLoop]: Abstraction has 2685 states and 4057 transitions. [2020-12-23 11:20:13,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:20:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 4057 transitions. [2020-12-23 11:20:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:20:13,337 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:13,338 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] [2020-12-23 11:20:13,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 11:20:13,338 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash -313559600, now seen corresponding path program 1 times [2020-12-23 11:20:13,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:13,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889238245] [2020-12-23 11:20:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:13,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889238245] [2020-12-23 11:20:13,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:13,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:20:13,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885154508] [2020-12-23 11:20:13,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:20:13,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:20:13,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:20:13,449 INFO L87 Difference]: Start difference. First operand 2685 states and 4057 transitions. Second operand 5 states. [2020-12-23 11:20:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:14,046 INFO L93 Difference]: Finished difference Result 5309 states and 8052 transitions. [2020-12-23 11:20:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:20:14,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2020-12-23 11:20:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:14,064 INFO L225 Difference]: With dead ends: 5309 [2020-12-23 11:20:14,065 INFO L226 Difference]: Without dead ends: 2685 [2020-12-23 11:20:14,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:20:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2020-12-23 11:20:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2020-12-23 11:20:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2020-12-23 11:20:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 4024 transitions. [2020-12-23 11:20:14,309 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 4024 transitions. Word has length 116 [2020-12-23 11:20:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:14,310 INFO L481 AbstractCegarLoop]: Abstraction has 2685 states and 4024 transitions. [2020-12-23 11:20:14,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:20:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 4024 transitions. [2020-12-23 11:20:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:20:14,313 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:14,313 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] [2020-12-23 11:20:14,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 11:20:14,314 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash 804140096, now seen corresponding path program 1 times [2020-12-23 11:20:14,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:14,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115363098] [2020-12-23 11:20:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:14,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115363098] [2020-12-23 11:20:14,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:14,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:20:14,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535590055] [2020-12-23 11:20:14,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:20:14,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:14,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:20:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:20:14,610 INFO L87 Difference]: Start difference. First operand 2685 states and 4024 transitions. Second operand 9 states. [2020-12-23 11:20:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:17,001 INFO L93 Difference]: Finished difference Result 20753 states and 31348 transitions. [2020-12-23 11:20:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:20:17,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2020-12-23 11:20:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:17,090 INFO L225 Difference]: With dead ends: 20753 [2020-12-23 11:20:17,090 INFO L226 Difference]: Without dead ends: 18351 [2020-12-23 11:20:17,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:20:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18351 states. [2020-12-23 11:20:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18351 to 3912. [2020-12-23 11:20:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3912 states. [2020-12-23 11:20:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5888 transitions. [2020-12-23 11:20:17,829 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5888 transitions. Word has length 117 [2020-12-23 11:20:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:17,830 INFO L481 AbstractCegarLoop]: Abstraction has 3912 states and 5888 transitions. [2020-12-23 11:20:17,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:20:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5888 transitions. [2020-12-23 11:20:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:20:17,833 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:17,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:20:17,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 11:20:17,834 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash 435341244, now seen corresponding path program 1 times [2020-12-23 11:20:17,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:17,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341219617] [2020-12-23 11:20:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:18,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341219617] [2020-12-23 11:20:18,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:18,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:20:18,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536325539] [2020-12-23 11:20:18,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:20:18,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:20:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:20:18,071 INFO L87 Difference]: Start difference. First operand 3912 states and 5888 transitions. Second operand 9 states. [2020-12-23 11:20:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:20,905 INFO L93 Difference]: Finished difference Result 21869 states and 33048 transitions. [2020-12-23 11:20:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:20:20,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2020-12-23 11:20:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:20,957 INFO L225 Difference]: With dead ends: 21869 [2020-12-23 11:20:20,958 INFO L226 Difference]: Without dead ends: 19467 [2020-12-23 11:20:20,967 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 [2020-12-23 11:20:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19467 states. [2020-12-23 11:20:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19467 to 6508. [2020-12-23 11:20:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6508 states. [2020-12-23 11:20:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 9836 transitions. [2020-12-23 11:20:22,160 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 9836 transitions. Word has length 117 [2020-12-23 11:20:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:22,161 INFO L481 AbstractCegarLoop]: Abstraction has 6508 states and 9836 transitions. [2020-12-23 11:20:22,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:20:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 9836 transitions. [2020-12-23 11:20:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:20:22,164 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:22,165 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] [2020-12-23 11:20:22,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 11:20:22,165 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash 433127764, now seen corresponding path program 1 times [2020-12-23 11:20:22,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:22,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149742146] [2020-12-23 11:20:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:22,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149742146] [2020-12-23 11:20:22,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:22,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:20:22,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028765934] [2020-12-23 11:20:22,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:20:22,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:20:22,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:20:22,384 INFO L87 Difference]: Start difference. First operand 6508 states and 9836 transitions. Second operand 9 states. [2020-12-23 11:20:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:25,595 INFO L93 Difference]: Finished difference Result 23019 states and 34800 transitions. [2020-12-23 11:20:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:20:25,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2020-12-23 11:20:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:25,641 INFO L225 Difference]: With dead ends: 23019 [2020-12-23 11:20:25,641 INFO L226 Difference]: Without dead ends: 20617 [2020-12-23 11:20:25,649 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 [2020-12-23 11:20:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20617 states. [2020-12-23 11:20:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20617 to 7818. [2020-12-23 11:20:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7818 states. [2020-12-23 11:20:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7818 states to 7818 states and 11828 transitions. [2020-12-23 11:20:26,887 INFO L78 Accepts]: Start accepts. Automaton has 7818 states and 11828 transitions. Word has length 117 [2020-12-23 11:20:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:26,887 INFO L481 AbstractCegarLoop]: Abstraction has 7818 states and 11828 transitions. [2020-12-23 11:20:26,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:20:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7818 states and 11828 transitions. [2020-12-23 11:20:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:20:26,891 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:26,892 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] [2020-12-23 11:20:26,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 11:20:26,892 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1843774360, now seen corresponding path program 1 times [2020-12-23 11:20:26,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:26,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622769297] [2020-12-23 11:20:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:27,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622769297] [2020-12-23 11:20:27,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:27,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:20:27,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617134242] [2020-12-23 11:20:27,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:20:27,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:20:27,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:20:27,108 INFO L87 Difference]: Start difference. First operand 7818 states and 11828 transitions. Second operand 9 states. [2020-12-23 11:20:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:30,444 INFO L93 Difference]: Finished difference Result 23993 states and 36278 transitions. [2020-12-23 11:20:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:20:30,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2020-12-23 11:20:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:30,501 INFO L225 Difference]: With dead ends: 23993 [2020-12-23 11:20:30,501 INFO L226 Difference]: Without dead ends: 21591 [2020-12-23 11:20:30,512 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 [2020-12-23 11:20:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21591 states. [2020-12-23 11:20:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21591 to 9074. [2020-12-23 11:20:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2020-12-23 11:20:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 13736 transitions. [2020-12-23 11:20:31,928 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 13736 transitions. Word has length 117 [2020-12-23 11:20:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:31,928 INFO L481 AbstractCegarLoop]: Abstraction has 9074 states and 13736 transitions. [2020-12-23 11:20:31,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:20:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 13736 transitions. [2020-12-23 11:20:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:20:31,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:31,932 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] [2020-12-23 11:20:31,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 11:20:31,933 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:31,934 INFO L82 PathProgramCache]: Analyzing trace with hash 202891668, now seen corresponding path program 1 times [2020-12-23 11:20:31,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:31,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301704194] [2020-12-23 11:20:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:32,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301704194] [2020-12-23 11:20:32,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:32,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:20:32,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57262062] [2020-12-23 11:20:32,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:20:32,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:20:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:20:32,120 INFO L87 Difference]: Start difference. First operand 9074 states and 13736 transitions. Second operand 9 states. [2020-12-23 11:20:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:35,418 INFO L93 Difference]: Finished difference Result 25071 states and 37916 transitions. [2020-12-23 11:20:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:20:35,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2020-12-23 11:20:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:35,462 INFO L225 Difference]: With dead ends: 25071 [2020-12-23 11:20:35,462 INFO L226 Difference]: Without dead ends: 22669 [2020-12-23 11:20:35,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:20:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22669 states. [2020-12-23 11:20:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22669 to 10314. [2020-12-23 11:20:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10314 states. [2020-12-23 11:20:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10314 states to 10314 states and 15616 transitions. [2020-12-23 11:20:37,437 INFO L78 Accepts]: Start accepts. Automaton has 10314 states and 15616 transitions. Word has length 117 [2020-12-23 11:20:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:37,437 INFO L481 AbstractCegarLoop]: Abstraction has 10314 states and 15616 transitions. [2020-12-23 11:20:37,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:20:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 10314 states and 15616 transitions. [2020-12-23 11:20:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:20:37,443 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:37,443 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] [2020-12-23 11:20:37,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 11:20:37,443 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1380438633, now seen corresponding path program 1 times [2020-12-23 11:20:37,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:37,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615131948] [2020-12-23 11:20:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:37,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615131948] [2020-12-23 11:20:37,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:37,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:20:37,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55839019] [2020-12-23 11:20:37,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:20:37,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:37,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:20:37,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:20:37,538 INFO L87 Difference]: Start difference. First operand 10314 states and 15616 transitions. Second operand 3 states. [2020-12-23 11:20:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:40,016 INFO L93 Difference]: Finished difference Result 27502 states and 41714 transitions. [2020-12-23 11:20:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:20:40,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2020-12-23 11:20:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:40,042 INFO L225 Difference]: With dead ends: 27502 [2020-12-23 11:20:40,042 INFO L226 Difference]: Without dead ends: 17708 [2020-12-23 11:20:40,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:20:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17708 states. [2020-12-23 11:20:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17708 to 17706. [2020-12-23 11:20:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17706 states. [2020-12-23 11:20:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17706 states to 17706 states and 26624 transitions. [2020-12-23 11:20:42,739 INFO L78 Accepts]: Start accepts. Automaton has 17706 states and 26624 transitions. Word has length 117 [2020-12-23 11:20:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:42,739 INFO L481 AbstractCegarLoop]: Abstraction has 17706 states and 26624 transitions. [2020-12-23 11:20:42,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:20:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 17706 states and 26624 transitions. [2020-12-23 11:20:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:20:42,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:42,745 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] [2020-12-23 11:20:42,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 11:20:42,745 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1623562984, now seen corresponding path program 1 times [2020-12-23 11:20:42,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:42,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852358409] [2020-12-23 11:20:42,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:42,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852358409] [2020-12-23 11:20:42,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:42,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:20:42,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76031280] [2020-12-23 11:20:42,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:20:42,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:42,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:20:42,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:20:42,813 INFO L87 Difference]: Start difference. First operand 17706 states and 26624 transitions. Second operand 3 states. [2020-12-23 11:20:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:20:47,713 INFO L93 Difference]: Finished difference Result 50670 states and 76002 transitions. [2020-12-23 11:20:47,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:20:47,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2020-12-23 11:20:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:20:47,753 INFO L225 Difference]: With dead ends: 50670 [2020-12-23 11:20:47,753 INFO L226 Difference]: Without dead ends: 33484 [2020-12-23 11:20:47,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:20:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33484 states. [2020-12-23 11:20:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33484 to 33482. [2020-12-23 11:20:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33482 states. [2020-12-23 11:20:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33482 states to 33482 states and 49712 transitions. [2020-12-23 11:20:53,066 INFO L78 Accepts]: Start accepts. Automaton has 33482 states and 49712 transitions. Word has length 117 [2020-12-23 11:20:53,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:20:53,067 INFO L481 AbstractCegarLoop]: Abstraction has 33482 states and 49712 transitions. [2020-12-23 11:20:53,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:20:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 33482 states and 49712 transitions. [2020-12-23 11:20:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:20:53,072 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:20:53,072 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] [2020-12-23 11:20:53,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 11:20:53,073 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:20:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:20:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash -475226918, now seen corresponding path program 1 times [2020-12-23 11:20:53,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:20:53,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652676740] [2020-12-23 11:20:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:20:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:20:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:20:53,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652676740] [2020-12-23 11:20:53,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:20:53,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:20:53,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845578772] [2020-12-23 11:20:53,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:20:53,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:20:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:20:53,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:20:53,409 INFO L87 Difference]: Start difference. First operand 33482 states and 49712 transitions. Second operand 9 states. [2020-12-23 11:21:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:21:05,335 INFO L93 Difference]: Finished difference Result 80393 states and 119542 transitions. [2020-12-23 11:21:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:21:05,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2020-12-23 11:21:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:21:05,414 INFO L225 Difference]: With dead ends: 80393 [2020-12-23 11:21:05,414 INFO L226 Difference]: Without dead ends: 73399 [2020-12-23 11:21:05,438 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 [2020-12-23 11:21:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73399 states. [2020-12-23 11:21:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73399 to 38202. [2020-12-23 11:21:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38202 states. [2020-12-23 11:21:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38202 states to 38202 states and 56720 transitions. [2020-12-23 11:21:11,971 INFO L78 Accepts]: Start accepts. Automaton has 38202 states and 56720 transitions. Word has length 117 [2020-12-23 11:21:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:21:11,971 INFO L481 AbstractCegarLoop]: Abstraction has 38202 states and 56720 transitions. [2020-12-23 11:21:11,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:21:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 38202 states and 56720 transitions. [2020-12-23 11:21:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:21:11,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:21:11,977 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] [2020-12-23 11:21:11,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 11:21:11,977 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:21:11,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:21:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash -876282968, now seen corresponding path program 1 times [2020-12-23 11:21:11,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:21:11,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755589679] [2020-12-23 11:21:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:21:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:21:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:21:12,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755589679] [2020-12-23 11:21:12,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:21:12,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:21:12,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305736941] [2020-12-23 11:21:12,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:21:12,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:21:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:21:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:21:12,189 INFO L87 Difference]: Start difference. First operand 38202 states and 56720 transitions. Second operand 9 states. [2020-12-23 11:21:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:21:26,434 INFO L93 Difference]: Finished difference Result 86085 states and 128008 transitions. [2020-12-23 11:21:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:21:26,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2020-12-23 11:21:26,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:21:26,526 INFO L225 Difference]: With dead ends: 86085 [2020-12-23 11:21:26,526 INFO L226 Difference]: Without dead ends: 79091 [2020-12-23 11:21:26,550 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 [2020-12-23 11:21:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79091 states. [2020-12-23 11:21:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79091 to 42956. [2020-12-23 11:21:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42956 states. [2020-12-23 11:21:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42956 states to 42956 states and 63780 transitions. [2020-12-23 11:21:34,048 INFO L78 Accepts]: Start accepts. Automaton has 42956 states and 63780 transitions. Word has length 117 [2020-12-23 11:21:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:21:34,048 INFO L481 AbstractCegarLoop]: Abstraction has 42956 states and 63780 transitions. [2020-12-23 11:21:34,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:21:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 42956 states and 63780 transitions. [2020-12-23 11:21:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 11:21:34,055 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:21:34,055 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] [2020-12-23 11:21:34,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 11:21:34,055 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:21:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:21:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash 154166167, now seen corresponding path program 1 times [2020-12-23 11:21:34,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:21:34,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178884460] [2020-12-23 11:21:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:21:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:21:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:21:34,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178884460] [2020-12-23 11:21:34,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:21:34,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:21:34,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720960642] [2020-12-23 11:21:34,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:21:34,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:21:34,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:21:34,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:21:34,173 INFO L87 Difference]: Start difference. First operand 42956 states and 63780 transitions. Second operand 5 states. [2020-12-23 11:21:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:21:47,333 INFO L93 Difference]: Finished difference Result 73510 states and 109117 transitions. [2020-12-23 11:21:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:21:47,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2020-12-23 11:21:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:21:47,415 INFO L225 Difference]: With dead ends: 73510 [2020-12-23 11:21:47,415 INFO L226 Difference]: Without dead ends: 73508 [2020-12-23 11:21:47,430 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 [2020-12-23 11:21:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73508 states. [2020-12-23 11:21:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73508 to 43212. [2020-12-23 11:21:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43212 states. [2020-12-23 11:21:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43212 states to 43212 states and 63892 transitions. [2020-12-23 11:21:55,689 INFO L78 Accepts]: Start accepts. Automaton has 43212 states and 63892 transitions. Word has length 118 [2020-12-23 11:21:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:21:55,689 INFO L481 AbstractCegarLoop]: Abstraction has 43212 states and 63892 transitions. [2020-12-23 11:21:55,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:21:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 43212 states and 63892 transitions. [2020-12-23 11:21:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 11:21:55,695 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:21:55,695 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] [2020-12-23 11:21:55,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 11:21:55,696 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:21:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:21:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1441850003, now seen corresponding path program 1 times [2020-12-23 11:21:55,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:21:55,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193761909] [2020-12-23 11:21:55,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:21:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:21:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:21:55,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193761909] [2020-12-23 11:21:55,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:21:55,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:21:55,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651658615] [2020-12-23 11:21:55,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:21:55,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:21:55,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:21:55,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:21:55,997 INFO L87 Difference]: Start difference. First operand 43212 states and 63892 transitions. Second operand 10 states. [2020-12-23 11:21:56,498 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2020-12-23 11:22:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:14,941 INFO L93 Difference]: Finished difference Result 130343 states and 192230 transitions. [2020-12-23 11:22:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:22:14,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 118 [2020-12-23 11:22:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:15,043 INFO L225 Difference]: With dead ends: 130343 [2020-12-23 11:22:15,043 INFO L226 Difference]: Without dead ends: 87361 [2020-12-23 11:22:15,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-12-23 11:22:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87361 states. [2020-12-23 11:22:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87361 to 43212. [2020-12-23 11:22:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43212 states. [2020-12-23 11:22:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43212 states to 43212 states and 63886 transitions. [2020-12-23 11:22:24,430 INFO L78 Accepts]: Start accepts. Automaton has 43212 states and 63886 transitions. Word has length 118 [2020-12-23 11:22:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:24,431 INFO L481 AbstractCegarLoop]: Abstraction has 43212 states and 63886 transitions. [2020-12-23 11:22:24,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:22:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 43212 states and 63886 transitions. [2020-12-23 11:22:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 11:22:24,436 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:24,436 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] [2020-12-23 11:22:24,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 11:22:24,436 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1556230175, now seen corresponding path program 1 times [2020-12-23 11:22:24,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:24,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776648076] [2020-12-23 11:22:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:24,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776648076] [2020-12-23 11:22:24,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:24,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:22:24,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612927523] [2020-12-23 11:22:24,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:22:24,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:24,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:22:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:22:24,744 INFO L87 Difference]: Start difference. First operand 43212 states and 63886 transitions. Second operand 10 states. [2020-12-23 11:22:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:40,200 INFO L93 Difference]: Finished difference Result 108259 states and 159753 transitions. [2020-12-23 11:22:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:22:40,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2020-12-23 11:22:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:40,271 INFO L225 Difference]: With dead ends: 108259 [2020-12-23 11:22:40,271 INFO L226 Difference]: Without dead ends: 65262 [2020-12-23 11:22:40,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-12-23 11:22:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65262 states. [2020-12-23 11:22:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65262 to 43212. [2020-12-23 11:22:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43212 states. [2020-12-23 11:22:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43212 states to 43212 states and 63883 transitions. [2020-12-23 11:22:50,115 INFO L78 Accepts]: Start accepts. Automaton has 43212 states and 63883 transitions. Word has length 119 [2020-12-23 11:22:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:50,115 INFO L481 AbstractCegarLoop]: Abstraction has 43212 states and 63883 transitions. [2020-12-23 11:22:50,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:22:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 43212 states and 63883 transitions. [2020-12-23 11:22:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 11:22:50,120 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:50,120 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] [2020-12-23 11:22:50,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 11:22:50,121 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:50,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash 510358621, now seen corresponding path program 1 times [2020-12-23 11:22:50,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:50,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823870030] [2020-12-23 11:22:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:50,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823870030] [2020-12-23 11:22:50,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:50,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 11:22:50,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460248514] [2020-12-23 11:22:50,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:22:50,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:50,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:22:50,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:22:50,457 INFO L87 Difference]: Start difference. First operand 43212 states and 63883 transitions. Second operand 9 states. [2020-12-23 11:23:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:06,949 INFO L93 Difference]: Finished difference Result 107383 states and 158721 transitions. [2020-12-23 11:23:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:23:06,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2020-12-23 11:23:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:07,021 INFO L225 Difference]: With dead ends: 107383 [2020-12-23 11:23:07,021 INFO L226 Difference]: Without dead ends: 64521 [2020-12-23 11:23:07,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-23 11:23:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64521 states. [2020-12-23 11:23:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64521 to 43047. [2020-12-23 11:23:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43047 states. [2020-12-23 11:23:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43047 states to 43047 states and 63633 transitions. [2020-12-23 11:23:17,766 INFO L78 Accepts]: Start accepts. Automaton has 43047 states and 63633 transitions. Word has length 119 [2020-12-23 11:23:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:17,766 INFO L481 AbstractCegarLoop]: Abstraction has 43047 states and 63633 transitions. [2020-12-23 11:23:17,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:23:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 43047 states and 63633 transitions. [2020-12-23 11:23:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 11:23:17,769 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:17,770 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] [2020-12-23 11:23:17,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 11:23:17,770 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1770166343, now seen corresponding path program 1 times [2020-12-23 11:23:17,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:17,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864403379] [2020-12-23 11:23:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:18,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864403379] [2020-12-23 11:23:18,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:18,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:23:18,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376760222] [2020-12-23 11:23:18,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:23:18,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:18,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:23:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:23:18,045 INFO L87 Difference]: Start difference. First operand 43047 states and 63633 transitions. Second operand 10 states. [2020-12-23 11:23:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:41,547 INFO L93 Difference]: Finished difference Result 129838 states and 191454 transitions. [2020-12-23 11:23:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:23:41,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2020-12-23 11:23:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:41,649 INFO L225 Difference]: With dead ends: 129838 [2020-12-23 11:23:41,649 INFO L226 Difference]: Without dead ends: 87070 [2020-12-23 11:23:41,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2020-12-23 11:23:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87070 states. [2020-12-23 11:23:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87070 to 43047. [2020-12-23 11:23:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43047 states. [2020-12-23 11:23:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43047 states to 43047 states and 63627 transitions. [2020-12-23 11:23:53,106 INFO L78 Accepts]: Start accepts. Automaton has 43047 states and 63627 transitions. Word has length 120 [2020-12-23 11:23:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:53,107 INFO L481 AbstractCegarLoop]: Abstraction has 43047 states and 63627 transitions. [2020-12-23 11:23:53,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:23:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 43047 states and 63627 transitions. [2020-12-23 11:23:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 11:23:53,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:53,110 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] [2020-12-23 11:23:53,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 11:23:53,111 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash -863997056, now seen corresponding path program 1 times [2020-12-23 11:23:53,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:53,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925849893] [2020-12-23 11:23:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:53,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925849893] [2020-12-23 11:23:53,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:53,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:23:53,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111401572] [2020-12-23 11:23:53,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:23:53,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:53,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:23:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:23:53,380 INFO L87 Difference]: Start difference. First operand 43047 states and 63627 transitions. Second operand 10 states.