java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:09:42,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:09:42,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:09:42,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:09:42,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:09:42,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:09:42,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:09:42,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:09:42,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:09:42,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:09:42,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:09:42,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:09:42,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:09:42,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:09:42,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:09:42,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:09:42,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:09:42,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:09:42,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:09:42,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:09:42,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:09:42,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:09:42,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:09:42,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:09:42,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:09:42,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:09:42,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:09:42,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:09:42,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:09:42,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:09:42,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:09:42,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:09:42,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:09:42,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:09:42,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:09:42,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:09:42,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:09:42,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:09:42,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:09:42,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:09:42,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:09:42,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 08:09:42,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:09:42,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:09:42,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:09:42,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:09:42,948 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:09:42,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:09:42,948 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:09:42,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:09:42,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:09:42,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:09:42,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:09:42,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:09:42,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:09:42,951 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:09:42,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:09:42,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:09:42,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:09:42,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:09:42,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:09:42,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:09:42,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:09:42,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:09:42,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:09:42,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:09:42,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:09:42,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:09:42,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:09:42,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:09:42,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:09:43,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:09:43,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:09:43,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:09:43,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:09:43,023 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:09:43,024 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:09:43,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb9e968e/45acce5627fa4f2faf8d9b95c9de551d/FLAG39e14dbfb [2019-09-08 08:09:43,610 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:09:43,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:09:43,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb9e968e/45acce5627fa4f2faf8d9b95c9de551d/FLAG39e14dbfb [2019-09-08 08:09:43,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb9e968e/45acce5627fa4f2faf8d9b95c9de551d [2019-09-08 08:09:43,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:09:43,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:09:43,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:09:43,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:09:43,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:09:43,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:09:43" (1/1) ... [2019-09-08 08:09:43,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2740f976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:43, skipping insertion in model container [2019-09-08 08:09:43,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:09:43" (1/1) ... [2019-09-08 08:09:43,999 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:09:44,068 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:09:44,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:09:44,502 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:09:44,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:09:44,600 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:09:44,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44 WrapperNode [2019-09-08 08:09:44,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:09:44,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:09:44,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:09:44,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:09:44,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (1/1) ... [2019-09-08 08:09:44,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (1/1) ... [2019-09-08 08:09:44,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (1/1) ... [2019-09-08 08:09:44,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (1/1) ... [2019-09-08 08:09:44,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (1/1) ... [2019-09-08 08:09:44,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (1/1) ... [2019-09-08 08:09:44,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (1/1) ... [2019-09-08 08:09:44,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:09:44,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:09:44,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:09:44,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:09:44,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-09-08 08:09:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:09:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:09:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:09:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:09:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:09:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:09:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 08:09:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-08 08:09:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-08 08:09:44,738 INFO L138 BoogieDeclarations]: Found implementation of procedure node8 [2019-09-08 08:09:44,738 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:09:44,738 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:09:44,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:09:44,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:09:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:09:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:09:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:09:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:09:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:09:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:09:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:09:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:09:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:09:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:09:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:09:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:09:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 08:09:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 08:09:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 08:09:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 08:09:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:09:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:09:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:09:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:09:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:09:45,717 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:09:45,717 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:09:45,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:09:45 BoogieIcfgContainer [2019-09-08 08:09:45,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:09:45,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:09:45,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:09:45,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:09:45,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:09:43" (1/3) ... [2019-09-08 08:09:45,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b38878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:09:45, skipping insertion in model container [2019-09-08 08:09:45,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:09:44" (2/3) ... [2019-09-08 08:09:45,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b38878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:09:45, skipping insertion in model container [2019-09-08 08:09:45,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:09:45" (3/3) ... [2019-09-08 08:09:45,729 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:09:45,740 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:09:45,750 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:09:45,766 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:09:45,794 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:09:45,795 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:09:45,795 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:09:45,795 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:09:45,796 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:09:45,796 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:09:45,796 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:09:45,796 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:09:45,796 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:09:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2019-09-08 08:09:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 08:09:45,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:09:45,835 INFO L399 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] [2019-09-08 08:09:45,838 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:09:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:09:45,843 INFO L82 PathProgramCache]: Analyzing trace with hash 357919930, now seen corresponding path program 1 times [2019-09-08 08:09:45,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:09:45,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:09:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:45,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:09:46,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:09:46,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:09:46,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:09:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:09:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:09:46,345 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 5 states. [2019-09-08 08:09:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:09:46,511 INFO L93 Difference]: Finished difference Result 298 states and 455 transitions. [2019-09-08 08:09:46,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:09:46,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 08:09:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:09:46,529 INFO L225 Difference]: With dead ends: 298 [2019-09-08 08:09:46,529 INFO L226 Difference]: Without dead ends: 181 [2019-09-08 08:09:46,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:09:46,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-08 08:09:46,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-09-08 08:09:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-08 08:09:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2019-09-08 08:09:46,630 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 82 [2019-09-08 08:09:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:09:46,630 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2019-09-08 08:09:46,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:09:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2019-09-08 08:09:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 08:09:46,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:09:46,642 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:09:46,642 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:09:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:09:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1821959882, now seen corresponding path program 1 times [2019-09-08 08:09:46,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:09:46,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:09:46,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:46,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:46,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:09:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:09:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 08:09:47,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 08:09:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 08:09:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-08 08:09:47,489 INFO L87 Difference]: Start difference. First operand 181 states and 226 transitions. Second operand 19 states. [2019-09-08 08:10:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:03,986 INFO L93 Difference]: Finished difference Result 2566 states and 4017 transitions. [2019-09-08 08:10:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 08:10:03,987 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 142 [2019-09-08 08:10:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:04,040 INFO L225 Difference]: With dead ends: 2566 [2019-09-08 08:10:04,040 INFO L226 Difference]: Without dead ends: 2458 [2019-09-08 08:10:04,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4736 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2532, Invalid=9240, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 08:10:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2019-09-08 08:10:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 1279. [2019-09-08 08:10:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-09-08 08:10:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1833 transitions. [2019-09-08 08:10:04,275 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1833 transitions. Word has length 142 [2019-09-08 08:10:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:04,276 INFO L475 AbstractCegarLoop]: Abstraction has 1279 states and 1833 transitions. [2019-09-08 08:10:04,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 08:10:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1833 transitions. [2019-09-08 08:10:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:04,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:04,282 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:04,283 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:04,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1674186694, now seen corresponding path program 1 times [2019-09-08 08:10:04,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:04,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:04,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:04,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:04,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:10:04,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:10:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:10:04,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:10:04,400 INFO L87 Difference]: Start difference. First operand 1279 states and 1833 transitions. Second operand 3 states. [2019-09-08 08:10:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:04,548 INFO L93 Difference]: Finished difference Result 3623 states and 5275 transitions. [2019-09-08 08:10:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:10:04,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 08:10:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:04,569 INFO L225 Difference]: With dead ends: 3623 [2019-09-08 08:10:04,569 INFO L226 Difference]: Without dead ends: 2417 [2019-09-08 08:10:04,576 INFO L628 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 [2019-09-08 08:10:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-09-08 08:10:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2415. [2019-09-08 08:10:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2019-09-08 08:10:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 3473 transitions. [2019-09-08 08:10:04,774 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 3473 transitions. Word has length 144 [2019-09-08 08:10:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:04,776 INFO L475 AbstractCegarLoop]: Abstraction has 2415 states and 3473 transitions. [2019-09-08 08:10:04,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:10:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 3473 transitions. [2019-09-08 08:10:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:04,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:04,780 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:04,780 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1333078146, now seen corresponding path program 1 times [2019-09-08 08:10:04,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:04,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:04,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:04,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:05,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:05,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:05,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:05,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:05,013 INFO L87 Difference]: Start difference. First operand 2415 states and 3473 transitions. Second operand 5 states. [2019-09-08 08:10:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:06,044 INFO L93 Difference]: Finished difference Result 6033 states and 8732 transitions. [2019-09-08 08:10:06,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:06,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:10:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:06,086 INFO L225 Difference]: With dead ends: 6033 [2019-09-08 08:10:06,086 INFO L226 Difference]: Without dead ends: 3691 [2019-09-08 08:10:06,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:10:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2019-09-08 08:10:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3689. [2019-09-08 08:10:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3689 states. [2019-09-08 08:10:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 5268 transitions. [2019-09-08 08:10:06,384 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 5268 transitions. Word has length 144 [2019-09-08 08:10:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:06,385 INFO L475 AbstractCegarLoop]: Abstraction has 3689 states and 5268 transitions. [2019-09-08 08:10:06,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 5268 transitions. [2019-09-08 08:10:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:06,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:06,390 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:06,390 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1174604620, now seen corresponding path program 1 times [2019-09-08 08:10:06,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:06,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:06,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:06,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:06,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:06,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:06,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:06,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:06,589 INFO L87 Difference]: Start difference. First operand 3689 states and 5268 transitions. Second operand 5 states. [2019-09-08 08:10:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:07,844 INFO L93 Difference]: Finished difference Result 10714 states and 15388 transitions. [2019-09-08 08:10:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:07,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:10:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:07,891 INFO L225 Difference]: With dead ends: 10714 [2019-09-08 08:10:07,891 INFO L226 Difference]: Without dead ends: 7098 [2019-09-08 08:10:07,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:10:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7098 states. [2019-09-08 08:10:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7098 to 7096. [2019-09-08 08:10:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7096 states. [2019-09-08 08:10:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 10096 transitions. [2019-09-08 08:10:08,305 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 10096 transitions. Word has length 144 [2019-09-08 08:10:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:08,305 INFO L475 AbstractCegarLoop]: Abstraction has 7096 states and 10096 transitions. [2019-09-08 08:10:08,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 10096 transitions. [2019-09-08 08:10:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:08,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:08,309 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:08,309 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:08,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:08,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1749919806, now seen corresponding path program 1 times [2019-09-08 08:10:08,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:08,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:08,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:08,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:08,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:08,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:08,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:08,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:08,488 INFO L87 Difference]: Start difference. First operand 7096 states and 10096 transitions. Second operand 5 states. [2019-09-08 08:10:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:09,907 INFO L93 Difference]: Finished difference Result 20728 states and 29602 transitions. [2019-09-08 08:10:09,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:09,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:10:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:10,006 INFO L225 Difference]: With dead ends: 20728 [2019-09-08 08:10:10,006 INFO L226 Difference]: Without dead ends: 13705 [2019-09-08 08:10:10,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:10:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13705 states. [2019-09-08 08:10:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13705 to 13703. [2019-09-08 08:10:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13703 states. [2019-09-08 08:10:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13703 states to 13703 states and 19392 transitions. [2019-09-08 08:10:11,003 INFO L78 Accepts]: Start accepts. Automaton has 13703 states and 19392 transitions. Word has length 144 [2019-09-08 08:10:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:11,003 INFO L475 AbstractCegarLoop]: Abstraction has 13703 states and 19392 transitions. [2019-09-08 08:10:11,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13703 states and 19392 transitions. [2019-09-08 08:10:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:11,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:11,006 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:11,007 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:11,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:11,007 INFO L82 PathProgramCache]: Analyzing trace with hash 897967886, now seen corresponding path program 1 times [2019-09-08 08:10:11,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:11,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:11,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:11,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:11,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:11,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:11,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:11,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:11,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:11,151 INFO L87 Difference]: Start difference. First operand 13703 states and 19392 transitions. Second operand 5 states. [2019-09-08 08:10:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:13,205 INFO L93 Difference]: Finished difference Result 40099 states and 56926 transitions. [2019-09-08 08:10:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:13,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:10:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:13,324 INFO L225 Difference]: With dead ends: 40099 [2019-09-08 08:10:13,324 INFO L226 Difference]: Without dead ends: 26469 [2019-09-08 08:10:13,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:10:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26469 states. [2019-09-08 08:10:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26469 to 26467. [2019-09-08 08:10:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26467 states. [2019-09-08 08:10:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26467 states to 26467 states and 37246 transitions. [2019-09-08 08:10:14,867 INFO L78 Accepts]: Start accepts. Automaton has 26467 states and 37246 transitions. Word has length 144 [2019-09-08 08:10:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:14,867 INFO L475 AbstractCegarLoop]: Abstraction has 26467 states and 37246 transitions. [2019-09-08 08:10:14,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26467 states and 37246 transitions. [2019-09-08 08:10:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:14,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:14,870 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:14,871 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash -453207548, now seen corresponding path program 1 times [2019-09-08 08:10:14,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:14,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:14,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:15,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:15,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:15,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:15,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:15,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:15,095 INFO L87 Difference]: Start difference. First operand 26467 states and 37246 transitions. Second operand 5 states. [2019-09-08 08:10:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:17,424 INFO L93 Difference]: Finished difference Result 77599 states and 109432 transitions. [2019-09-08 08:10:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:17,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:10:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:17,600 INFO L225 Difference]: With dead ends: 77599 [2019-09-08 08:10:17,601 INFO L226 Difference]: Without dead ends: 51205 [2019-09-08 08:10:17,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:10:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51205 states. [2019-09-08 08:10:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51205 to 51203. [2019-09-08 08:10:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51203 states. [2019-09-08 08:10:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51203 states to 51203 states and 71562 transitions. [2019-09-08 08:10:20,914 INFO L78 Accepts]: Start accepts. Automaton has 51203 states and 71562 transitions. Word has length 144 [2019-09-08 08:10:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:20,914 INFO L475 AbstractCegarLoop]: Abstraction has 51203 states and 71562 transitions. [2019-09-08 08:10:20,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 51203 states and 71562 transitions. [2019-09-08 08:10:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:20,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:20,917 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:20,917 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1639862322, now seen corresponding path program 1 times [2019-09-08 08:10:20,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:20,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:21,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:21,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:21,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:21,044 INFO L87 Difference]: Start difference. First operand 51203 states and 71562 transitions. Second operand 5 states. [2019-09-08 08:10:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:24,443 INFO L93 Difference]: Finished difference Result 150007 states and 210124 transitions. [2019-09-08 08:10:24,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:24,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:10:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:25,438 INFO L225 Difference]: With dead ends: 150007 [2019-09-08 08:10:25,439 INFO L226 Difference]: Without dead ends: 98877 [2019-09-08 08:10:25,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:10:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98877 states. [2019-09-08 08:10:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98877 to 98875. [2019-09-08 08:10:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98875 states. [2019-09-08 08:10:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98875 states to 98875 states and 137242 transitions. [2019-09-08 08:10:32,384 INFO L78 Accepts]: Start accepts. Automaton has 98875 states and 137242 transitions. Word has length 144 [2019-09-08 08:10:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:32,385 INFO L475 AbstractCegarLoop]: Abstraction has 98875 states and 137242 transitions. [2019-09-08 08:10:32,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 98875 states and 137242 transitions. [2019-09-08 08:10:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:32,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:32,387 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:32,388 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash -392353468, now seen corresponding path program 1 times [2019-09-08 08:10:32,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:32,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:32,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:32,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:32,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:32,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:32,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:32,527 INFO L87 Difference]: Start difference. First operand 98875 states and 137242 transitions. Second operand 5 states. [2019-09-08 08:10:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:40,120 INFO L93 Difference]: Finished difference Result 289279 states and 402556 transitions. [2019-09-08 08:10:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:40,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:10:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:40,762 INFO L225 Difference]: With dead ends: 289279 [2019-09-08 08:10:40,762 INFO L226 Difference]: Without dead ends: 190477 [2019-09-08 08:10:40,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:10:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190477 states. [2019-09-08 08:10:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190477 to 190475. [2019-09-08 08:10:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190475 states. [2019-09-08 08:10:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190475 states to 190475 states and 262602 transitions. [2019-09-08 08:10:51,279 INFO L78 Accepts]: Start accepts. Automaton has 190475 states and 262602 transitions. Word has length 144 [2019-09-08 08:10:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:51,280 INFO L475 AbstractCegarLoop]: Abstraction has 190475 states and 262602 transitions. [2019-09-08 08:10:51,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 190475 states and 262602 transitions. [2019-09-08 08:10:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:10:51,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:51,282 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:51,282 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2030581618, now seen corresponding path program 1 times [2019-09-08 08:10:51,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:51,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:51,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:51,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:51,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:51,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:51,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:51,408 INFO L87 Difference]: Start difference. First operand 190475 states and 262602 transitions. Second operand 5 states. [2019-09-08 08:11:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:06,666 INFO L93 Difference]: Finished difference Result 556879 states and 769612 transitions. [2019-09-08 08:11:06,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:11:06,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:11:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:07,656 INFO L225 Difference]: With dead ends: 556879 [2019-09-08 08:11:07,656 INFO L226 Difference]: Without dead ends: 366477 [2019-09-08 08:11:07,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:11:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366477 states. [2019-09-08 08:11:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366477 to 366475. [2019-09-08 08:11:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366475 states. [2019-09-08 08:11:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366475 states to 366475 states and 501514 transitions. [2019-09-08 08:11:37,955 INFO L78 Accepts]: Start accepts. Automaton has 366475 states and 501514 transitions. Word has length 144 [2019-09-08 08:11:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:37,956 INFO L475 AbstractCegarLoop]: Abstraction has 366475 states and 501514 transitions. [2019-09-08 08:11:37,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:11:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 366475 states and 501514 transitions. [2019-09-08 08:11:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:11:37,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:37,958 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:11:37,958 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:37,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1465986242, now seen corresponding path program 1 times [2019-09-08 08:11:37,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:37,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:37,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:11:38,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:38,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 08:11:38,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 08:11:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 08:11:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-08 08:11:38,420 INFO L87 Difference]: Start difference. First operand 366475 states and 501514 transitions. Second operand 19 states. [2019-09-08 08:11:40,100 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-08 08:11:43,114 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-08 08:12:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:55,159 INFO L93 Difference]: Finished difference Result 1211181 states and 1823899 transitions. [2019-09-08 08:12:55,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 08:12:55,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2019-09-08 08:12:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:59,122 INFO L225 Difference]: With dead ends: 1211181 [2019-09-08 08:12:59,122 INFO L226 Difference]: Without dead ends: 844779 [2019-09-08 08:12:59,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4858 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2626, Invalid=9364, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 08:13:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844779 states. [2019-09-08 08:14:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844779 to 486091. [2019-09-08 08:14:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486091 states. [2019-09-08 08:14:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486091 states to 486091 states and 665674 transitions. [2019-09-08 08:14:02,164 INFO L78 Accepts]: Start accepts. Automaton has 486091 states and 665674 transitions. Word has length 144 [2019-09-08 08:14:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:02,165 INFO L475 AbstractCegarLoop]: Abstraction has 486091 states and 665674 transitions. [2019-09-08 08:14:02,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 08:14:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 486091 states and 665674 transitions. [2019-09-08 08:14:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 08:14:02,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:02,166 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:14:02,167 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash -282610142, now seen corresponding path program 1 times [2019-09-08 08:14:02,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:02,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:02,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:02,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:14:02,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:02,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:14:02,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:14:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:14:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:14:02,346 INFO L87 Difference]: Start difference. First operand 486091 states and 665674 transitions. Second operand 5 states. [2019-09-08 08:14:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:48,773 INFO L93 Difference]: Finished difference Result 1108565 states and 1522386 transitions. [2019-09-08 08:14:48,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:14:48,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-08 08:14:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:51,815 INFO L225 Difference]: With dead ends: 1108565 [2019-09-08 08:14:51,815 INFO L226 Difference]: Without dead ends: 622547 [2019-09-08 08:14:52,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:14:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622547 states. [2019-09-08 08:15:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622547 to 622543. [2019-09-08 08:15:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622543 states. [2019-09-08 08:15:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622543 states to 622543 states and 852431 transitions. [2019-09-08 08:15:50,874 INFO L78 Accepts]: Start accepts. Automaton has 622543 states and 852431 transitions. Word has length 145 [2019-09-08 08:15:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:50,875 INFO L475 AbstractCegarLoop]: Abstraction has 622543 states and 852431 transitions. [2019-09-08 08:15:50,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:15:50,875 INFO L276 IsEmpty]: Start isEmpty. Operand 622543 states and 852431 transitions. [2019-09-08 08:15:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 08:15:50,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:50,876 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:15:50,877 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1364814819, now seen corresponding path program 1 times [2019-09-08 08:15:50,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:50,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:15:51,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:51,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 08:15:51,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 08:15:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 08:15:51,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:15:51,034 INFO L87 Difference]: Start difference. First operand 622543 states and 852431 transitions. Second operand 8 states. [2019-09-08 08:16:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:16:38,251 INFO L93 Difference]: Finished difference Result 740955 states and 1069282 transitions. [2019-09-08 08:16:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:16:38,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-09-08 08:16:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:16:40,716 INFO L225 Difference]: With dead ends: 740955 [2019-09-08 08:16:40,717 INFO L226 Difference]: Without dead ends: 740953 [2019-09-08 08:16:40,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:16:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740953 states. [2019-09-08 08:17:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740953 to 672079. [2019-09-08 08:17:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672079 states. [2019-09-08 08:17:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672079 states to 672079 states and 902479 transitions. [2019-09-08 08:17:48,430 INFO L78 Accepts]: Start accepts. Automaton has 672079 states and 902479 transitions. Word has length 145 [2019-09-08 08:17:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:17:48,430 INFO L475 AbstractCegarLoop]: Abstraction has 672079 states and 902479 transitions. [2019-09-08 08:17:48,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 08:17:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 672079 states and 902479 transitions. [2019-09-08 08:17:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 08:17:48,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:17:48,618 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:17:48,618 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:17:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:17:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 703661048, now seen corresponding path program 1 times [2019-09-08 08:17:48,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:17:48,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:17:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:48,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:17:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:17:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 08:17:49,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:17:49,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 08:17:49,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:17:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:17:49,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:17:49,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:17:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 08:17:52,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:17:52,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [23] total 38 [2019-09-08 08:17:52,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 08:17:52,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 08:17:52,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 08:17:52,341 INFO L87 Difference]: Start difference. First operand 672079 states and 902479 transitions. Second operand 38 states. [2019-09-08 08:17:52,631 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2019-09-08 08:17:58,801 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38