/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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:32:17,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:32:17,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:32:17,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:32:17,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:32:17,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:32:17,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:32:17,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:32:17,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:32:17,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:32:17,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:32:17,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:32:17,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:32:17,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:32:17,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:32:17,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:32:17,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:32:17,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:32:17,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:32:17,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:32:17,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:32:17,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:32:17,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:32:17,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:32:17,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:32:17,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:32:17,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:32:17,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:32:17,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:32:17,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:32:17,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:32:17,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:32:17,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:32:17,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:32:17,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:32:17,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:32:17,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:32:17,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:32:17,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:32:17,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:32:17,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:32:17,540 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:32:17,559 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:32:17,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:32:17,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:32:17,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:32:17,564 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:32:17,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:32:17,564 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:32:17,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:32:17,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:32:17,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:32:17,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:32:17,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:32:17,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:32:17,567 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:32:17,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:32:17,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:32:17,567 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:32:17,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:32:17,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:32:17,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:32:17,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:32:17,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:32:17,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:17,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:32:17,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:32:17,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:32:17,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:32:17,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:32:17,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:32:17,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:32:17,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:32:17,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:32:17,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:32:17,850 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:32:17,850 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:32:17,851 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+nlh-reducer.c [2019-11-23 22:32:17,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a65d4e3d/cf8ffd8d3d6a45caae65f170765529da/FLAG7014ca6dd [2019-11-23 22:32:18,487 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:32:18,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:32:18,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a65d4e3d/cf8ffd8d3d6a45caae65f170765529da/FLAG7014ca6dd [2019-11-23 22:32:18,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a65d4e3d/cf8ffd8d3d6a45caae65f170765529da [2019-11-23 22:32:18,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:32:18,767 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:32:18,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:18,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:32:18,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:32:18,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:18" (1/1) ... [2019-11-23 22:32:18,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdbfed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:18, skipping insertion in model container [2019-11-23 22:32:18,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:18" (1/1) ... [2019-11-23 22:32:18,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:32:18,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:32:19,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:19,384 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:32:19,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:19,552 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:32:19,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19 WrapperNode [2019-11-23 22:32:19,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:19,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:19,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:32:19,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:32:19,561 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:32:19" (1/1) ... [2019-11-23 22:32:19,578 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:32:19" (1/1) ... [2019-11-23 22:32:19,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:19,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:32:19,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:32:19,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:32:19,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2019-11-23 22:32:19,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2019-11-23 22:32:19,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2019-11-23 22:32:19,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2019-11-23 22:32:19,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2019-11-23 22:32:19,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2019-11-23 22:32:19,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2019-11-23 22:32:19,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:32:19,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:32:19,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:32:19,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:32:19,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (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:32:19,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:32:19,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:32:21,302 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:32:21,303 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:32:21,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:21 BoogieIcfgContainer [2019-11-23 22:32:21,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:32:21,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:32:21,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:32:21,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:32:21,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:18" (1/3) ... [2019-11-23 22:32:21,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcec33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:21, skipping insertion in model container [2019-11-23 22:32:21,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (2/3) ... [2019-11-23 22:32:21,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcec33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:21, skipping insertion in model container [2019-11-23 22:32:21,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:21" (3/3) ... [2019-11-23 22:32:21,315 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:32:21,323 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:32:21,331 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:32:21,343 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:32:21,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:32:21,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:32:21,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:32:21,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:32:21,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:32:21,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:32:21,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:32:21,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:32:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states. [2019-11-23 22:32:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 22:32:21,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:21,442 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:32:21,443 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1732515754, now seen corresponding path program 1 times [2019-11-23 22:32:21,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:21,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566402421] [2019-11-23 22:32:21,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:22,275 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:22,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566402421] [2019-11-23 22:32:22,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:22,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:22,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308930022] [2019-11-23 22:32:22,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:22,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:22,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:22,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:22,305 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 4 states. [2019-11-23 22:32:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:22,508 INFO L93 Difference]: Finished difference Result 877 states and 1562 transitions. [2019-11-23 22:32:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:22,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 22:32:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:22,538 INFO L225 Difference]: With dead ends: 877 [2019-11-23 22:32:22,538 INFO L226 Difference]: Without dead ends: 579 [2019-11-23 22:32:22,546 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:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-11-23 22:32:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 577. [2019-11-23 22:32:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-23 22:32:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 836 transitions. [2019-11-23 22:32:22,667 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 836 transitions. Word has length 143 [2019-11-23 22:32:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:22,668 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 836 transitions. [2019-11-23 22:32:22,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 836 transitions. [2019-11-23 22:32:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 22:32:22,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:22,682 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] [2019-11-23 22:32:22,683 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1916078526, now seen corresponding path program 1 times [2019-11-23 22:32:22,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:22,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39457025] [2019-11-23 22:32:22,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:22,834 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:22,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39457025] [2019-11-23 22:32:22,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:22,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257938413] [2019-11-23 22:32:22,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:22,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:22,840 INFO L87 Difference]: Start difference. First operand 577 states and 836 transitions. Second operand 3 states. [2019-11-23 22:32:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:22,889 INFO L93 Difference]: Finished difference Result 1693 states and 2446 transitions. [2019-11-23 22:32:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:22,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-23 22:32:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:22,896 INFO L225 Difference]: With dead ends: 1693 [2019-11-23 22:32:22,896 INFO L226 Difference]: Without dead ends: 1144 [2019-11-23 22:32:22,902 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:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-11-23 22:32:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 579. [2019-11-23 22:32:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-11-23 22:32:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 838 transitions. [2019-11-23 22:32:22,937 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 838 transitions. Word has length 144 [2019-11-23 22:32:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:22,938 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 838 transitions. [2019-11-23 22:32:22,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 838 transitions. [2019-11-23 22:32:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 22:32:22,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:22,941 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:32:22,941 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash 372219765, now seen corresponding path program 1 times [2019-11-23 22:32:22,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:22,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186750917] [2019-11-23 22:32:22,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:23,132 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:23,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186750917] [2019-11-23 22:32:23,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:23,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:23,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195754870] [2019-11-23 22:32:23,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:23,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:23,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:23,135 INFO L87 Difference]: Start difference. First operand 579 states and 838 transitions. Second operand 4 states. [2019-11-23 22:32:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:23,187 INFO L93 Difference]: Finished difference Result 1148 states and 1662 transitions. [2019-11-23 22:32:23,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:23,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-23 22:32:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:23,191 INFO L225 Difference]: With dead ends: 1148 [2019-11-23 22:32:23,191 INFO L226 Difference]: Without dead ends: 577 [2019-11-23 22:32:23,192 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,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-23 22:32:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-11-23 22:32:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-23 22:32:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 834 transitions. [2019-11-23 22:32:23,217 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 834 transitions. Word has length 145 [2019-11-23 22:32:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:23,217 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 834 transitions. [2019-11-23 22:32:23,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 834 transitions. [2019-11-23 22:32:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 22:32:23,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:23,220 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:32:23,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1318569504, now seen corresponding path program 1 times [2019-11-23 22:32:23,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:23,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989033558] [2019-11-23 22:32:23,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:23,311 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:23,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989033558] [2019-11-23 22:32:23,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:23,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:23,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712882151] [2019-11-23 22:32:23,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:23,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:23,314 INFO L87 Difference]: Start difference. First operand 577 states and 834 transitions. Second operand 3 states. [2019-11-23 22:32:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:23,412 INFO L93 Difference]: Finished difference Result 1255 states and 1826 transitions. [2019-11-23 22:32:23,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:23,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-23 22:32:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:23,420 INFO L225 Difference]: With dead ends: 1255 [2019-11-23 22:32:23,420 INFO L226 Difference]: Without dead ends: 852 [2019-11-23 22:32:23,422 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:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-11-23 22:32:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 850. [2019-11-23 22:32:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-11-23 22:32:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1214 transitions. [2019-11-23 22:32:23,475 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1214 transitions. Word has length 145 [2019-11-23 22:32:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:23,477 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1214 transitions. [2019-11-23 22:32:23,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1214 transitions. [2019-11-23 22:32:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:32:23,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:23,480 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:32:23,481 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash -58966724, now seen corresponding path program 1 times [2019-11-23 22:32:23,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:23,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671049175] [2019-11-23 22:32:23,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:23,786 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:23,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671049175] [2019-11-23 22:32:23,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:23,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:23,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786817779] [2019-11-23 22:32:23,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:23,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:23,789 INFO L87 Difference]: Start difference. First operand 850 states and 1214 transitions. Second operand 9 states. [2019-11-23 22:32:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:25,220 INFO L93 Difference]: Finished difference Result 2994 states and 4526 transitions. [2019-11-23 22:32:25,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:32:25,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2019-11-23 22:32:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:25,233 INFO L225 Difference]: With dead ends: 2994 [2019-11-23 22:32:25,235 INFO L226 Difference]: Without dead ends: 2342 [2019-11-23 22:32:25,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:32:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2019-11-23 22:32:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1695. [2019-11-23 22:32:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-11-23 22:32:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2484 transitions. [2019-11-23 22:32:25,357 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2484 transitions. Word has length 148 [2019-11-23 22:32:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:25,359 INFO L462 AbstractCegarLoop]: Abstraction has 1695 states and 2484 transitions. [2019-11-23 22:32:25,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2484 transitions. [2019-11-23 22:32:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:32:25,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:25,362 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:32:25,362 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash -598721762, now seen corresponding path program 1 times [2019-11-23 22:32:25,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:25,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202486627] [2019-11-23 22:32:25,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:25,536 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:25,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202486627] [2019-11-23 22:32:25,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:25,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:25,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547576158] [2019-11-23 22:32:25,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:25,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:25,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:25,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:25,539 INFO L87 Difference]: Start difference. First operand 1695 states and 2484 transitions. Second operand 4 states. [2019-11-23 22:32:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:25,759 INFO L93 Difference]: Finished difference Result 2851 states and 4355 transitions. [2019-11-23 22:32:25,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:25,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 22:32:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:25,773 INFO L225 Difference]: With dead ends: 2851 [2019-11-23 22:32:25,773 INFO L226 Difference]: Without dead ends: 1999 [2019-11-23 22:32:25,777 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:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-11-23 22:32:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1997. [2019-11-23 22:32:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-11-23 22:32:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2958 transitions. [2019-11-23 22:32:25,911 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2958 transitions. Word has length 148 [2019-11-23 22:32:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:25,913 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 2958 transitions. [2019-11-23 22:32:25,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2958 transitions. [2019-11-23 22:32:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:32:25,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:25,916 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:32:25,917 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1227455278, now seen corresponding path program 1 times [2019-11-23 22:32:25,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:25,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575288320] [2019-11-23 22:32:25,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:26,082 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,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575288320] [2019-11-23 22:32:26,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:26,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:26,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240987532] [2019-11-23 22:32:26,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:26,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:26,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:26,095 INFO L87 Difference]: Start difference. First operand 1997 states and 2958 transitions. Second operand 4 states. [2019-11-23 22:32:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:26,388 INFO L93 Difference]: Finished difference Result 5171 states and 7653 transitions. [2019-11-23 22:32:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:26,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 22:32:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:26,403 INFO L225 Difference]: With dead ends: 5171 [2019-11-23 22:32:26,403 INFO L226 Difference]: Without dead ends: 3193 [2019-11-23 22:32:26,406 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:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-11-23 22:32:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-11-23 22:32:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-11-23 22:32:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4675 transitions. [2019-11-23 22:32:26,623 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4675 transitions. Word has length 148 [2019-11-23 22:32:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:26,624 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4675 transitions. [2019-11-23 22:32:26,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4675 transitions. [2019-11-23 22:32:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:32:26,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:26,629 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:32:26,629 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:26,629 INFO L82 PathProgramCache]: Analyzing trace with hash -729321734, now seen corresponding path program 1 times [2019-11-23 22:32:26,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:26,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25947978] [2019-11-23 22:32:26,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:26,739 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,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25947978] [2019-11-23 22:32:26,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:26,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:26,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557326906] [2019-11-23 22:32:26,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:26,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:26,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:26,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:26,741 INFO L87 Difference]: Start difference. First operand 3191 states and 4675 transitions. Second operand 3 states. [2019-11-23 22:32:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:27,168 INFO L93 Difference]: Finished difference Result 8933 states and 13185 transitions. [2019-11-23 22:32:27,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:27,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 22:32:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:27,195 INFO L225 Difference]: With dead ends: 8933 [2019-11-23 22:32:27,195 INFO L226 Difference]: Without dead ends: 6069 [2019-11-23 22:32:27,200 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:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2019-11-23 22:32:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 6067. [2019-11-23 22:32:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6067 states. [2019-11-23 22:32:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6067 states to 6067 states and 8840 transitions. [2019-11-23 22:32:27,657 INFO L78 Accepts]: Start accepts. Automaton has 6067 states and 8840 transitions. Word has length 150 [2019-11-23 22:32:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:27,658 INFO L462 AbstractCegarLoop]: Abstraction has 6067 states and 8840 transitions. [2019-11-23 22:32:27,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 6067 states and 8840 transitions. [2019-11-23 22:32:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:32:27,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:27,668 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:32:27,668 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:27,668 INFO L82 PathProgramCache]: Analyzing trace with hash -221890409, now seen corresponding path program 1 times [2019-11-23 22:32:27,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:27,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462898881] [2019-11-23 22:32:27,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:27,791 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:27,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462898881] [2019-11-23 22:32:27,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:27,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:27,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740550804] [2019-11-23 22:32:27,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:27,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:27,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:27,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:27,794 INFO L87 Difference]: Start difference. First operand 6067 states and 8840 transitions. Second operand 4 states. [2019-11-23 22:32:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:28,063 INFO L93 Difference]: Finished difference Result 9609 states and 14013 transitions. [2019-11-23 22:32:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:28,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 22:32:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:28,086 INFO L225 Difference]: With dead ends: 9609 [2019-11-23 22:32:28,086 INFO L226 Difference]: Without dead ends: 4927 [2019-11-23 22:32:28,094 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:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2019-11-23 22:32:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4927. [2019-11-23 22:32:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4927 states. [2019-11-23 22:32:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4927 states to 4927 states and 7148 transitions. [2019-11-23 22:32:28,420 INFO L78 Accepts]: Start accepts. Automaton has 4927 states and 7148 transitions. Word has length 150 [2019-11-23 22:32:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:28,420 INFO L462 AbstractCegarLoop]: Abstraction has 4927 states and 7148 transitions. [2019-11-23 22:32:28,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4927 states and 7148 transitions. [2019-11-23 22:32:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:32:28,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:28,428 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] [2019-11-23 22:32:28,428 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1349337187, now seen corresponding path program 1 times [2019-11-23 22:32:28,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:28,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27322455] [2019-11-23 22:32:28,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:28,484 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:28,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27322455] [2019-11-23 22:32:28,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:28,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:28,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537026667] [2019-11-23 22:32:28,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:28,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:28,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:28,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:28,486 INFO L87 Difference]: Start difference. First operand 4927 states and 7148 transitions. Second operand 3 states. [2019-11-23 22:32:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:29,226 INFO L93 Difference]: Finished difference Result 13146 states and 19320 transitions. [2019-11-23 22:32:29,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:29,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:32:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:29,274 INFO L225 Difference]: With dead ends: 13146 [2019-11-23 22:32:29,274 INFO L226 Difference]: Without dead ends: 9565 [2019-11-23 22:32:29,280 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:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9565 states. [2019-11-23 22:32:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9565 to 9563. [2019-11-23 22:32:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9563 states. [2019-11-23 22:32:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9563 states to 9563 states and 13854 transitions. [2019-11-23 22:32:29,681 INFO L78 Accepts]: Start accepts. Automaton has 9563 states and 13854 transitions. Word has length 153 [2019-11-23 22:32:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:29,682 INFO L462 AbstractCegarLoop]: Abstraction has 9563 states and 13854 transitions. [2019-11-23 22:32:29,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 9563 states and 13854 transitions. [2019-11-23 22:32:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:32:29,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:29,692 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] [2019-11-23 22:32:29,692 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash 41062658, now seen corresponding path program 1 times [2019-11-23 22:32:29,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:29,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883410288] [2019-11-23 22:32:29,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:29,965 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:29,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883410288] [2019-11-23 22:32:29,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:29,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:29,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6723020] [2019-11-23 22:32:29,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:29,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:29,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:29,968 INFO L87 Difference]: Start difference. First operand 9563 states and 13854 transitions. Second operand 9 states. [2019-11-23 22:32:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:32,858 INFO L93 Difference]: Finished difference Result 45631 states and 68277 transitions. [2019-11-23 22:32:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:32:32,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 153 [2019-11-23 22:32:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:32,946 INFO L225 Difference]: With dead ends: 45631 [2019-11-23 22:32:32,946 INFO L226 Difference]: Without dead ends: 36561 [2019-11-23 22:32:32,962 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:32:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36561 states. [2019-11-23 22:32:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36561 to 25445. [2019-11-23 22:32:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25445 states. [2019-11-23 22:32:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25445 states to 25445 states and 37320 transitions. [2019-11-23 22:32:35,367 INFO L78 Accepts]: Start accepts. Automaton has 25445 states and 37320 transitions. Word has length 153 [2019-11-23 22:32:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:35,368 INFO L462 AbstractCegarLoop]: Abstraction has 25445 states and 37320 transitions. [2019-11-23 22:32:35,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 25445 states and 37320 transitions. [2019-11-23 22:32:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:32:35,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:35,383 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] [2019-11-23 22:32:35,383 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:35,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash -132506612, now seen corresponding path program 1 times [2019-11-23 22:32:35,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:35,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326441253] [2019-11-23 22:32:35,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:35,528 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:35,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326441253] [2019-11-23 22:32:35,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:35,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:35,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781914800] [2019-11-23 22:32:35,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:35,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:35,530 INFO L87 Difference]: Start difference. First operand 25445 states and 37320 transitions. Second operand 4 states. [2019-11-23 22:32:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:37,257 INFO L93 Difference]: Finished difference Result 49073 states and 73974 transitions. [2019-11-23 22:32:37,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:37,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-23 22:32:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:37,323 INFO L225 Difference]: With dead ends: 49073 [2019-11-23 22:32:37,323 INFO L226 Difference]: Without dead ends: 31175 [2019-11-23 22:32:37,347 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:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31175 states. [2019-11-23 22:32:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31175 to 31173. [2019-11-23 22:32:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31173 states. [2019-11-23 22:32:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31173 states to 31173 states and 45908 transitions. [2019-11-23 22:32:39,887 INFO L78 Accepts]: Start accepts. Automaton has 31173 states and 45908 transitions. Word has length 153 [2019-11-23 22:32:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:39,887 INFO L462 AbstractCegarLoop]: Abstraction has 31173 states and 45908 transitions. [2019-11-23 22:32:39,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 31173 states and 45908 transitions. [2019-11-23 22:32:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:32:39,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:39,901 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] [2019-11-23 22:32:39,901 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash -298162772, now seen corresponding path program 1 times [2019-11-23 22:32:39,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:39,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317598931] [2019-11-23 22:32:39,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:40,049 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:40,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317598931] [2019-11-23 22:32:40,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:40,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:32:40,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587441483] [2019-11-23 22:32:40,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:32:40,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:32:40,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:40,052 INFO L87 Difference]: Start difference. First operand 31173 states and 45908 transitions. Second operand 5 states. [2019-11-23 22:32:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:43,672 INFO L93 Difference]: Finished difference Result 98169 states and 149217 transitions. [2019-11-23 22:32:43,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:43,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:32:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:43,786 INFO L225 Difference]: With dead ends: 98169 [2019-11-23 22:32:43,787 INFO L226 Difference]: Without dead ends: 76895 [2019-11-23 22:32:43,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:32:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76895 states. [2019-11-23 22:32:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76895 to 76891. [2019-11-23 22:32:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76891 states. [2019-11-23 22:32:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76891 states to 76891 states and 115858 transitions. [2019-11-23 22:32:49,145 INFO L78 Accepts]: Start accepts. Automaton has 76891 states and 115858 transitions. Word has length 153 [2019-11-23 22:32:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:49,146 INFO L462 AbstractCegarLoop]: Abstraction has 76891 states and 115858 transitions. [2019-11-23 22:32:49,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:32:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 76891 states and 115858 transitions. [2019-11-23 22:32:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:32:49,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:49,157 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] [2019-11-23 22:32:49,157 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2089564, now seen corresponding path program 1 times [2019-11-23 22:32:49,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:49,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081003083] [2019-11-23 22:32:49,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:49,253 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:49,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081003083] [2019-11-23 22:32:49,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:49,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:49,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501239785] [2019-11-23 22:32:49,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:49,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:49,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:49,255 INFO L87 Difference]: Start difference. First operand 76891 states and 115858 transitions. Second operand 3 states. [2019-11-23 22:32:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:57,439 INFO L93 Difference]: Finished difference Result 210043 states and 320794 transitions. [2019-11-23 22:32:57,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:57,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:32:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:57,620 INFO L225 Difference]: With dead ends: 210043 [2019-11-23 22:32:57,621 INFO L226 Difference]: Without dead ends: 141421 [2019-11-23 22:32:57,677 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:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141421 states. [2019-11-23 22:33:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141421 to 141163. [2019-11-23 22:33:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141163 states. [2019-11-23 22:33:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141163 states to 141163 states and 214272 transitions. [2019-11-23 22:33:07,538 INFO L78 Accepts]: Start accepts. Automaton has 141163 states and 214272 transitions. Word has length 153 [2019-11-23 22:33:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:07,538 INFO L462 AbstractCegarLoop]: Abstraction has 141163 states and 214272 transitions. [2019-11-23 22:33:07,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 141163 states and 214272 transitions. [2019-11-23 22:33:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:33:07,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:07,552 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] [2019-11-23 22:33:07,552 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1614354205, now seen corresponding path program 1 times [2019-11-23 22:33:07,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:07,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974075040] [2019-11-23 22:33:07,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:07,700 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:33:07,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974075040] [2019-11-23 22:33:07,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:07,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:33:07,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422513469] [2019-11-23 22:33:07,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:33:07,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:33:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:33:07,702 INFO L87 Difference]: Start difference. First operand 141163 states and 214272 transitions. Second operand 4 states. [2019-11-23 22:33:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:24,903 INFO L93 Difference]: Finished difference Result 414184 states and 629925 transitions. [2019-11-23 22:33:24,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:33:24,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-23 22:33:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:25,277 INFO L225 Difference]: With dead ends: 414184 [2019-11-23 22:33:25,278 INFO L226 Difference]: Without dead ends: 273060 [2019-11-23 22:33:25,378 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:33:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273060 states.