/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:36:53,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:36:53,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:36:53,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:36:53,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:36:53,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:36:53,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:36:53,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:36:53,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:36:53,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:36:53,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:36:53,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:36:53,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:36:53,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:36:53,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:36:53,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:36:53,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:36:53,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:36:53,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:36:53,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:36:53,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:36:53,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:36:53,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:36:53,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:36:53,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:36:53,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:36:53,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:36:53,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:36:53,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:36:53,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:36:53,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:36:53,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:36:53,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:36:53,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:36:53,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:36:53,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:36:53,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:36:53,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:36:53,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:36:53,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:36:53,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:36:53,946 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-11-23 22:36:53,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:36:53,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:36:53,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:36:53,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:36:53,971 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:36:53,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:36:53,971 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:36:53,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:36:53,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:36:53,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:36:53,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:36:53,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:36:53,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:36:53,976 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:36:53,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:36:53,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:36:53,976 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:36:53,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:36:53,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:36:53,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:36:53,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:36:53,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:36:53,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:36:53,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:36:53,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:36:53,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:36:53,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:36:53,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:36:53,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:36:53,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:36:54,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:36:54,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:36:54,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:36:54,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:36:54,277 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:36:54,278 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-23 22:36:54,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787fbb09f/00ee0ae709ec46f1ad53b26c79eedbca/FLAG0203d80be [2019-11-23 22:36:54,853 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:36:54,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-23 22:36:54,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787fbb09f/00ee0ae709ec46f1ad53b26c79eedbca/FLAG0203d80be [2019-11-23 22:36:55,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787fbb09f/00ee0ae709ec46f1ad53b26c79eedbca [2019-11-23 22:36:55,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:36:55,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:36:55,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:36:55,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:36:55,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:36:55,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6886fec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55, skipping insertion in model container [2019-11-23 22:36:55,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:36:55,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:36:55,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:36:55,633 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:36:55,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:36:55,732 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:36:55,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55 WrapperNode [2019-11-23 22:36:55,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:36:55,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:36:55,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:36:55,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:36:55,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:36:55,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:36:55,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:36:55,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:36:55,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:36:55,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:36:55,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:36:55,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:36:55,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (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-11-23 22:36:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:36:56,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:36:57,685 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:36:57,685 INFO L284 CfgBuilder]: Removed 173 assume(true) statements. [2019-11-23 22:36:57,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:36:57 BoogieIcfgContainer [2019-11-23 22:36:57,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:36:57,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:36:57,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:36:57,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:36:57,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:36:55" (1/3) ... [2019-11-23 22:36:57,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1f027a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:36:57, skipping insertion in model container [2019-11-23 22:36:57,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (2/3) ... [2019-11-23 22:36:57,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1f027a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:36:57, skipping insertion in model container [2019-11-23 22:36:57,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:36:57" (3/3) ... [2019-11-23 22:36:57,699 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-23 22:36:57,709 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:36:57,720 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-23 22:36:57,734 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-23 22:36:57,779 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:36:57,779 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:36:57,779 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:36:57,779 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:36:57,780 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:36:57,780 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:36:57,780 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:36:57,780 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:36:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2019-11-23 22:36:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 22:36:57,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:57,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:57,833 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2019-11-23 22:36:57,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:57,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813943520] [2019-11-23 22:36:57,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:58,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813943520] [2019-11-23 22:36:58,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:58,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:58,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973334099] [2019-11-23 22:36:58,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:58,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:58,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:58,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:58,066 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2019-11-23 22:36:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:58,373 INFO L93 Difference]: Finished difference Result 1235 states and 2033 transitions. [2019-11-23 22:36:58,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:58,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-23 22:36:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:58,405 INFO L225 Difference]: With dead ends: 1235 [2019-11-23 22:36:58,405 INFO L226 Difference]: Without dead ends: 714 [2019-11-23 22:36:58,418 INFO L630 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-11-23 22:36:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-11-23 22:36:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 451. [2019-11-23 22:36:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-23 22:36:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 706 transitions. [2019-11-23 22:36:58,506 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 706 transitions. Word has length 9 [2019-11-23 22:36:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:58,506 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 706 transitions. [2019-11-23 22:36:58,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 706 transitions. [2019-11-23 22:36:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:36:58,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:58,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:58,530 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2019-11-23 22:36:58,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:58,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386537439] [2019-11-23 22:36:58,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:58,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386537439] [2019-11-23 22:36:58,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:58,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:58,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42844024] [2019-11-23 22:36:58,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:58,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:58,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:58,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:58,604 INFO L87 Difference]: Start difference. First operand 451 states and 706 transitions. Second operand 3 states. [2019-11-23 22:36:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:58,686 INFO L93 Difference]: Finished difference Result 1113 states and 1728 transitions. [2019-11-23 22:36:58,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:58,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 22:36:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:58,691 INFO L225 Difference]: With dead ends: 1113 [2019-11-23 22:36:58,691 INFO L226 Difference]: Without dead ends: 664 [2019-11-23 22:36:58,693 INFO L630 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-11-23 22:36:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-11-23 22:36:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 418. [2019-11-23 22:36:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-23 22:36:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 648 transitions. [2019-11-23 22:36:58,721 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 648 transitions. Word has length 10 [2019-11-23 22:36:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:58,721 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 648 transitions. [2019-11-23 22:36:58,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 648 transitions. [2019-11-23 22:36:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:36:58,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:58,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:58,726 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:58,726 INFO L82 PathProgramCache]: Analyzing trace with hash -674152124, now seen corresponding path program 1 times [2019-11-23 22:36:58,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:58,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638100421] [2019-11-23 22:36:58,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:58,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638100421] [2019-11-23 22:36:58,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:58,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:58,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674239357] [2019-11-23 22:36:58,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:58,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:58,846 INFO L87 Difference]: Start difference. First operand 418 states and 648 transitions. Second operand 3 states. [2019-11-23 22:36:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:58,924 INFO L93 Difference]: Finished difference Result 1232 states and 1915 transitions. [2019-11-23 22:36:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:58,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:36:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:58,931 INFO L225 Difference]: With dead ends: 1232 [2019-11-23 22:36:58,931 INFO L226 Difference]: Without dead ends: 824 [2019-11-23 22:36:58,932 INFO L630 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-11-23 22:36:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-11-23 22:36:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 422. [2019-11-23 22:36:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-23 22:36:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 652 transitions. [2019-11-23 22:36:58,955 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 652 transitions. Word has length 13 [2019-11-23 22:36:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:58,956 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 652 transitions. [2019-11-23 22:36:58,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 652 transitions. [2019-11-23 22:36:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:36:58,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:58,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:58,965 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:58,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1826556945, now seen corresponding path program 1 times [2019-11-23 22:36:58,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:58,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010661521] [2019-11-23 22:36:58,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:59,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010661521] [2019-11-23 22:36:59,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207252215] [2019-11-23 22:36:59,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,053 INFO L87 Difference]: Start difference. First operand 422 states and 652 transitions. Second operand 3 states. [2019-11-23 22:36:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,074 INFO L93 Difference]: Finished difference Result 659 states and 1012 transitions. [2019-11-23 22:36:59,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:59,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:36:59,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,077 INFO L225 Difference]: With dead ends: 659 [2019-11-23 22:36:59,077 INFO L226 Difference]: Without dead ends: 422 [2019-11-23 22:36:59,078 INFO L630 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-11-23 22:36:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-11-23 22:36:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2019-11-23 22:36:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-23 22:36:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 648 transitions. [2019-11-23 22:36:59,091 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 648 transitions. Word has length 17 [2019-11-23 22:36:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,091 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 648 transitions. [2019-11-23 22:36:59,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 648 transitions. [2019-11-23 22:36:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:36:59,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:59,093 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2019-11-23 22:36:59,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052463168] [2019-11-23 22:36:59,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,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-11-23 22:36:59,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052463168] [2019-11-23 22:36:59,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:59,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461021901] [2019-11-23 22:36:59,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:59,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:59,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:59,157 INFO L87 Difference]: Start difference. First operand 422 states and 648 transitions. Second operand 4 states. [2019-11-23 22:36:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,222 INFO L93 Difference]: Finished difference Result 1075 states and 1646 transitions. [2019-11-23 22:36:59,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:59,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-23 22:36:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,226 INFO L225 Difference]: With dead ends: 1075 [2019-11-23 22:36:59,227 INFO L226 Difference]: Without dead ends: 665 [2019-11-23 22:36:59,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-11-23 22:36:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 422. [2019-11-23 22:36:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-23 22:36:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 647 transitions. [2019-11-23 22:36:59,242 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 647 transitions. Word has length 18 [2019-11-23 22:36:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,243 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 647 transitions. [2019-11-23 22:36:59,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 647 transitions. [2019-11-23 22:36:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:36:59,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:59,244 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2019-11-23 22:36:59,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175362567] [2019-11-23 22:36:59,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:36:59,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175362567] [2019-11-23 22:36:59,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175843937] [2019-11-23 22:36:59,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,279 INFO L87 Difference]: Start difference. First operand 422 states and 647 transitions. Second operand 3 states. [2019-11-23 22:36:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,426 INFO L93 Difference]: Finished difference Result 1017 states and 1548 transitions. [2019-11-23 22:36:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:59,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:36:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,430 INFO L225 Difference]: With dead ends: 1017 [2019-11-23 22:36:59,431 INFO L226 Difference]: Without dead ends: 610 [2019-11-23 22:36:59,433 INFO L630 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-11-23 22:36:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-23 22:36:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 377. [2019-11-23 22:36:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-23 22:36:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 567 transitions. [2019-11-23 22:36:59,447 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 567 transitions. Word has length 21 [2019-11-23 22:36:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,449 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 567 transitions. [2019-11-23 22:36:59,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 567 transitions. [2019-11-23 22:36:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:36:59,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:59,452 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash -385095713, now seen corresponding path program 1 times [2019-11-23 22:36:59,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632416522] [2019-11-23 22:36:59,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:36:59,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632416522] [2019-11-23 22:36:59,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919961019] [2019-11-23 22:36:59,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,519 INFO L87 Difference]: Start difference. First operand 377 states and 567 transitions. Second operand 3 states. [2019-11-23 22:36:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,624 INFO L93 Difference]: Finished difference Result 938 states and 1410 transitions. [2019-11-23 22:36:59,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:59,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:36:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,629 INFO L225 Difference]: With dead ends: 938 [2019-11-23 22:36:59,630 INFO L226 Difference]: Without dead ends: 576 [2019-11-23 22:36:59,631 INFO L630 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-11-23 22:36:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-11-23 22:36:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 351. [2019-11-23 22:36:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-23 22:36:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 521 transitions. [2019-11-23 22:36:59,646 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 521 transitions. Word has length 21 [2019-11-23 22:36:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,647 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 521 transitions. [2019-11-23 22:36:59,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 521 transitions. [2019-11-23 22:36:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:36:59,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,650 INFO L410 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] [2019-11-23 22:36:59,650 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2032684668, now seen corresponding path program 1 times [2019-11-23 22:36:59,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101568790] [2019-11-23 22:36:59,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:36:59,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101568790] [2019-11-23 22:36:59,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:59,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872194660] [2019-11-23 22:36:59,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:59,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:59,750 INFO L87 Difference]: Start difference. First operand 351 states and 521 transitions. Second operand 4 states. [2019-11-23 22:36:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,822 INFO L93 Difference]: Finished difference Result 899 states and 1341 transitions. [2019-11-23 22:36:59,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:59,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-23 22:36:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,826 INFO L225 Difference]: With dead ends: 899 [2019-11-23 22:36:59,826 INFO L226 Difference]: Without dead ends: 574 [2019-11-23 22:36:59,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-23 22:36:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 351. [2019-11-23 22:36:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-23 22:36:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 520 transitions. [2019-11-23 22:36:59,839 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 520 transitions. Word has length 31 [2019-11-23 22:36:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,840 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 520 transitions. [2019-11-23 22:36:59,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 520 transitions. [2019-11-23 22:36:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:36:59,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,843 INFO L410 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] [2019-11-23 22:36:59,843 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,844 INFO L82 PathProgramCache]: Analyzing trace with hash -290926641, now seen corresponding path program 1 times [2019-11-23 22:36:59,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2261952] [2019-11-23 22:36:59,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:36:59,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2261952] [2019-11-23 22:36:59,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221942344] [2019-11-23 22:36:59,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,902 INFO L87 Difference]: Start difference. First operand 351 states and 520 transitions. Second operand 3 states. [2019-11-23 22:36:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,948 INFO L93 Difference]: Finished difference Result 872 states and 1304 transitions. [2019-11-23 22:36:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:59,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-23 22:36:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,954 INFO L225 Difference]: With dead ends: 872 [2019-11-23 22:36:59,954 INFO L226 Difference]: Without dead ends: 550 [2019-11-23 22:36:59,955 INFO L630 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-11-23 22:36:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-23 22:36:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 328. [2019-11-23 22:36:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-23 22:36:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 482 transitions. [2019-11-23 22:36:59,968 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 482 transitions. Word has length 34 [2019-11-23 22:36:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,969 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 482 transitions. [2019-11-23 22:36:59,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 482 transitions. [2019-11-23 22:36:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:36:59,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,971 INFO L410 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] [2019-11-23 22:36:59,972 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1984299198, now seen corresponding path program 1 times [2019-11-23 22:36:59,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059858206] [2019-11-23 22:36:59,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:37:00,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059858206] [2019-11-23 22:37:00,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380543056] [2019-11-23 22:37:00,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,021 INFO L87 Difference]: Start difference. First operand 328 states and 482 transitions. Second operand 3 states. [2019-11-23 22:37:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,099 INFO L93 Difference]: Finished difference Result 734 states and 1080 transitions. [2019-11-23 22:37:00,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-23 22:37:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,103 INFO L225 Difference]: With dead ends: 734 [2019-11-23 22:37:00,104 INFO L226 Difference]: Without dead ends: 435 [2019-11-23 22:37:00,105 INFO L630 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-11-23 22:37:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-23 22:37:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 296. [2019-11-23 22:37:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-23 22:37:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 422 transitions. [2019-11-23 22:37:00,118 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 422 transitions. Word has length 35 [2019-11-23 22:37:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,118 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 422 transitions. [2019-11-23 22:37:00,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 422 transitions. [2019-11-23 22:37:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 22:37:00,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,119 INFO L410 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] [2019-11-23 22:37:00,120 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1766202321, now seen corresponding path program 1 times [2019-11-23 22:37:00,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723354779] [2019-11-23 22:37:00,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:37:00,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723354779] [2019-11-23 22:37:00,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:00,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571629588] [2019-11-23 22:37:00,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:00,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:00,180 INFO L87 Difference]: Start difference. First operand 296 states and 422 transitions. Second operand 4 states. [2019-11-23 22:37:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,251 INFO L93 Difference]: Finished difference Result 755 states and 1092 transitions. [2019-11-23 22:37:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:37:00,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-23 22:37:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,258 INFO L225 Difference]: With dead ends: 755 [2019-11-23 22:37:00,259 INFO L226 Difference]: Without dead ends: 501 [2019-11-23 22:37:00,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:37:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-23 22:37:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 296. [2019-11-23 22:37:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-23 22:37:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 421 transitions. [2019-11-23 22:37:00,274 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 421 transitions. Word has length 46 [2019-11-23 22:37:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,274 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 421 transitions. [2019-11-23 22:37:00,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 421 transitions. [2019-11-23 22:37:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:37:00,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,276 INFO L410 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] [2019-11-23 22:37:00,277 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,277 INFO L82 PathProgramCache]: Analyzing trace with hash -544708160, now seen corresponding path program 1 times [2019-11-23 22:37:00,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350945240] [2019-11-23 22:37:00,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:00,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350945240] [2019-11-23 22:37:00,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588003176] [2019-11-23 22:37:00,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,362 INFO L87 Difference]: Start difference. First operand 296 states and 421 transitions. Second operand 3 states. [2019-11-23 22:37:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,418 INFO L93 Difference]: Finished difference Result 636 states and 939 transitions. [2019-11-23 22:37:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:37:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,421 INFO L225 Difference]: With dead ends: 636 [2019-11-23 22:37:00,422 INFO L226 Difference]: Without dead ends: 385 [2019-11-23 22:37:00,423 INFO L630 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-11-23 22:37:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-23 22:37:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 256. [2019-11-23 22:37:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-23 22:37:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 371 transitions. [2019-11-23 22:37:00,461 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 371 transitions. Word has length 49 [2019-11-23 22:37:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,461 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 371 transitions. [2019-11-23 22:37:00,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 371 transitions. [2019-11-23 22:37:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:37:00,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,463 INFO L410 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] [2019-11-23 22:37:00,464 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash 390941353, now seen corresponding path program 1 times [2019-11-23 22:37:00,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069151589] [2019-11-23 22:37:00,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:00,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069151589] [2019-11-23 22:37:00,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286877694] [2019-11-23 22:37:00,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,519 INFO L87 Difference]: Start difference. First operand 256 states and 371 transitions. Second operand 3 states. [2019-11-23 22:37:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,549 INFO L93 Difference]: Finished difference Result 437 states and 646 transitions. [2019-11-23 22:37:00,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-23 22:37:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,552 INFO L225 Difference]: With dead ends: 437 [2019-11-23 22:37:00,552 INFO L226 Difference]: Without dead ends: 226 [2019-11-23 22:37:00,553 INFO L630 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-11-23 22:37:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-23 22:37:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-11-23 22:37:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-23 22:37:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 325 transitions. [2019-11-23 22:37:00,562 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 325 transitions. Word has length 56 [2019-11-23 22:37:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,563 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 325 transitions. [2019-11-23 22:37:00,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 325 transitions. [2019-11-23 22:37:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:37:00,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,564 INFO L410 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] [2019-11-23 22:37:00,565 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1746044383, now seen corresponding path program 1 times [2019-11-23 22:37:00,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648759533] [2019-11-23 22:37:00,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:00,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648759533] [2019-11-23 22:37:00,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:00,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561626504] [2019-11-23 22:37:00,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:00,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:00,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:00,623 INFO L87 Difference]: Start difference. First operand 226 states and 325 transitions. Second operand 4 states. [2019-11-23 22:37:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,661 INFO L93 Difference]: Finished difference Result 395 states and 580 transitions. [2019-11-23 22:37:00,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:37:00,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-23 22:37:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,664 INFO L225 Difference]: With dead ends: 395 [2019-11-23 22:37:00,664 INFO L226 Difference]: Without dead ends: 226 [2019-11-23 22:37:00,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:37:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-23 22:37:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-11-23 22:37:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-23 22:37:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 324 transitions. [2019-11-23 22:37:00,673 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 324 transitions. Word has length 59 [2019-11-23 22:37:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,674 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 324 transitions. [2019-11-23 22:37:00,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 324 transitions. [2019-11-23 22:37:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:37:00,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,675 INFO L410 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] [2019-11-23 22:37:00,675 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash 621112538, now seen corresponding path program 1 times [2019-11-23 22:37:00,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173490499] [2019-11-23 22:37:00,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:00,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173490499] [2019-11-23 22:37:00,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336757720] [2019-11-23 22:37:00,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,738 INFO L87 Difference]: Start difference. First operand 226 states and 324 transitions. Second operand 3 states. [2019-11-23 22:37:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,772 INFO L93 Difference]: Finished difference Result 525 states and 779 transitions. [2019-11-23 22:37:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-23 22:37:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,774 INFO L225 Difference]: With dead ends: 525 [2019-11-23 22:37:00,775 INFO L226 Difference]: Without dead ends: 359 [2019-11-23 22:37:00,777 INFO L630 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-11-23 22:37:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-23 22:37:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 221. [2019-11-23 22:37:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-23 22:37:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 316 transitions. [2019-11-23 22:37:00,788 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 316 transitions. Word has length 62 [2019-11-23 22:37:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,788 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 316 transitions. [2019-11-23 22:37:00,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 316 transitions. [2019-11-23 22:37:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:37:00,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,789 INFO L410 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] [2019-11-23 22:37:00,789 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 114301335, now seen corresponding path program 1 times [2019-11-23 22:37:00,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034340249] [2019-11-23 22:37:00,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:00,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034340249] [2019-11-23 22:37:00,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122495808] [2019-11-23 22:37:00,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,848 INFO L87 Difference]: Start difference. First operand 221 states and 316 transitions. Second operand 3 states. [2019-11-23 22:37:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,874 INFO L93 Difference]: Finished difference Result 506 states and 750 transitions. [2019-11-23 22:37:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:37:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,876 INFO L225 Difference]: With dead ends: 506 [2019-11-23 22:37:00,876 INFO L226 Difference]: Without dead ends: 345 [2019-11-23 22:37:00,877 INFO L630 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-11-23 22:37:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-23 22:37:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 217. [2019-11-23 22:37:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-23 22:37:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 309 transitions. [2019-11-23 22:37:00,887 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 309 transitions. Word has length 67 [2019-11-23 22:37:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,888 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 309 transitions. [2019-11-23 22:37:00,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 309 transitions. [2019-11-23 22:37:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:37:00,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,889 INFO L410 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] [2019-11-23 22:37:00,889 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2093726931, now seen corresponding path program 1 times [2019-11-23 22:37:00,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10760566] [2019-11-23 22:37:00,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:00,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10760566] [2019-11-23 22:37:00,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384954586] [2019-11-23 22:37:00,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,946 INFO L87 Difference]: Start difference. First operand 217 states and 309 transitions. Second operand 3 states. [2019-11-23 22:37:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,969 INFO L93 Difference]: Finished difference Result 372 states and 544 transitions. [2019-11-23 22:37:00,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:37:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,971 INFO L225 Difference]: With dead ends: 372 [2019-11-23 22:37:00,971 INFO L226 Difference]: Without dead ends: 215 [2019-11-23 22:37:00,972 INFO L630 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-11-23 22:37:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-23 22:37:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-11-23 22:37:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-23 22:37:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 303 transitions. [2019-11-23 22:37:00,981 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 303 transitions. Word has length 73 [2019-11-23 22:37:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,982 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 303 transitions. [2019-11-23 22:37:00,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 303 transitions. [2019-11-23 22:37:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:37:00,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,989 INFO L410 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] [2019-11-23 22:37:00,989 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash -953900745, now seen corresponding path program 1 times [2019-11-23 22:37:00,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347751687] [2019-11-23 22:37:00,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347751687] [2019-11-23 22:37:01,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:01,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791221168] [2019-11-23 22:37:01,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,038 INFO L87 Difference]: Start difference. First operand 214 states and 303 transitions. Second operand 3 states. [2019-11-23 22:37:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,051 INFO L93 Difference]: Finished difference Result 414 states and 603 transitions. [2019-11-23 22:37:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-23 22:37:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,054 INFO L225 Difference]: With dead ends: 414 [2019-11-23 22:37:01,054 INFO L226 Difference]: Without dead ends: 260 [2019-11-23 22:37:01,054 INFO L630 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-11-23 22:37:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-23 22:37:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 211. [2019-11-23 22:37:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-23 22:37:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2019-11-23 22:37:01,063 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 80 [2019-11-23 22:37:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,064 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2019-11-23 22:37:01,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2019-11-23 22:37:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:37:01,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,065 INFO L410 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] [2019-11-23 22:37:01,065 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1940476615, now seen corresponding path program 1 times [2019-11-23 22:37:01,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254620023] [2019-11-23 22:37:01,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254620023] [2019-11-23 22:37:01,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:01,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842263351] [2019-11-23 22:37:01,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:01,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:01,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:01,212 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 4 states. [2019-11-23 22:37:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,303 INFO L93 Difference]: Finished difference Result 537 states and 782 transitions. [2019-11-23 22:37:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:37:01,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-23 22:37:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,306 INFO L225 Difference]: With dead ends: 537 [2019-11-23 22:37:01,306 INFO L226 Difference]: Without dead ends: 386 [2019-11-23 22:37:01,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:37:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-23 22:37:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 292. [2019-11-23 22:37:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-23 22:37:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 416 transitions. [2019-11-23 22:37:01,326 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 416 transitions. Word has length 83 [2019-11-23 22:37:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,327 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 416 transitions. [2019-11-23 22:37:01,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 416 transitions. [2019-11-23 22:37:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:37:01,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,328 INFO L410 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] [2019-11-23 22:37:01,329 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1284591471, now seen corresponding path program 1 times [2019-11-23 22:37:01,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197882759] [2019-11-23 22:37:01,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197882759] [2019-11-23 22:37:01,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:01,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922938145] [2019-11-23 22:37:01,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,407 INFO L87 Difference]: Start difference. First operand 292 states and 416 transitions. Second operand 3 states. [2019-11-23 22:37:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,455 INFO L93 Difference]: Finished difference Result 693 states and 1012 transitions. [2019-11-23 22:37:01,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:37:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,459 INFO L225 Difference]: With dead ends: 693 [2019-11-23 22:37:01,459 INFO L226 Difference]: Without dead ends: 499 [2019-11-23 22:37:01,460 INFO L630 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-11-23 22:37:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-23 22:37:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 362. [2019-11-23 22:37:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-11-23 22:37:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 515 transitions. [2019-11-23 22:37:01,494 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 515 transitions. Word has length 99 [2019-11-23 22:37:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,494 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 515 transitions. [2019-11-23 22:37:01,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 515 transitions. [2019-11-23 22:37:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:37:01,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,496 INFO L410 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] [2019-11-23 22:37:01,496 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1539198065, now seen corresponding path program 1 times [2019-11-23 22:37:01,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356165922] [2019-11-23 22:37:01,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356165922] [2019-11-23 22:37:01,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:01,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701115738] [2019-11-23 22:37:01,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,597 INFO L87 Difference]: Start difference. First operand 362 states and 515 transitions. Second operand 3 states. [2019-11-23 22:37:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,643 INFO L93 Difference]: Finished difference Result 842 states and 1225 transitions. [2019-11-23 22:37:01,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:37:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,647 INFO L225 Difference]: With dead ends: 842 [2019-11-23 22:37:01,647 INFO L226 Difference]: Without dead ends: 605 [2019-11-23 22:37:01,648 INFO L630 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-11-23 22:37:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-11-23 22:37:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 456. [2019-11-23 22:37:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-23 22:37:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 649 transitions. [2019-11-23 22:37:01,675 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 649 transitions. Word has length 100 [2019-11-23 22:37:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,676 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 649 transitions. [2019-11-23 22:37:01,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 649 transitions. [2019-11-23 22:37:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:37:01,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,677 INFO L410 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] [2019-11-23 22:37:01,678 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1069877832, now seen corresponding path program 1 times [2019-11-23 22:37:01,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761724875] [2019-11-23 22:37:01,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:01,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761724875] [2019-11-23 22:37:01,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651614542] [2019-11-23 22:37:01,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:37:01,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:02,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:02,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-23 22:37:02,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815680477] [2019-11-23 22:37:02,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:37:02,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:37:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:37:02,048 INFO L87 Difference]: Start difference. First operand 456 states and 649 transitions. Second operand 6 states. [2019-11-23 22:37:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:02,456 INFO L93 Difference]: Finished difference Result 1192 states and 1648 transitions. [2019-11-23 22:37:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:37:02,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-23 22:37:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:02,463 INFO L225 Difference]: With dead ends: 1192 [2019-11-23 22:37:02,463 INFO L226 Difference]: Without dead ends: 747 [2019-11-23 22:37:02,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:37:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-23 22:37:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 497. [2019-11-23 22:37:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-11-23 22:37:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 689 transitions. [2019-11-23 22:37:02,500 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 689 transitions. Word has length 101 [2019-11-23 22:37:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:02,501 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 689 transitions. [2019-11-23 22:37:02,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:37:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 689 transitions. [2019-11-23 22:37:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-23 22:37:02,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:02,503 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:02,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:02,709 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:02,710 INFO L82 PathProgramCache]: Analyzing trace with hash -958769693, now seen corresponding path program 1 times [2019-11-23 22:37:02,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:02,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114525227] [2019-11-23 22:37:02,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 22:37:02,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114525227] [2019-11-23 22:37:02,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33383181] [2019-11-23 22:37:02,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:03,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:37:03,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:37:03,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:03,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-23 22:37:03,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459325438] [2019-11-23 22:37:03,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:37:03,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:37:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:37:03,078 INFO L87 Difference]: Start difference. First operand 497 states and 689 transitions. Second operand 7 states. [2019-11-23 22:37:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:03,432 INFO L93 Difference]: Finished difference Result 1398 states and 1938 transitions. [2019-11-23 22:37:03,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:37:03,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-11-23 22:37:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:03,437 INFO L225 Difference]: With dead ends: 1398 [2019-11-23 22:37:03,438 INFO L226 Difference]: Without dead ends: 920 [2019-11-23 22:37:03,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:37:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-11-23 22:37:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 538. [2019-11-23 22:37:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-23 22:37:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 737 transitions. [2019-11-23 22:37:03,476 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 737 transitions. Word has length 139 [2019-11-23 22:37:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:03,476 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 737 transitions. [2019-11-23 22:37:03,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:37:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 737 transitions. [2019-11-23 22:37:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 22:37:03,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:03,481 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:03,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:03,689 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:03,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:03,690 INFO L82 PathProgramCache]: Analyzing trace with hash 818430710, now seen corresponding path program 1 times [2019-11-23 22:37:03,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:03,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150270670] [2019-11-23 22:37:03,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:03,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150270670] [2019-11-23 22:37:03,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:03,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:03,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462387179] [2019-11-23 22:37:03,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:03,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:03,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:03,935 INFO L87 Difference]: Start difference. First operand 538 states and 737 transitions. Second operand 4 states. [2019-11-23 22:37:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:04,048 INFO L93 Difference]: Finished difference Result 853 states and 1188 transitions. [2019-11-23 22:37:04,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:37:04,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-23 22:37:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:04,053 INFO L225 Difference]: With dead ends: 853 [2019-11-23 22:37:04,053 INFO L226 Difference]: Without dead ends: 851 [2019-11-23 22:37:04,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:37:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-11-23 22:37:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 540. [2019-11-23 22:37:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-23 22:37:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 739 transitions. [2019-11-23 22:37:04,092 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 739 transitions. Word has length 177 [2019-11-23 22:37:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:04,093 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 739 transitions. [2019-11-23 22:37:04,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 739 transitions. [2019-11-23 22:37:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 22:37:04,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:04,095 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:04,096 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1245468310, now seen corresponding path program 1 times [2019-11-23 22:37:04,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:04,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205406795] [2019-11-23 22:37:04,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-23 22:37:04,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205406795] [2019-11-23 22:37:04,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519978950] [2019-11-23 22:37:04,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:04,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 22:37:04,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-23 22:37:04,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:04,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-23 22:37:04,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096825986] [2019-11-23 22:37:04,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:37:04,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:37:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:37:04,567 INFO L87 Difference]: Start difference. First operand 540 states and 739 transitions. Second operand 11 states. [2019-11-23 22:37:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:05,395 INFO L93 Difference]: Finished difference Result 3003 states and 4244 transitions. [2019-11-23 22:37:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:37:05,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 180 [2019-11-23 22:37:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:05,409 INFO L225 Difference]: With dead ends: 3003 [2019-11-23 22:37:05,409 INFO L226 Difference]: Without dead ends: 2700 [2019-11-23 22:37:05,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-11-23 22:37:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2019-11-23 22:37:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 728. [2019-11-23 22:37:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-23 22:37:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 988 transitions. [2019-11-23 22:37:05,478 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 988 transitions. Word has length 180 [2019-11-23 22:37:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:05,478 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 988 transitions. [2019-11-23 22:37:05,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:37:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 988 transitions. [2019-11-23 22:37:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 22:37:05,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:05,482 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:05,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:05,695 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash -34395368, now seen corresponding path program 1 times [2019-11-23 22:37:05,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:05,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971286852] [2019-11-23 22:37:05,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:05,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971286852] [2019-11-23 22:37:05,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:05,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:05,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276823720] [2019-11-23 22:37:05,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:05,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:05,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:05,772 INFO L87 Difference]: Start difference. First operand 728 states and 988 transitions. Second operand 3 states. [2019-11-23 22:37:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:05,897 INFO L93 Difference]: Finished difference Result 1575 states and 2169 transitions. [2019-11-23 22:37:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:05,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-23 22:37:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:05,904 INFO L225 Difference]: With dead ends: 1575 [2019-11-23 22:37:05,904 INFO L226 Difference]: Without dead ends: 1272 [2019-11-23 22:37:05,906 INFO L630 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-11-23 22:37:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-11-23 22:37:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 728. [2019-11-23 22:37:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-23 22:37:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 986 transitions. [2019-11-23 22:37:05,953 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 986 transitions. Word has length 180 [2019-11-23 22:37:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:05,953 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 986 transitions. [2019-11-23 22:37:05,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 986 transitions. [2019-11-23 22:37:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-23 22:37:05,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:05,956 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:05,957 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:05,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1859951354, now seen corresponding path program 1 times [2019-11-23 22:37:05,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:05,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022618758] [2019-11-23 22:37:05,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:37:06,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022618758] [2019-11-23 22:37:06,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:06,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:06,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066721969] [2019-11-23 22:37:06,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:06,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:06,028 INFO L87 Difference]: Start difference. First operand 728 states and 986 transitions. Second operand 3 states. [2019-11-23 22:37:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:06,108 INFO L93 Difference]: Finished difference Result 1194 states and 1630 transitions. [2019-11-23 22:37:06,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:06,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-23 22:37:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:06,111 INFO L225 Difference]: With dead ends: 1194 [2019-11-23 22:37:06,112 INFO L226 Difference]: Without dead ends: 587 [2019-11-23 22:37:06,112 INFO L630 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-11-23 22:37:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-11-23 22:37:06,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 586. [2019-11-23 22:37:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-23 22:37:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 770 transitions. [2019-11-23 22:37:06,146 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 770 transitions. Word has length 183 [2019-11-23 22:37:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:06,146 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 770 transitions. [2019-11-23 22:37:06,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 770 transitions. [2019-11-23 22:37:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 22:37:06,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:06,148 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:06,149 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:06,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2102972572, now seen corresponding path program 1 times [2019-11-23 22:37:06,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:06,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881073526] [2019-11-23 22:37:06,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:06,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881073526] [2019-11-23 22:37:06,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:06,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:37:06,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650303681] [2019-11-23 22:37:06,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:37:06,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:06,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:37:06,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:37:06,382 INFO L87 Difference]: Start difference. First operand 586 states and 770 transitions. Second operand 9 states. [2019-11-23 22:37:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:07,847 INFO L93 Difference]: Finished difference Result 1917 states and 2591 transitions. [2019-11-23 22:37:07,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 22:37:07,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-11-23 22:37:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:07,856 INFO L225 Difference]: With dead ends: 1917 [2019-11-23 22:37:07,856 INFO L226 Difference]: Without dead ends: 1625 [2019-11-23 22:37:07,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=384, Invalid=1256, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 22:37:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-11-23 22:37:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 676. [2019-11-23 22:37:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-23 22:37:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 886 transitions. [2019-11-23 22:37:07,904 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 886 transitions. Word has length 188 [2019-11-23 22:37:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:07,904 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 886 transitions. [2019-11-23 22:37:07,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:37:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 886 transitions. [2019-11-23 22:37:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 22:37:07,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:07,907 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:07,907 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:07,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash -567802538, now seen corresponding path program 1 times [2019-11-23 22:37:07,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:07,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889560642] [2019-11-23 22:37:07,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:08,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889560642] [2019-11-23 22:37:08,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:08,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:37:08,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566393466] [2019-11-23 22:37:08,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:37:08,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:08,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:37:08,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:37:08,039 INFO L87 Difference]: Start difference. First operand 676 states and 886 transitions. Second operand 6 states. [2019-11-23 22:37:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:08,187 INFO L93 Difference]: Finished difference Result 2098 states and 2832 transitions. [2019-11-23 22:37:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:37:08,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-11-23 22:37:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:08,198 INFO L225 Difference]: With dead ends: 2098 [2019-11-23 22:37:08,198 INFO L226 Difference]: Without dead ends: 1710 [2019-11-23 22:37:08,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:37:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2019-11-23 22:37:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 753. [2019-11-23 22:37:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-11-23 22:37:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 984 transitions. [2019-11-23 22:37:08,274 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 984 transitions. Word has length 194 [2019-11-23 22:37:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:08,274 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 984 transitions. [2019-11-23 22:37:08,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:37:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 984 transitions. [2019-11-23 22:37:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 22:37:08,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:08,280 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:08,280 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash 190520342, now seen corresponding path program 1 times [2019-11-23 22:37:08,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:08,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826827184] [2019-11-23 22:37:08,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:08,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826827184] [2019-11-23 22:37:08,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:08,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:37:08,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113182375] [2019-11-23 22:37:08,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:37:08,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:37:08,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:37:08,529 INFO L87 Difference]: Start difference. First operand 753 states and 984 transitions. Second operand 7 states. [2019-11-23 22:37:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:09,005 INFO L93 Difference]: Finished difference Result 1788 states and 2367 transitions. [2019-11-23 22:37:09,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:37:09,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2019-11-23 22:37:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:09,012 INFO L225 Difference]: With dead ends: 1788 [2019-11-23 22:37:09,012 INFO L226 Difference]: Without dead ends: 1326 [2019-11-23 22:37:09,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:37:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-11-23 22:37:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 794. [2019-11-23 22:37:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-11-23 22:37:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1030 transitions. [2019-11-23 22:37:09,075 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1030 transitions. Word has length 194 [2019-11-23 22:37:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:09,076 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1030 transitions. [2019-11-23 22:37:09,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:37:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1030 transitions. [2019-11-23 22:37:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 22:37:09,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:09,082 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:09,082 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:09,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1531612590, now seen corresponding path program 1 times [2019-11-23 22:37:09,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:09,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524300799] [2019-11-23 22:37:09,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:09,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524300799] [2019-11-23 22:37:09,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:09,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:37:09,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546270570] [2019-11-23 22:37:09,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:37:09,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:09,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:37:09,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:37:09,261 INFO L87 Difference]: Start difference. First operand 794 states and 1030 transitions. Second operand 7 states. [2019-11-23 22:37:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:09,780 INFO L93 Difference]: Finished difference Result 1858 states and 2447 transitions. [2019-11-23 22:37:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:37:09,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2019-11-23 22:37:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:09,788 INFO L225 Difference]: With dead ends: 1858 [2019-11-23 22:37:09,789 INFO L226 Difference]: Without dead ends: 1350 [2019-11-23 22:37:09,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:37:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-23 22:37:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 813. [2019-11-23 22:37:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-23 22:37:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1054 transitions. [2019-11-23 22:37:09,872 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1054 transitions. Word has length 194 [2019-11-23 22:37:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:09,873 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1054 transitions. [2019-11-23 22:37:09,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:37:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1054 transitions. [2019-11-23 22:37:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-23 22:37:09,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:09,876 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:37:09,878 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash 440473311, now seen corresponding path program 1 times [2019-11-23 22:37:09,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:09,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437406479] [2019-11-23 22:37:09,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-23 22:37:10,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437406479] [2019-11-23 22:37:10,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:10,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:10,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73137554] [2019-11-23 22:37:10,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:10,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:10,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:10,010 INFO L87 Difference]: Start difference. First operand 813 states and 1054 transitions. Second operand 4 states. [2019-11-23 22:37:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:10,197 INFO L93 Difference]: Finished difference Result 1471 states and 1934 transitions. [2019-11-23 22:37:10,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:37:10,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-23 22:37:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:10,203 INFO L225 Difference]: With dead ends: 1471 [2019-11-23 22:37:10,203 INFO L226 Difference]: Without dead ends: 952 [2019-11-23 22:37:10,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:37:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-11-23 22:37:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 643. [2019-11-23 22:37:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-23 22:37:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 823 transitions. [2019-11-23 22:37:10,257 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 823 transitions. Word has length 204 [2019-11-23 22:37:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:10,257 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 823 transitions. [2019-11-23 22:37:10,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 823 transitions. [2019-11-23 22:37:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 22:37:10,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:10,261 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:37:10,261 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1123003554, now seen corresponding path program 1 times [2019-11-23 22:37:10,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:10,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600325198] [2019-11-23 22:37:10,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:10,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600325198] [2019-11-23 22:37:10,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974262748] [2019-11-23 22:37:10,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:10,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 22:37:10,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:10,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:10,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2019-11-23 22:37:10,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738894431] [2019-11-23 22:37:10,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:37:10,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:37:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:37:10,959 INFO L87 Difference]: Start difference. First operand 643 states and 823 transitions. Second operand 19 states. [2019-11-23 22:37:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:55,614 INFO L93 Difference]: Finished difference Result 19642 states and 25843 transitions. [2019-11-23 22:37:55,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 948 states. [2019-11-23 22:37:55,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 227 [2019-11-23 22:37:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:55,660 INFO L225 Difference]: With dead ends: 19642 [2019-11-23 22:37:55,660 INFO L226 Difference]: Without dead ends: 19249 [2019-11-23 22:37:55,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1184 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 962 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443379 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=62902, Invalid=865430, Unknown=0, NotChecked=0, Total=928332 [2019-11-23 22:37:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19249 states. [2019-11-23 22:37:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19249 to 1981. [2019-11-23 22:37:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2019-11-23 22:37:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2506 transitions. [2019-11-23 22:37:56,017 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2506 transitions. Word has length 227 [2019-11-23 22:37:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:56,017 INFO L462 AbstractCegarLoop]: Abstraction has 1981 states and 2506 transitions. [2019-11-23 22:37:56,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:37:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2506 transitions. [2019-11-23 22:37:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 22:37:56,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:56,023 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:37:56,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:56,228 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:56,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:56,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1517205090, now seen corresponding path program 1 times [2019-11-23 22:37:56,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:56,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782475137] [2019-11-23 22:37:56,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-23 22:37:56,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782475137] [2019-11-23 22:37:56,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:56,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:56,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024577879] [2019-11-23 22:37:56,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:56,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:56,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:56,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:56,311 INFO L87 Difference]: Start difference. First operand 1981 states and 2506 transitions. Second operand 3 states. [2019-11-23 22:37:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:56,613 INFO L93 Difference]: Finished difference Result 3907 states and 4933 transitions. [2019-11-23 22:37:56,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:56,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-23 22:37:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:56,617 INFO L225 Difference]: With dead ends: 3907 [2019-11-23 22:37:56,618 INFO L226 Difference]: Without dead ends: 2206 [2019-11-23 22:37:56,620 INFO L630 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-11-23 22:37:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2019-11-23 22:37:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1975. [2019-11-23 22:37:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-11-23 22:37:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2410 transitions. [2019-11-23 22:37:56,858 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2410 transitions. Word has length 227 [2019-11-23 22:37:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:56,858 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 2410 transitions. [2019-11-23 22:37:56,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2410 transitions. [2019-11-23 22:37:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 22:37:56,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:56,863 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:37:56,864 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1152779492, now seen corresponding path program 1 times [2019-11-23 22:37:56,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:56,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928791065] [2019-11-23 22:37:56,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-23 22:37:56,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928791065] [2019-11-23 22:37:56,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:56,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:56,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556770101] [2019-11-23 22:37:56,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:56,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:56,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:56,949 INFO L87 Difference]: Start difference. First operand 1975 states and 2410 transitions. Second operand 3 states. [2019-11-23 22:37:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:57,438 INFO L93 Difference]: Finished difference Result 5180 states and 6289 transitions. [2019-11-23 22:37:57,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:57,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-23 22:37:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:57,446 INFO L225 Difference]: With dead ends: 5180 [2019-11-23 22:37:57,446 INFO L226 Difference]: Without dead ends: 3565 [2019-11-23 22:37:57,449 INFO L630 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-11-23 22:37:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2019-11-23 22:37:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 2157. [2019-11-23 22:37:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-11-23 22:37:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 2636 transitions. [2019-11-23 22:37:57,647 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 2636 transitions. Word has length 227 [2019-11-23 22:37:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:57,647 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 2636 transitions. [2019-11-23 22:37:57,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2636 transitions. [2019-11-23 22:37:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 22:37:57,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:57,653 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:37:57,653 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1229680290, now seen corresponding path program 1 times [2019-11-23 22:37:57,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:57,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093203798] [2019-11-23 22:37:57,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-23 22:37:57,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093203798] [2019-11-23 22:37:57,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:57,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:57,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18934139] [2019-11-23 22:37:57,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:57,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:57,745 INFO L87 Difference]: Start difference. First operand 2157 states and 2636 transitions. Second operand 3 states. [2019-11-23 22:37:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:57,901 INFO L93 Difference]: Finished difference Result 3950 states and 4834 transitions. [2019-11-23 22:37:57,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:57,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-23 22:37:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:57,905 INFO L225 Difference]: With dead ends: 3950 [2019-11-23 22:37:57,905 INFO L226 Difference]: Without dead ends: 2052 [2019-11-23 22:37:57,908 INFO L630 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-11-23 22:37:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2019-11-23 22:37:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2052. [2019-11-23 22:37:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-23 22:37:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2487 transitions. [2019-11-23 22:37:58,138 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2487 transitions. Word has length 227 [2019-11-23 22:37:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:58,139 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 2487 transitions. [2019-11-23 22:37:58,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2487 transitions. [2019-11-23 22:37:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-23 22:37:58,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:58,143 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:37:58,143 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1966251894, now seen corresponding path program 1 times [2019-11-23 22:37:58,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:58,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076451272] [2019-11-23 22:37:58,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-23 22:37:58,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076451272] [2019-11-23 22:37:58,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115535985] [2019-11-23 22:37:58,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:58,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 22:37:58,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:59,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:59,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-23 22:37:59,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73411744] [2019-11-23 22:37:59,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 22:37:59,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 22:37:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:37:59,217 INFO L87 Difference]: Start difference. First operand 2052 states and 2487 transitions. Second operand 16 states. [2019-11-23 22:38:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:38:03,353 INFO L93 Difference]: Finished difference Result 8491 states and 10576 transitions. [2019-11-23 22:38:03,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-11-23 22:38:03,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 228 [2019-11-23 22:38:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:38:03,364 INFO L225 Difference]: With dead ends: 8491 [2019-11-23 22:38:03,365 INFO L226 Difference]: Without dead ends: 6817 [2019-11-23 22:38:03,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4759 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1357, Invalid=12215, Unknown=0, NotChecked=0, Total=13572 [2019-11-23 22:38:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6817 states. [2019-11-23 22:38:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 2669. [2019-11-23 22:38:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2019-11-23 22:38:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3222 transitions. [2019-11-23 22:38:03,606 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3222 transitions. Word has length 228 [2019-11-23 22:38:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:38:03,607 INFO L462 AbstractCegarLoop]: Abstraction has 2669 states and 3222 transitions. [2019-11-23 22:38:03,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 22:38:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3222 transitions. [2019-11-23 22:38:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-23 22:38:03,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:38:03,612 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:38:03,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:03,817 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:38:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:38:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2076085201, now seen corresponding path program 1 times [2019-11-23 22:38:03,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:38:03,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314678675] [2019-11-23 22:38:03,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:38:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-11-23 22:38:03,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314678675] [2019-11-23 22:38:03,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:38:03,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:38:03,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672752534] [2019-11-23 22:38:03,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:38:03,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:38:03,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:38:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:38:03,880 INFO L87 Difference]: Start difference. First operand 2669 states and 3222 transitions. Second operand 3 states. [2019-11-23 22:38:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:38:04,088 INFO L93 Difference]: Finished difference Result 5032 states and 6063 transitions. [2019-11-23 22:38:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:38:04,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-11-23 22:38:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:38:04,093 INFO L225 Difference]: With dead ends: 5032 [2019-11-23 22:38:04,093 INFO L226 Difference]: Without dead ends: 2376 [2019-11-23 22:38:04,096 INFO L630 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-11-23 22:38:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-11-23 22:38:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2376. [2019-11-23 22:38:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2376 states. [2019-11-23 22:38:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 2847 transitions. [2019-11-23 22:38:04,343 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 2847 transitions. Word has length 236 [2019-11-23 22:38:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:38:04,343 INFO L462 AbstractCegarLoop]: Abstraction has 2376 states and 2847 transitions. [2019-11-23 22:38:04,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:38:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2847 transitions. [2019-11-23 22:38:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 22:38:04,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:38:04,348 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-23 22:38:04,348 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:38:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:38:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1025167456, now seen corresponding path program 1 times [2019-11-23 22:38:04,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:38:04,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414056770] [2019-11-23 22:38:04,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:38:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:38:04,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414056770] [2019-11-23 22:38:04,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553390023] [2019-11-23 22:38:04,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:04,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 22:38:04,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:38:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-11-23 22:38:04,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:38:04,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-11-23 22:38:04,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008610418] [2019-11-23 22:38:04,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:38:04,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:38:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:38:04,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:38:04,748 INFO L87 Difference]: Start difference. First operand 2376 states and 2847 transitions. Second operand 5 states. [2019-11-23 22:38:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:38:04,967 INFO L93 Difference]: Finished difference Result 4440 states and 5345 transitions. [2019-11-23 22:38:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:38:04,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-11-23 22:38:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:38:04,971 INFO L225 Difference]: With dead ends: 4440 [2019-11-23 22:38:04,971 INFO L226 Difference]: Without dead ends: 2388 [2019-11-23 22:38:04,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:38:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-11-23 22:38:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2384. [2019-11-23 22:38:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2384 states. [2019-11-23 22:38:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2851 transitions. [2019-11-23 22:38:05,186 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 2851 transitions. Word has length 239 [2019-11-23 22:38:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:38:05,186 INFO L462 AbstractCegarLoop]: Abstraction has 2384 states and 2851 transitions. [2019-11-23 22:38:05,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:38:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2851 transitions. [2019-11-23 22:38:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-23 22:38:05,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:38:05,190 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-23 22:38:05,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:05,395 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:38:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:38:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash -142468327, now seen corresponding path program 1 times [2019-11-23 22:38:05,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:38:05,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069764295] [2019-11-23 22:38:05,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:38:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:38:05,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069764295] [2019-11-23 22:38:05,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872436144] [2019-11-23 22:38:05,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:05,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 22:38:05,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:38:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 38 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-23 22:38:06,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:38:06,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2019-11-23 22:38:06,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522425716] [2019-11-23 22:38:06,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 22:38:06,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:38:06,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 22:38:06,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-11-23 22:38:06,337 INFO L87 Difference]: Start difference. First operand 2384 states and 2851 transitions. Second operand 28 states.