/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-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:31:28,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:31:28,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:31:28,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:31:28,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:31:28,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:31:28,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:31:28,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:31:28,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:31:28,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:31:28,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:31:28,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:31:28,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:31:28,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:31:28,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:31:28,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:31:28,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:31:28,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:31:28,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:31:28,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:31:28,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:31:28,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:31:28,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:31:28,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:31:28,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:31:28,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:31:28,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:31:28,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:31:28,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:31:28,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:31:28,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:31:28,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:31:28,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:31:28,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:31:28,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:31:28,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:31:28,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:31:28,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:31:28,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:31:28,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:31:28,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:31:28,598 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:31:28,621 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:31:28,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:31:28,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:31:28,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:31:28,623 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:31:28,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:31:28,626 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:31:28,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:31:28,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:31:28,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:31:28,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:31:28,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:31:28,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:31:28,627 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:31:28,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:31:28,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:31:28,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:31:28,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:31:28,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:31:28,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:31:28,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:31:28,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:31:28,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:31:28,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:31:28,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:31:28,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:31:28,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:31:28,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:31:28,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:31:28,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:31:28,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:31:28,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:31:28,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:31:28,917 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:31:28,918 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:31:28,919 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:31:28,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed34a7dba/ee77cde7250d4f0b8d48676a18c2568b/FLAGbbce49b79 [2019-11-23 22:31:29,590 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:31:29,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:31:29,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed34a7dba/ee77cde7250d4f0b8d48676a18c2568b/FLAGbbce49b79 [2019-11-23 22:31:29,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed34a7dba/ee77cde7250d4f0b8d48676a18c2568b [2019-11-23 22:31:29,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:31:29,829 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:31:29,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:29,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:31:29,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:31:29,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:29" (1/1) ... [2019-11-23 22:31:29,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddf204a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:29, skipping insertion in model container [2019-11-23 22:31:29,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:29" (1/1) ... [2019-11-23 22:31:29,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:31:29,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:31:30,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:30,617 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:31:30,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:30,867 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:31:30,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30 WrapperNode [2019-11-23 22:31:30,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:30,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:30,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:31:30,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:31:30,882 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:31:30" (1/1) ... [2019-11-23 22:31:30,932 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:31:30" (1/1) ... [2019-11-23 22:31:31,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:31,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:31:31,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:31:31,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:31:31,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (1/1) ... [2019-11-23 22:31:31,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (1/1) ... [2019-11-23 22:31:31,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (1/1) ... [2019-11-23 22:31:31,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (1/1) ... [2019-11-23 22:31:31,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (1/1) ... [2019-11-23 22:31:31,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (1/1) ... [2019-11-23 22:31:31,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (1/1) ... [2019-11-23 22:31:31,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:31:31,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:31:31,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:31:31,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:31:31,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (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:31:31,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:31:31,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:31:32,807 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:31:32,808 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:31:32,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:32 BoogieIcfgContainer [2019-11-23 22:31:32,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:31:32,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:31:32,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:31:32,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:31:32,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:29" (1/3) ... [2019-11-23 22:31:32,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65213e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:32, skipping insertion in model container [2019-11-23 22:31:32,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:30" (2/3) ... [2019-11-23 22:31:32,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65213e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:32, skipping insertion in model container [2019-11-23 22:31:32,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:32" (3/3) ... [2019-11-23 22:31:32,826 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:31:32,837 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:31:32,847 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-23 22:31:32,861 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-23 22:31:32,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:31:32,903 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:31:32,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:31:32,903 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:31:32,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:31:32,904 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:31:32,905 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:31:32,905 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:31:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states. [2019-11-23 22:31:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-23 22:31:32,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:32,972 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:32,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 887899810, now seen corresponding path program 1 times [2019-11-23 22:31:32,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:32,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623692904] [2019-11-23 22:31:32,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:33,586 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:31:33,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623692904] [2019-11-23 22:31:33,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:33,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:33,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385231733] [2019-11-23 22:31:33,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:33,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:33,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:33,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:33,611 INFO L87 Difference]: Start difference. First operand 377 states. Second operand 3 states. [2019-11-23 22:31:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:33,880 INFO L93 Difference]: Finished difference Result 695 states and 1242 transitions. [2019-11-23 22:31:33,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:33,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-23 22:31:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:33,916 INFO L225 Difference]: With dead ends: 695 [2019-11-23 22:31:33,916 INFO L226 Difference]: Without dead ends: 567 [2019-11-23 22:31:33,923 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:31:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-11-23 22:31:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 565. [2019-11-23 22:31:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-23 22:31:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 827 transitions. [2019-11-23 22:31:34,002 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 827 transitions. Word has length 138 [2019-11-23 22:31:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:34,003 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 827 transitions. [2019-11-23 22:31:34,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 827 transitions. [2019-11-23 22:31:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-23 22:31:34,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:34,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:34,007 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 887468834, now seen corresponding path program 1 times [2019-11-23 22:31:34,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:34,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066574642] [2019-11-23 22:31:34,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:34,513 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:31:34,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066574642] [2019-11-23 22:31:34,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:34,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:34,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883781188] [2019-11-23 22:31:34,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:34,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:34,520 INFO L87 Difference]: Start difference. First operand 565 states and 827 transitions. Second operand 4 states. [2019-11-23 22:31:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:34,679 INFO L93 Difference]: Finished difference Result 1661 states and 2424 transitions. [2019-11-23 22:31:34,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:34,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-23 22:31:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:34,686 INFO L225 Difference]: With dead ends: 1661 [2019-11-23 22:31:34,687 INFO L226 Difference]: Without dead ends: 1105 [2019-11-23 22:31:34,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:31:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-11-23 22:31:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1067. [2019-11-23 22:31:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-11-23 22:31:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1558 transitions. [2019-11-23 22:31:34,782 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1558 transitions. Word has length 138 [2019-11-23 22:31:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:34,784 INFO L462 AbstractCegarLoop]: Abstraction has 1067 states and 1558 transitions. [2019-11-23 22:31:34,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1558 transitions. [2019-11-23 22:31:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-23 22:31:34,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:34,790 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:34,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash -532451178, now seen corresponding path program 1 times [2019-11-23 22:31:34,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:34,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62753012] [2019-11-23 22:31:34,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:34,882 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:31:34,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62753012] [2019-11-23 22:31:34,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:34,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:34,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731190429] [2019-11-23 22:31:34,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:34,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:34,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:34,888 INFO L87 Difference]: Start difference. First operand 1067 states and 1558 transitions. Second operand 3 states. [2019-11-23 22:31:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:34,969 INFO L93 Difference]: Finished difference Result 3163 states and 4612 transitions. [2019-11-23 22:31:34,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:34,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-23 22:31:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:34,982 INFO L225 Difference]: With dead ends: 3163 [2019-11-23 22:31:34,982 INFO L226 Difference]: Without dead ends: 2124 [2019-11-23 22:31:34,984 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:31:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2019-11-23 22:31:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1069. [2019-11-23 22:31:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-11-23 22:31:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1560 transitions. [2019-11-23 22:31:35,086 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1560 transitions. Word has length 139 [2019-11-23 22:31:35,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:35,087 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1560 transitions. [2019-11-23 22:31:35,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1560 transitions. [2019-11-23 22:31:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 22:31:35,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:35,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,098 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2071320739, now seen corresponding path program 1 times [2019-11-23 22:31:35,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:35,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530185038] [2019-11-23 22:31:35,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:35,288 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:31:35,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530185038] [2019-11-23 22:31:35,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:35,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:35,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861733339] [2019-11-23 22:31:35,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:35,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:35,291 INFO L87 Difference]: Start difference. First operand 1069 states and 1560 transitions. Second operand 4 states. [2019-11-23 22:31:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:35,397 INFO L93 Difference]: Finished difference Result 2128 states and 3106 transitions. [2019-11-23 22:31:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:35,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-23 22:31:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:35,408 INFO L225 Difference]: With dead ends: 2128 [2019-11-23 22:31:35,408 INFO L226 Difference]: Without dead ends: 1067 [2019-11-23 22:31:35,411 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:31:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-11-23 22:31:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2019-11-23 22:31:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-11-23 22:31:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1556 transitions. [2019-11-23 22:31:35,493 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1556 transitions. Word has length 140 [2019-11-23 22:31:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:35,494 INFO L462 AbstractCegarLoop]: Abstraction has 1067 states and 1556 transitions. [2019-11-23 22:31:35,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1556 transitions. [2019-11-23 22:31:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 22:31:35,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:35,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,498 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 849199791, now seen corresponding path program 1 times [2019-11-23 22:31:35,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:35,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710107369] [2019-11-23 22:31:35,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:35,616 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:31:35,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710107369] [2019-11-23 22:31:35,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:35,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:35,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836008896] [2019-11-23 22:31:35,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:35,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:35,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:35,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:35,620 INFO L87 Difference]: Start difference. First operand 1067 states and 1556 transitions. Second operand 3 states. [2019-11-23 22:31:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:35,805 INFO L93 Difference]: Finished difference Result 2490 states and 3636 transitions. [2019-11-23 22:31:35,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:35,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-23 22:31:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:35,816 INFO L225 Difference]: With dead ends: 2490 [2019-11-23 22:31:35,817 INFO L226 Difference]: Without dead ends: 1597 [2019-11-23 22:31:35,819 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:31:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2019-11-23 22:31:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1559. [2019-11-23 22:31:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2019-11-23 22:31:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2249 transitions. [2019-11-23 22:31:35,969 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2249 transitions. Word has length 140 [2019-11-23 22:31:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:35,970 INFO L462 AbstractCegarLoop]: Abstraction has 1559 states and 2249 transitions. [2019-11-23 22:31:35,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2249 transitions. [2019-11-23 22:31:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 22:31:35,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:35,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,974 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash -591962275, now seen corresponding path program 1 times [2019-11-23 22:31:35,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:35,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282499739] [2019-11-23 22:31:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:36,152 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:31:36,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282499739] [2019-11-23 22:31:36,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:36,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:31:36,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892004394] [2019-11-23 22:31:36,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:31:36,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:36,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:31:36,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:31:36,155 INFO L87 Difference]: Start difference. First operand 1559 states and 2249 transitions. Second operand 8 states. [2019-11-23 22:31:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:37,202 INFO L93 Difference]: Finished difference Result 4510 states and 6806 transitions. [2019-11-23 22:31:37,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:31:37,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2019-11-23 22:31:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:37,219 INFO L225 Difference]: With dead ends: 4510 [2019-11-23 22:31:37,220 INFO L226 Difference]: Without dead ends: 3149 [2019-11-23 22:31:37,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:31:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2019-11-23 22:31:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 1926. [2019-11-23 22:31:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-11-23 22:31:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2798 transitions. [2019-11-23 22:31:37,361 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2798 transitions. Word has length 143 [2019-11-23 22:31:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:37,362 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 2798 transitions. [2019-11-23 22:31:37,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:31:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2798 transitions. [2019-11-23 22:31:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 22:31:37,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:37,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:37,366 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:37,367 INFO L82 PathProgramCache]: Analyzing trace with hash -515276919, now seen corresponding path program 1 times [2019-11-23 22:31:37,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:37,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127442639] [2019-11-23 22:31:37,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:37,578 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:31:37,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127442639] [2019-11-23 22:31:37,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:37,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:37,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689590797] [2019-11-23 22:31:37,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:37,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:37,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:37,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:37,581 INFO L87 Difference]: Start difference. First operand 1926 states and 2798 transitions. Second operand 4 states. [2019-11-23 22:31:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:37,927 INFO L93 Difference]: Finished difference Result 5085 states and 7386 transitions. [2019-11-23 22:31:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:37,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 22:31:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:37,948 INFO L225 Difference]: With dead ends: 5085 [2019-11-23 22:31:37,948 INFO L226 Difference]: Without dead ends: 3178 [2019-11-23 22:31:37,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:31:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2019-11-23 22:31:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 3148. [2019-11-23 22:31:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-11-23 22:31:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4538 transitions. [2019-11-23 22:31:38,224 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4538 transitions. Word has length 143 [2019-11-23 22:31:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:38,225 INFO L462 AbstractCegarLoop]: Abstraction has 3148 states and 4538 transitions. [2019-11-23 22:31:38,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4538 transitions. [2019-11-23 22:31:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 22:31:38,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:38,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,230 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1576838573, now seen corresponding path program 1 times [2019-11-23 22:31:38,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:38,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495067710] [2019-11-23 22:31:38,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:38,439 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:31:38,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495067710] [2019-11-23 22:31:38,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:38,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:38,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576714152] [2019-11-23 22:31:38,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:38,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:38,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:38,443 INFO L87 Difference]: Start difference. First operand 3148 states and 4538 transitions. Second operand 4 states. [2019-11-23 22:31:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:38,734 INFO L93 Difference]: Finished difference Result 5714 states and 8271 transitions. [2019-11-23 22:31:38,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:38,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-23 22:31:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:38,753 INFO L225 Difference]: With dead ends: 5714 [2019-11-23 22:31:38,753 INFO L226 Difference]: Without dead ends: 3148 [2019-11-23 22:31:38,758 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:31:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2019-11-23 22:31:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3148. [2019-11-23 22:31:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-11-23 22:31:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4537 transitions. [2019-11-23 22:31:38,982 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4537 transitions. Word has length 145 [2019-11-23 22:31:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:38,983 INFO L462 AbstractCegarLoop]: Abstraction has 3148 states and 4537 transitions. [2019-11-23 22:31:38,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4537 transitions. [2019-11-23 22:31:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 22:31:38,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,989 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:38,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:38,990 INFO L82 PathProgramCache]: Analyzing trace with hash -36323990, now seen corresponding path program 1 times [2019-11-23 22:31:38,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:38,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425434732] [2019-11-23 22:31:38,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:39,115 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:31:39,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425434732] [2019-11-23 22:31:39,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:39,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:39,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433564084] [2019-11-23 22:31:39,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:39,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:39,118 INFO L87 Difference]: Start difference. First operand 3148 states and 4537 transitions. Second operand 3 states. [2019-11-23 22:31:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:39,455 INFO L93 Difference]: Finished difference Result 7638 states and 11056 transitions. [2019-11-23 22:31:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:39,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-23 22:31:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:39,478 INFO L225 Difference]: With dead ends: 7638 [2019-11-23 22:31:39,478 INFO L226 Difference]: Without dead ends: 4813 [2019-11-23 22:31:39,483 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:31:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2019-11-23 22:31:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4787. [2019-11-23 22:31:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4787 states. [2019-11-23 22:31:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4787 states and 6815 transitions. [2019-11-23 22:31:39,837 INFO L78 Accepts]: Start accepts. Automaton has 4787 states and 6815 transitions. Word has length 145 [2019-11-23 22:31:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:39,837 INFO L462 AbstractCegarLoop]: Abstraction has 4787 states and 6815 transitions. [2019-11-23 22:31:39,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4787 states and 6815 transitions. [2019-11-23 22:31:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:31:39,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:39,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash 13532919, now seen corresponding path program 1 times [2019-11-23 22:31:39,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:39,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007751241] [2019-11-23 22:31:39,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:40,071 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:31:40,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007751241] [2019-11-23 22:31:40,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:40,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:31:40,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102542754] [2019-11-23 22:31:40,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:31:40,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:40,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:31:40,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:40,074 INFO L87 Difference]: Start difference. First operand 4787 states and 6815 transitions. Second operand 9 states. [2019-11-23 22:31:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:41,954 INFO L93 Difference]: Finished difference Result 16562 states and 24543 transitions. [2019-11-23 22:31:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:31:41,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2019-11-23 22:31:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:41,996 INFO L225 Difference]: With dead ends: 16562 [2019-11-23 22:31:41,997 INFO L226 Difference]: Without dead ends: 12142 [2019-11-23 22:31:42,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:31:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12142 states. [2019-11-23 22:31:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12142 to 8568. [2019-11-23 22:31:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8568 states. [2019-11-23 22:31:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8568 states to 8568 states and 12516 transitions. [2019-11-23 22:31:42,635 INFO L78 Accepts]: Start accepts. Automaton has 8568 states and 12516 transitions. Word has length 148 [2019-11-23 22:31:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:42,636 INFO L462 AbstractCegarLoop]: Abstraction has 8568 states and 12516 transitions. [2019-11-23 22:31:42,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:31:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8568 states and 12516 transitions. [2019-11-23 22:31:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:31:42,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:42,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,642 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash -335963353, now seen corresponding path program 1 times [2019-11-23 22:31:42,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:42,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238323544] [2019-11-23 22:31:42,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:42,812 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:31:42,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238323544] [2019-11-23 22:31:42,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:42,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:42,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842795872] [2019-11-23 22:31:42,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:42,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:42,815 INFO L87 Difference]: Start difference. First operand 8568 states and 12516 transitions. Second operand 4 states. [2019-11-23 22:31:43,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:43,716 INFO L93 Difference]: Finished difference Result 25108 states and 36723 transitions. [2019-11-23 22:31:43,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:43,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 22:31:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:43,749 INFO L225 Difference]: With dead ends: 25108 [2019-11-23 22:31:43,750 INFO L226 Difference]: Without dead ends: 16579 [2019-11-23 22:31:43,761 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:31:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-11-23 22:31:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 16525. [2019-11-23 22:31:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16525 states. [2019-11-23 22:31:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 24013 transitions. [2019-11-23 22:31:45,020 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 24013 transitions. Word has length 148 [2019-11-23 22:31:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:45,020 INFO L462 AbstractCegarLoop]: Abstraction has 16525 states and 24013 transitions. [2019-11-23 22:31:45,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 24013 transitions. [2019-11-23 22:31:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:31:45,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:45,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:45,030 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash -93849763, now seen corresponding path program 1 times [2019-11-23 22:31:45,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:45,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274531376] [2019-11-23 22:31:45,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:45,080 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:31:45,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274531376] [2019-11-23 22:31:45,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:45,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:45,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316951240] [2019-11-23 22:31:45,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:45,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:45,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:45,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:45,083 INFO L87 Difference]: Start difference. First operand 16525 states and 24013 transitions. Second operand 3 states. [2019-11-23 22:31:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:47,206 INFO L93 Difference]: Finished difference Result 49391 states and 71798 transitions. [2019-11-23 22:31:47,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:47,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-23 22:31:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:47,271 INFO L225 Difference]: With dead ends: 49391 [2019-11-23 22:31:47,272 INFO L226 Difference]: Without dead ends: 32967 [2019-11-23 22:31:47,296 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:31:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32967 states. [2019-11-23 22:31:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32967 to 16531. [2019-11-23 22:31:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16531 states. [2019-11-23 22:31:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16531 states to 16531 states and 24019 transitions. [2019-11-23 22:31:48,378 INFO L78 Accepts]: Start accepts. Automaton has 16531 states and 24019 transitions. Word has length 149 [2019-11-23 22:31:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:48,378 INFO L462 AbstractCegarLoop]: Abstraction has 16531 states and 24019 transitions. [2019-11-23 22:31:48,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16531 states and 24019 transitions. [2019-11-23 22:31:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:31:48,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:48,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,389 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1045318616, now seen corresponding path program 1 times [2019-11-23 22:31:48,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:48,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994848567] [2019-11-23 22:31:48,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:48,517 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:31:48,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994848567] [2019-11-23 22:31:48,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:48,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:48,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445498217] [2019-11-23 22:31:48,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:48,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:48,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:48,520 INFO L87 Difference]: Start difference. First operand 16531 states and 24019 transitions. Second operand 4 states. [2019-11-23 22:31:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:49,406 INFO L93 Difference]: Finished difference Result 32959 states and 47904 transitions. [2019-11-23 22:31:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:49,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 22:31:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:49,434 INFO L225 Difference]: With dead ends: 32959 [2019-11-23 22:31:49,434 INFO L226 Difference]: Without dead ends: 16531 [2019-11-23 22:31:49,459 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:31:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16531 states. [2019-11-23 22:31:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16531 to 16528. [2019-11-23 22:31:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16528 states. [2019-11-23 22:31:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16528 states to 16528 states and 24012 transitions. [2019-11-23 22:31:50,471 INFO L78 Accepts]: Start accepts. Automaton has 16528 states and 24012 transitions. Word has length 150 [2019-11-23 22:31:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:50,471 INFO L462 AbstractCegarLoop]: Abstraction has 16528 states and 24012 transitions. [2019-11-23 22:31:50,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 16528 states and 24012 transitions. [2019-11-23 22:31:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:31:50,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:50,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:50,478 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2121370024, now seen corresponding path program 1 times [2019-11-23 22:31:50,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:50,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125076147] [2019-11-23 22:31:50,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:50,560 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:31:50,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125076147] [2019-11-23 22:31:50,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:50,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:50,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919781529] [2019-11-23 22:31:50,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:50,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:50,565 INFO L87 Difference]: Start difference. First operand 16528 states and 24012 transitions. Second operand 3 states. [2019-11-23 22:31:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:53,473 INFO L93 Difference]: Finished difference Result 48107 states and 70081 transitions. [2019-11-23 22:31:53,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:53,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 22:31:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:53,519 INFO L225 Difference]: With dead ends: 48107 [2019-11-23 22:31:53,519 INFO L226 Difference]: Without dead ends: 32253 [2019-11-23 22:31:53,541 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:31:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32253 states. [2019-11-23 22:31:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32253 to 32199. [2019-11-23 22:31:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32199 states. [2019-11-23 22:31:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32199 states to 32199 states and 46495 transitions. [2019-11-23 22:31:55,786 INFO L78 Accepts]: Start accepts. Automaton has 32199 states and 46495 transitions. Word has length 150 [2019-11-23 22:31:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:55,787 INFO L462 AbstractCegarLoop]: Abstraction has 32199 states and 46495 transitions. [2019-11-23 22:31:55,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32199 states and 46495 transitions. [2019-11-23 22:31:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:31:55,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:55,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:55,800 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash -784530635, now seen corresponding path program 1 times [2019-11-23 22:31:55,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:55,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944155203] [2019-11-23 22:31:55,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:55,925 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:31:55,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944155203] [2019-11-23 22:31:55,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:55,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:55,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582724029] [2019-11-23 22:31:55,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:55,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:55,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:55,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:55,928 INFO L87 Difference]: Start difference. First operand 32199 states and 46495 transitions. Second operand 4 states. [2019-11-23 22:31:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:58,139 INFO L93 Difference]: Finished difference Result 56208 states and 81122 transitions. [2019-11-23 22:31:58,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:58,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 22:31:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:58,163 INFO L225 Difference]: With dead ends: 56208 [2019-11-23 22:31:58,163 INFO L226 Difference]: Without dead ends: 24621 [2019-11-23 22:31:58,182 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:31:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-11-23 22:32:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 24621. [2019-11-23 22:32:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-11-23 22:32:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 35341 transitions. [2019-11-23 22:32:00,301 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 35341 transitions. Word has length 150 [2019-11-23 22:32:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:00,301 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 35341 transitions. [2019-11-23 22:32:00,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 35341 transitions. [2019-11-23 22:32:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:32:00,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:00,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:00,308 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash -640175235, now seen corresponding path program 1 times [2019-11-23 22:32:00,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:00,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168681504] [2019-11-23 22:32:00,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:00,548 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:32:00,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168681504] [2019-11-23 22:32:00,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:00,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:00,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294759680] [2019-11-23 22:32:00,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:32:00,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:32:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:32:00,552 INFO L87 Difference]: Start difference. First operand 24621 states and 35341 transitions. Second operand 8 states. [2019-11-23 22:32:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:02,995 INFO L93 Difference]: Finished difference Result 55963 states and 82255 transitions. [2019-11-23 22:32:02,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:02,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-11-23 22:32:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:03,035 INFO L225 Difference]: With dead ends: 55963 [2019-11-23 22:32:03,035 INFO L226 Difference]: Without dead ends: 38640 [2019-11-23 22:32:03,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38640 states. [2019-11-23 22:32:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38640 to 38638. [2019-11-23 22:32:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38638 states. [2019-11-23 22:32:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38638 states to 38638 states and 55530 transitions. [2019-11-23 22:32:05,326 INFO L78 Accepts]: Start accepts. Automaton has 38638 states and 55530 transitions. Word has length 156 [2019-11-23 22:32:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:05,326 INFO L462 AbstractCegarLoop]: Abstraction has 38638 states and 55530 transitions. [2019-11-23 22:32:05,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:32:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 38638 states and 55530 transitions. [2019-11-23 22:32:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:32:05,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:05,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:05,336 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1306625693, now seen corresponding path program 1 times [2019-11-23 22:32:05,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:05,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507677124] [2019-11-23 22:32:05,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:05,467 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:32:05,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507677124] [2019-11-23 22:32:05,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:05,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:05,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624893] [2019-11-23 22:32:05,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:05,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:05,469 INFO L87 Difference]: Start difference. First operand 38638 states and 55530 transitions. Second operand 4 states. [2019-11-23 22:32:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:07,759 INFO L93 Difference]: Finished difference Result 49156 states and 71695 transitions. [2019-11-23 22:32:07,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:07,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-23 22:32:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:07,785 INFO L225 Difference]: With dead ends: 49156 [2019-11-23 22:32:07,785 INFO L226 Difference]: Without dead ends: 26486 [2019-11-23 22:32:07,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26486 states. [2019-11-23 22:32:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26486 to 26484. [2019-11-23 22:32:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26484 states. [2019-11-23 22:32:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26484 states to 26484 states and 36769 transitions. [2019-11-23 22:32:10,179 INFO L78 Accepts]: Start accepts. Automaton has 26484 states and 36769 transitions. Word has length 156 [2019-11-23 22:32:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:10,179 INFO L462 AbstractCegarLoop]: Abstraction has 26484 states and 36769 transitions. [2019-11-23 22:32:10,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 26484 states and 36769 transitions. [2019-11-23 22:32:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:32:10,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:10,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:10,190 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:10,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2144490868, now seen corresponding path program 1 times [2019-11-23 22:32:10,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:10,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231615718] [2019-11-23 22:32:10,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:11,679 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:32:11,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231615718] [2019-11-23 22:32:11,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:11,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-23 22:32:11,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611765032] [2019-11-23 22:32:11,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 22:32:11,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 22:32:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:32:11,681 INFO L87 Difference]: Start difference. First operand 26484 states and 36769 transitions. Second operand 22 states. [2019-11-23 22:32:12,156 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-23 22:32:12,304 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-23 22:32:12,552 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-23 22:32:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:18,121 INFO L93 Difference]: Finished difference Result 59127 states and 82776 transitions. [2019-11-23 22:32:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:32:18,121 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 156 [2019-11-23 22:32:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:18,155 INFO L225 Difference]: With dead ends: 59127 [2019-11-23 22:32:18,155 INFO L226 Difference]: Without dead ends: 40167 [2019-11-23 22:32:18,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=343, Invalid=917, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:32:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40167 states. [2019-11-23 22:32:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40167 to 36117. [2019-11-23 22:32:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36117 states. [2019-11-23 22:32:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36117 states to 36117 states and 49615 transitions. [2019-11-23 22:32:20,393 INFO L78 Accepts]: Start accepts. Automaton has 36117 states and 49615 transitions. Word has length 156 [2019-11-23 22:32:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:20,394 INFO L462 AbstractCegarLoop]: Abstraction has 36117 states and 49615 transitions. [2019-11-23 22:32:20,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 22:32:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36117 states and 49615 transitions. [2019-11-23 22:32:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:32:20,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:20,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:20,411 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash 204266211, now seen corresponding path program 1 times [2019-11-23 22:32:20,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:20,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988141108] [2019-11-23 22:32:20,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:20,562 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:32:20,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988141108] [2019-11-23 22:32:20,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:20,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:20,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627893691] [2019-11-23 22:32:20,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:20,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:20,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:20,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:20,565 INFO L87 Difference]: Start difference. First operand 36117 states and 49615 transitions. Second operand 4 states. [2019-11-23 22:32:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:23,102 INFO L93 Difference]: Finished difference Result 57949 states and 79384 transitions. [2019-11-23 22:32:23,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:23,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-23 22:32:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:23,130 INFO L225 Difference]: With dead ends: 57949 [2019-11-23 22:32:23,130 INFO L226 Difference]: Without dead ends: 32240 [2019-11-23 22:32:23,144 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:32:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32240 states. [2019-11-23 22:32:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32240 to 32147. [2019-11-23 22:32:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32147 states. [2019-11-23 22:32:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32147 states to 32147 states and 44049 transitions. [2019-11-23 22:32:25,035 INFO L78 Accepts]: Start accepts. Automaton has 32147 states and 44049 transitions. Word has length 156 [2019-11-23 22:32:25,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:25,035 INFO L462 AbstractCegarLoop]: Abstraction has 32147 states and 44049 transitions. [2019-11-23 22:32:25,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32147 states and 44049 transitions. [2019-11-23 22:32:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:32:25,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:25,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:25,044 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1193908090, now seen corresponding path program 1 times [2019-11-23 22:32:25,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:25,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102398649] [2019-11-23 22:32:25,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:26,079 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:32:26,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102398649] [2019-11-23 22:32:26,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:26,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:26,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466105450] [2019-11-23 22:32:26,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:26,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:26,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:26,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:26,081 INFO L87 Difference]: Start difference. First operand 32147 states and 44049 transitions. Second operand 4 states. [2019-11-23 22:32:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:28,068 INFO L93 Difference]: Finished difference Result 64429 states and 88252 transitions. [2019-11-23 22:32:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:28,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-23 22:32:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:28,100 INFO L225 Difference]: With dead ends: 64429 [2019-11-23 22:32:28,101 INFO L226 Difference]: Without dead ends: 32431 [2019-11-23 22:32:28,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:32:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32431 states. [2019-11-23 22:32:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32431 to 32274. [2019-11-23 22:32:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32274 states. [2019-11-23 22:32:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32274 states to 32274 states and 44187 transitions. [2019-11-23 22:32:30,222 INFO L78 Accepts]: Start accepts. Automaton has 32274 states and 44187 transitions. Word has length 158 [2019-11-23 22:32:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:30,222 INFO L462 AbstractCegarLoop]: Abstraction has 32274 states and 44187 transitions. [2019-11-23 22:32:30,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32274 states and 44187 transitions. [2019-11-23 22:32:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:32:30,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:30,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:30,231 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:30,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1172097384, now seen corresponding path program 1 times [2019-11-23 22:32:30,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:30,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268568935] [2019-11-23 22:32:30,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:30,274 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:32:30,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268568935] [2019-11-23 22:32:30,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:30,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:30,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457328322] [2019-11-23 22:32:30,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:30,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:30,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:30,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:30,277 INFO L87 Difference]: Start difference. First operand 32274 states and 44187 transitions. Second operand 3 states. [2019-11-23 22:32:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:34,314 INFO L93 Difference]: Finished difference Result 88467 states and 121201 transitions. [2019-11-23 22:32:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:34,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-23 22:32:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:34,372 INFO L225 Difference]: With dead ends: 88467 [2019-11-23 22:32:34,372 INFO L226 Difference]: Without dead ends: 64350 [2019-11-23 22:32:34,386 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:32:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64350 states. [2019-11-23 22:32:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64350 to 32284. [2019-11-23 22:32:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-11-23 22:32:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 44197 transitions. [2019-11-23 22:32:36,866 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 44197 transitions. Word has length 159 [2019-11-23 22:32:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:36,866 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 44197 transitions. [2019-11-23 22:32:36,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 44197 transitions. [2019-11-23 22:32:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:32:36,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:36,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:36,876 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:36,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1535598043, now seen corresponding path program 1 times [2019-11-23 22:32:36,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:36,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406466747] [2019-11-23 22:32:36,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:37,380 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:32:37,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406466747] [2019-11-23 22:32:37,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:37,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-23 22:32:37,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228818287] [2019-11-23 22:32:37,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 22:32:37,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 22:32:37,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:32:37,387 INFO L87 Difference]: Start difference. First operand 32284 states and 44197 transitions. Second operand 16 states. [2019-11-23 22:32:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:46,438 INFO L93 Difference]: Finished difference Result 96413 states and 135066 transitions. [2019-11-23 22:32:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 22:32:46,441 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 160 [2019-11-23 22:32:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:46,527 INFO L225 Difference]: With dead ends: 96413 [2019-11-23 22:32:46,527 INFO L226 Difference]: Without dead ends: 85573 [2019-11-23 22:32:46,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=314, Invalid=808, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:32:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85573 states. [2019-11-23 22:32:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85573 to 48351. [2019-11-23 22:32:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48351 states. [2019-11-23 22:32:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48351 states to 48351 states and 65625 transitions. [2019-11-23 22:32:50,576 INFO L78 Accepts]: Start accepts. Automaton has 48351 states and 65625 transitions. Word has length 160 [2019-11-23 22:32:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:50,576 INFO L462 AbstractCegarLoop]: Abstraction has 48351 states and 65625 transitions. [2019-11-23 22:32:50,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 22:32:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 48351 states and 65625 transitions. [2019-11-23 22:32:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:32:50,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:50,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:50,594 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1572007806, now seen corresponding path program 1 times [2019-11-23 22:32:50,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:50,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172111599] [2019-11-23 22:32:50,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:50,771 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:32:50,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172111599] [2019-11-23 22:32:50,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:50,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:32:50,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475309403] [2019-11-23 22:32:50,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:32:50,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:32:50,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:32:50,773 INFO L87 Difference]: Start difference. First operand 48351 states and 65625 transitions. Second operand 8 states.