java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 15:36:00,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 15:36:00,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 15:36:00,435 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 15:36:00,436 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 15:36:00,437 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 15:36:00,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 15:36:00,440 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 15:36:00,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 15:36:00,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 15:36:00,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 15:36:00,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 15:36:00,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 15:36:00,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 15:36:00,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 15:36:00,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 15:36:00,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 15:36:00,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 15:36:00,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 15:36:00,454 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 15:36:00,455 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 15:36:00,457 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 15:36:00,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 15:36:00,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 15:36:00,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 15:36:00,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 15:36:00,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 15:36:00,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 15:36:00,463 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 15:36:00,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 15:36:00,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 15:36:00,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 15:36:00,466 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 15:36:00,466 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 15:36:00,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 15:36:00,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 15:36:00,468 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-22 15:36:00,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 15:36:00,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 15:36:00,484 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 15:36:00,484 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-22 15:36:00,485 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-22 15:36:00,485 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-22 15:36:00,485 INFO L133 SettingsManager]: * Use SBE=true [2018-10-22 15:36:00,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 15:36:00,486 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 15:36:00,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 15:36:00,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 15:36:00,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 15:36:00,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 15:36:00,487 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 15:36:00,487 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 15:36:00,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 15:36:00,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 15:36:00,488 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 15:36:00,488 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 15:36:00,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:36:00,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 15:36:00,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 15:36:00,489 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 15:36:00,489 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-22 15:36:00,489 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 15:36:00,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 15:36:00,491 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 15:36:00,491 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 15:36:00,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 15:36:00,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 15:36:00,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 15:36:00,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 15:36:00,586 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 15:36:00,586 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-10-22 15:36:00,655 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/34b3ff1fb/567beee039a6427b84bf558c9c7d8c63/FLAGbeea29268 [2018-10-22 15:36:01,236 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 15:36:01,237 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-10-22 15:36:01,266 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/34b3ff1fb/567beee039a6427b84bf558c9c7d8c63/FLAGbeea29268 [2018-10-22 15:36:01,283 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/34b3ff1fb/567beee039a6427b84bf558c9c7d8c63 [2018-10-22 15:36:01,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 15:36:01,296 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 15:36:01,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 15:36:01,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 15:36:01,301 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 15:36:01,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292c3a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01, skipping insertion in model container [2018-10-22 15:36:01,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 15:36:01,394 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 15:36:02,163 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:36:02,175 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 15:36:02,473 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:36:02,498 INFO L193 MainTranslator]: Completed translation [2018-10-22 15:36:02,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02 WrapperNode [2018-10-22 15:36:02,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 15:36:02,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 15:36:02,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 15:36:02,500 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 15:36:02,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 15:36:02,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 15:36:02,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 15:36:02,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 15:36:02,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... [2018-10-22 15:36:02,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 15:36:02,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 15:36:02,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 15:36:02,899 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 15:36:02,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-22 15:36:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-22 15:36:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-22 15:36:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-22 15:36:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 15:36:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 15:36:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-22 15:36:03,387 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-22 15:36:03,387 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-22 15:36:05,899 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 15:36:05,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:36:05 BoogieIcfgContainer [2018-10-22 15:36:05,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 15:36:05,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 15:36:05,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 15:36:05,905 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 15:36:05,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 03:36:01" (1/3) ... [2018-10-22 15:36:05,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9caecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:36:05, skipping insertion in model container [2018-10-22 15:36:05,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:02" (2/3) ... [2018-10-22 15:36:05,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9caecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:36:05, skipping insertion in model container [2018-10-22 15:36:05,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:36:05" (3/3) ... [2018-10-22 15:36:05,910 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-10-22 15:36:05,921 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 15:36:05,934 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 15:36:05,954 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 15:36:06,004 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 15:36:06,005 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 15:36:06,005 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 15:36:06,005 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 15:36:06,005 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 15:36:06,006 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 15:36:06,006 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 15:36:06,006 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 15:36:06,006 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 15:36:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2018-10-22 15:36:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-22 15:36:06,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:06,064 INFO L375 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] [2018-10-22 15:36:06,066 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:06,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1261209972, now seen corresponding path program 1 times [2018-10-22 15:36:06,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:06,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:06,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:06,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:36:06,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:36:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:36:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:36:06,566 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 3 states. [2018-10-22 15:36:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:06,946 INFO L93 Difference]: Finished difference Result 898 states and 1149 transitions. [2018-10-22 15:36:06,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:36:06,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-10-22 15:36:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:06,970 INFO L225 Difference]: With dead ends: 898 [2018-10-22 15:36:06,971 INFO L226 Difference]: Without dead ends: 550 [2018-10-22 15:36:06,976 INFO L605 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 [2018-10-22 15:36:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-22 15:36:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2018-10-22 15:36:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-10-22 15:36:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 654 transitions. [2018-10-22 15:36:07,058 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 654 transitions. Word has length 88 [2018-10-22 15:36:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:07,059 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 654 transitions. [2018-10-22 15:36:07,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:36:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 654 transitions. [2018-10-22 15:36:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-22 15:36:07,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:07,066 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:07,066 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:07,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:07,067 INFO L82 PathProgramCache]: Analyzing trace with hash 631583294, now seen corresponding path program 1 times [2018-10-22 15:36:07,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:07,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:07,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:07,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:07,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:36:07,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:36:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:36:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:36:07,282 INFO L87 Difference]: Start difference. First operand 550 states and 654 transitions. Second operand 3 states. [2018-10-22 15:36:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:07,499 INFO L93 Difference]: Finished difference Result 1040 states and 1250 transitions. [2018-10-22 15:36:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:36:07,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-10-22 15:36:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:07,509 INFO L225 Difference]: With dead ends: 1040 [2018-10-22 15:36:07,509 INFO L226 Difference]: Without dead ends: 791 [2018-10-22 15:36:07,516 INFO L605 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 [2018-10-22 15:36:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-10-22 15:36:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2018-10-22 15:36:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-10-22 15:36:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 942 transitions. [2018-10-22 15:36:07,574 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 942 transitions. Word has length 117 [2018-10-22 15:36:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:07,575 INFO L481 AbstractCegarLoop]: Abstraction has 791 states and 942 transitions. [2018-10-22 15:36:07,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:36:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 942 transitions. [2018-10-22 15:36:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-22 15:36:07,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:07,580 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:07,580 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:07,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash -916631362, now seen corresponding path program 1 times [2018-10-22 15:36:07,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:07,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:07,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:07,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:07,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:07,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:07,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:07,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:07,856 INFO L87 Difference]: Start difference. First operand 791 states and 942 transitions. Second operand 4 states. [2018-10-22 15:36:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:08,811 INFO L93 Difference]: Finished difference Result 1668 states and 2007 transitions. [2018-10-22 15:36:08,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:08,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-10-22 15:36:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:08,823 INFO L225 Difference]: With dead ends: 1668 [2018-10-22 15:36:08,823 INFO L226 Difference]: Without dead ends: 937 [2018-10-22 15:36:08,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-10-22 15:36:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 863. [2018-10-22 15:36:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-10-22 15:36:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1042 transitions. [2018-10-22 15:36:08,860 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1042 transitions. Word has length 148 [2018-10-22 15:36:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:08,861 INFO L481 AbstractCegarLoop]: Abstraction has 863 states and 1042 transitions. [2018-10-22 15:36:08,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1042 transitions. [2018-10-22 15:36:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-22 15:36:08,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:08,864 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:08,864 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:08,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:08,865 INFO L82 PathProgramCache]: Analyzing trace with hash 223162462, now seen corresponding path program 1 times [2018-10-22 15:36:08,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:08,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:08,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:08,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:08,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:09,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:09,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:09,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:09,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:09,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:09,138 INFO L87 Difference]: Start difference. First operand 863 states and 1042 transitions. Second operand 4 states. [2018-10-22 15:36:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:10,517 INFO L93 Difference]: Finished difference Result 2008 states and 2455 transitions. [2018-10-22 15:36:10,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:10,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-10-22 15:36:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:10,526 INFO L225 Difference]: With dead ends: 2008 [2018-10-22 15:36:10,526 INFO L226 Difference]: Without dead ends: 1205 [2018-10-22 15:36:10,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-10-22 15:36:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 949. [2018-10-22 15:36:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2018-10-22 15:36:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1164 transitions. [2018-10-22 15:36:10,560 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1164 transitions. Word has length 148 [2018-10-22 15:36:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:10,561 INFO L481 AbstractCegarLoop]: Abstraction has 949 states and 1164 transitions. [2018-10-22 15:36:10,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1164 transitions. [2018-10-22 15:36:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-22 15:36:10,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:10,566 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:10,566 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:10,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -479169991, now seen corresponding path program 1 times [2018-10-22 15:36:10,573 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:10,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:10,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:10,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:10,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:10,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:10,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:10,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:10,924 INFO L87 Difference]: Start difference. First operand 949 states and 1164 transitions. Second operand 4 states. [2018-10-22 15:36:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:11,707 INFO L93 Difference]: Finished difference Result 2086 states and 2566 transitions. [2018-10-22 15:36:11,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:11,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-10-22 15:36:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:11,715 INFO L225 Difference]: With dead ends: 2086 [2018-10-22 15:36:11,716 INFO L226 Difference]: Without dead ends: 1197 [2018-10-22 15:36:11,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-10-22 15:36:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 953. [2018-10-22 15:36:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-10-22 15:36:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1168 transitions. [2018-10-22 15:36:11,750 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1168 transitions. Word has length 150 [2018-10-22 15:36:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:11,751 INFO L481 AbstractCegarLoop]: Abstraction has 953 states and 1168 transitions. [2018-10-22 15:36:11,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1168 transitions. [2018-10-22 15:36:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-22 15:36:11,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:11,755 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:11,755 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:11,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:11,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1105058092, now seen corresponding path program 1 times [2018-10-22 15:36:11,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:11,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:11,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:11,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:11,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:12,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:12,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:12,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:12,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:12,074 INFO L87 Difference]: Start difference. First operand 953 states and 1168 transitions. Second operand 4 states. [2018-10-22 15:36:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:12,885 INFO L93 Difference]: Finished difference Result 2090 states and 2568 transitions. [2018-10-22 15:36:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:12,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-10-22 15:36:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:12,892 INFO L225 Difference]: With dead ends: 2090 [2018-10-22 15:36:12,892 INFO L226 Difference]: Without dead ends: 1197 [2018-10-22 15:36:12,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-10-22 15:36:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 957. [2018-10-22 15:36:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2018-10-22 15:36:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1172 transitions. [2018-10-22 15:36:12,921 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1172 transitions. Word has length 152 [2018-10-22 15:36:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:12,922 INFO L481 AbstractCegarLoop]: Abstraction has 957 states and 1172 transitions. [2018-10-22 15:36:12,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1172 transitions. [2018-10-22 15:36:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-22 15:36:12,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:12,926 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:12,926 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:12,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:12,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1295728209, now seen corresponding path program 1 times [2018-10-22 15:36:12,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:12,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:12,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:12,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:13,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:13,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:13,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:13,210 INFO L87 Difference]: Start difference. First operand 957 states and 1172 transitions. Second operand 4 states. [2018-10-22 15:36:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:13,866 INFO L93 Difference]: Finished difference Result 2076 states and 2550 transitions. [2018-10-22 15:36:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:13,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-10-22 15:36:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:13,877 INFO L225 Difference]: With dead ends: 2076 [2018-10-22 15:36:13,877 INFO L226 Difference]: Without dead ends: 1179 [2018-10-22 15:36:13,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-10-22 15:36:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 961. [2018-10-22 15:36:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2018-10-22 15:36:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1176 transitions. [2018-10-22 15:36:13,904 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1176 transitions. Word has length 154 [2018-10-22 15:36:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:13,906 INFO L481 AbstractCegarLoop]: Abstraction has 961 states and 1176 transitions. [2018-10-22 15:36:13,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1176 transitions. [2018-10-22 15:36:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-22 15:36:13,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:13,910 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:13,910 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:13,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 563487619, now seen corresponding path program 1 times [2018-10-22 15:36:13,911 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:13,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:13,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:13,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:13,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:14,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:14,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:14,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:14,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:14,454 INFO L87 Difference]: Start difference. First operand 961 states and 1176 transitions. Second operand 6 states. [2018-10-22 15:36:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:15,844 INFO L93 Difference]: Finished difference Result 2955 states and 3634 transitions. [2018-10-22 15:36:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:15,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-10-22 15:36:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:15,853 INFO L225 Difference]: With dead ends: 2955 [2018-10-22 15:36:15,853 INFO L226 Difference]: Without dead ends: 2054 [2018-10-22 15:36:15,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-10-22 15:36:15,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 969. [2018-10-22 15:36:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-10-22 15:36:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1184 transitions. [2018-10-22 15:36:15,886 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1184 transitions. Word has length 158 [2018-10-22 15:36:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:15,886 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1184 transitions. [2018-10-22 15:36:15,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1184 transitions. [2018-10-22 15:36:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-22 15:36:15,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:15,889 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:15,890 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:15,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash -848626909, now seen corresponding path program 1 times [2018-10-22 15:36:15,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:15,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:15,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:16,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:16,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:16,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:16,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:16,480 INFO L87 Difference]: Start difference. First operand 969 states and 1184 transitions. Second operand 6 states. [2018-10-22 15:36:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:18,724 INFO L93 Difference]: Finished difference Result 3317 states and 4083 transitions. [2018-10-22 15:36:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:18,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-10-22 15:36:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:18,732 INFO L225 Difference]: With dead ends: 3317 [2018-10-22 15:36:18,732 INFO L226 Difference]: Without dead ends: 2408 [2018-10-22 15:36:18,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2018-10-22 15:36:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1043. [2018-10-22 15:36:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-10-22 15:36:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1284 transitions. [2018-10-22 15:36:18,769 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1284 transitions. Word has length 158 [2018-10-22 15:36:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:18,769 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1284 transitions. [2018-10-22 15:36:18,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1284 transitions. [2018-10-22 15:36:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-22 15:36:18,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:18,774 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:18,774 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:18,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 323395518, now seen corresponding path program 1 times [2018-10-22 15:36:18,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:18,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:18,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:18,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:18,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:19,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:19,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:19,046 INFO L87 Difference]: Start difference. First operand 1043 states and 1284 transitions. Second operand 6 states. [2018-10-22 15:36:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:20,352 INFO L93 Difference]: Finished difference Result 3383 states and 4172 transitions. [2018-10-22 15:36:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:20,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-10-22 15:36:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:20,362 INFO L225 Difference]: With dead ends: 3383 [2018-10-22 15:36:20,362 INFO L226 Difference]: Without dead ends: 2400 [2018-10-22 15:36:20,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-10-22 15:36:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1047. [2018-10-22 15:36:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2018-10-22 15:36:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1288 transitions. [2018-10-22 15:36:20,399 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1288 transitions. Word has length 160 [2018-10-22 15:36:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:20,399 INFO L481 AbstractCegarLoop]: Abstraction has 1047 states and 1288 transitions. [2018-10-22 15:36:20,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1288 transitions. [2018-10-22 15:36:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-22 15:36:20,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:20,403 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:20,403 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:20,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1361250073, now seen corresponding path program 1 times [2018-10-22 15:36:20,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:20,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:20,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:20,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:20,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:20,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:20,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:20,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:20,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:20,639 INFO L87 Difference]: Start difference. First operand 1047 states and 1288 transitions. Second operand 6 states. [2018-10-22 15:36:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:21,900 INFO L93 Difference]: Finished difference Result 3387 states and 4174 transitions. [2018-10-22 15:36:21,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:21,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-10-22 15:36:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:21,913 INFO L225 Difference]: With dead ends: 3387 [2018-10-22 15:36:21,913 INFO L226 Difference]: Without dead ends: 2400 [2018-10-22 15:36:21,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-10-22 15:36:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1051. [2018-10-22 15:36:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2018-10-22 15:36:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1292 transitions. [2018-10-22 15:36:21,951 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1292 transitions. Word has length 162 [2018-10-22 15:36:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:21,952 INFO L481 AbstractCegarLoop]: Abstraction has 1051 states and 1292 transitions. [2018-10-22 15:36:21,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1292 transitions. [2018-10-22 15:36:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-22 15:36:21,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:21,955 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:21,955 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:21,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1995529036, now seen corresponding path program 1 times [2018-10-22 15:36:21,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:21,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:22,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:22,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:22,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:22,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:22,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:22,190 INFO L87 Difference]: Start difference. First operand 1051 states and 1292 transitions. Second operand 6 states. [2018-10-22 15:36:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:23,587 INFO L93 Difference]: Finished difference Result 3373 states and 4156 transitions. [2018-10-22 15:36:23,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:23,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-22 15:36:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:23,596 INFO L225 Difference]: With dead ends: 3373 [2018-10-22 15:36:23,596 INFO L226 Difference]: Without dead ends: 2382 [2018-10-22 15:36:23,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2018-10-22 15:36:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 977. [2018-10-22 15:36:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-22 15:36:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1192 transitions. [2018-10-22 15:36:23,630 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1192 transitions. Word has length 164 [2018-10-22 15:36:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:23,631 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1192 transitions. [2018-10-22 15:36:23,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1192 transitions. [2018-10-22 15:36:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-22 15:36:23,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:23,635 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:23,635 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:23,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash 861305591, now seen corresponding path program 1 times [2018-10-22 15:36:23,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:23,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:23,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:23,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:23,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:23,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:23,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:23,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:23,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:23,931 INFO L87 Difference]: Start difference. First operand 977 states and 1192 transitions. Second operand 4 states. [2018-10-22 15:36:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:24,220 INFO L93 Difference]: Finished difference Result 2012 states and 2467 transitions. [2018-10-22 15:36:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:24,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-10-22 15:36:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:24,224 INFO L225 Difference]: With dead ends: 2012 [2018-10-22 15:36:24,224 INFO L226 Difference]: Without dead ends: 1095 [2018-10-22 15:36:24,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-10-22 15:36:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 995. [2018-10-22 15:36:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-22 15:36:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1212 transitions. [2018-10-22 15:36:24,253 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1212 transitions. Word has length 176 [2018-10-22 15:36:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:24,253 INFO L481 AbstractCegarLoop]: Abstraction has 995 states and 1212 transitions. [2018-10-22 15:36:24,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1212 transitions. [2018-10-22 15:36:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-22 15:36:24,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:24,257 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:24,257 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:24,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1262441833, now seen corresponding path program 1 times [2018-10-22 15:36:24,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:24,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:24,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:24,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:24,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:24,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:24,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:24,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:24,580 INFO L87 Difference]: Start difference. First operand 995 states and 1212 transitions. Second operand 4 states. [2018-10-22 15:36:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:25,365 INFO L93 Difference]: Finished difference Result 2220 states and 2722 transitions. [2018-10-22 15:36:25,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:25,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-10-22 15:36:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:25,371 INFO L225 Difference]: With dead ends: 2220 [2018-10-22 15:36:25,371 INFO L226 Difference]: Without dead ends: 1285 [2018-10-22 15:36:25,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-10-22 15:36:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1013. [2018-10-22 15:36:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-22 15:36:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1232 transitions. [2018-10-22 15:36:25,400 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1232 transitions. Word has length 176 [2018-10-22 15:36:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:25,401 INFO L481 AbstractCegarLoop]: Abstraction has 1013 states and 1232 transitions. [2018-10-22 15:36:25,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1232 transitions. [2018-10-22 15:36:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-22 15:36:25,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:25,405 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:25,405 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:25,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1941340786, now seen corresponding path program 1 times [2018-10-22 15:36:25,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:25,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:25,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:25,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:25,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:25,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:25,532 INFO L87 Difference]: Start difference. First operand 1013 states and 1232 transitions. Second operand 4 states. [2018-10-22 15:36:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:25,839 INFO L93 Difference]: Finished difference Result 1717 states and 2095 transitions. [2018-10-22 15:36:25,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:25,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-10-22 15:36:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:25,843 INFO L225 Difference]: With dead ends: 1717 [2018-10-22 15:36:25,843 INFO L226 Difference]: Without dead ends: 1113 [2018-10-22 15:36:25,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-10-22 15:36:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1029. [2018-10-22 15:36:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-10-22 15:36:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1254 transitions. [2018-10-22 15:36:25,872 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1254 transitions. Word has length 177 [2018-10-22 15:36:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:25,872 INFO L481 AbstractCegarLoop]: Abstraction has 1029 states and 1254 transitions. [2018-10-22 15:36:25,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1254 transitions. [2018-10-22 15:36:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-22 15:36:25,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:25,876 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:25,876 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:25,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash 529680082, now seen corresponding path program 1 times [2018-10-22 15:36:25,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:25,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:26,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:26,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:26,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:26,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:26,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:26,049 INFO L87 Difference]: Start difference. First operand 1029 states and 1254 transitions. Second operand 4 states. [2018-10-22 15:36:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:26,418 INFO L93 Difference]: Finished difference Result 1913 states and 2343 transitions. [2018-10-22 15:36:26,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:26,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-10-22 15:36:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:26,422 INFO L225 Difference]: With dead ends: 1913 [2018-10-22 15:36:26,422 INFO L226 Difference]: Without dead ends: 1301 [2018-10-22 15:36:26,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2018-10-22 15:36:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1045. [2018-10-22 15:36:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-10-22 15:36:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1276 transitions. [2018-10-22 15:36:26,447 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1276 transitions. Word has length 177 [2018-10-22 15:36:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:26,447 INFO L481 AbstractCegarLoop]: Abstraction has 1045 states and 1276 transitions. [2018-10-22 15:36:26,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1276 transitions. [2018-10-22 15:36:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-22 15:36:26,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:26,451 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:26,451 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:26,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1272780974, now seen corresponding path program 1 times [2018-10-22 15:36:26,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:26,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:26,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:26,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:26,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:26,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:26,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:26,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:26,660 INFO L87 Difference]: Start difference. First operand 1045 states and 1276 transitions. Second operand 4 states. [2018-10-22 15:36:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:26,978 INFO L93 Difference]: Finished difference Result 2114 states and 2589 transitions. [2018-10-22 15:36:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:26,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-10-22 15:36:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:26,982 INFO L225 Difference]: With dead ends: 2114 [2018-10-22 15:36:26,982 INFO L226 Difference]: Without dead ends: 1129 [2018-10-22 15:36:26,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-10-22 15:36:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1045. [2018-10-22 15:36:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-10-22 15:36:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1274 transitions. [2018-10-22 15:36:27,016 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1274 transitions. Word has length 178 [2018-10-22 15:36:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:27,016 INFO L481 AbstractCegarLoop]: Abstraction has 1045 states and 1274 transitions. [2018-10-22 15:36:27,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1274 transitions. [2018-10-22 15:36:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-22 15:36:27,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:27,021 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:27,021 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:27,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2084589838, now seen corresponding path program 1 times [2018-10-22 15:36:27,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:27,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:27,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:27,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:27,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:27,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:27,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:27,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:27,380 INFO L87 Difference]: Start difference. First operand 1045 states and 1274 transitions. Second operand 4 states. [2018-10-22 15:36:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:27,834 INFO L93 Difference]: Finished difference Result 2286 states and 2800 transitions. [2018-10-22 15:36:27,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:27,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-10-22 15:36:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:27,840 INFO L225 Difference]: With dead ends: 2286 [2018-10-22 15:36:27,841 INFO L226 Difference]: Without dead ends: 1301 [2018-10-22 15:36:27,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2018-10-22 15:36:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1045. [2018-10-22 15:36:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-10-22 15:36:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1272 transitions. [2018-10-22 15:36:27,872 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1272 transitions. Word has length 178 [2018-10-22 15:36:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:27,873 INFO L481 AbstractCegarLoop]: Abstraction has 1045 states and 1272 transitions. [2018-10-22 15:36:27,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1272 transitions. [2018-10-22 15:36:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-22 15:36:27,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:27,876 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:27,876 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:27,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:27,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1195803767, now seen corresponding path program 1 times [2018-10-22 15:36:27,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:27,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:27,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:27,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:27,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:28,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:28,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:28,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:28,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:28,207 INFO L87 Difference]: Start difference. First operand 1045 states and 1272 transitions. Second operand 4 states. [2018-10-22 15:36:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:28,933 INFO L93 Difference]: Finished difference Result 1739 states and 2120 transitions. [2018-10-22 15:36:28,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:28,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-10-22 15:36:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:28,936 INFO L225 Difference]: With dead ends: 1739 [2018-10-22 15:36:28,936 INFO L226 Difference]: Without dead ends: 1119 [2018-10-22 15:36:28,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-22 15:36:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1049. [2018-10-22 15:36:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-10-22 15:36:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1276 transitions. [2018-10-22 15:36:28,961 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1276 transitions. Word has length 179 [2018-10-22 15:36:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:28,961 INFO L481 AbstractCegarLoop]: Abstraction has 1049 states and 1276 transitions. [2018-10-22 15:36:28,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1276 transitions. [2018-10-22 15:36:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-22 15:36:28,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:28,964 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:28,964 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:28,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1799532759, now seen corresponding path program 1 times [2018-10-22 15:36:28,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:28,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:28,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:29,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:29,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:29,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:29,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:29,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:29,267 INFO L87 Difference]: Start difference. First operand 1049 states and 1276 transitions. Second operand 4 states. [2018-10-22 15:36:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:30,098 INFO L93 Difference]: Finished difference Result 1917 states and 2341 transitions. [2018-10-22 15:36:30,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:30,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-10-22 15:36:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:30,104 INFO L225 Difference]: With dead ends: 1917 [2018-10-22 15:36:30,104 INFO L226 Difference]: Without dead ends: 1295 [2018-10-22 15:36:30,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-10-22 15:36:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1053. [2018-10-22 15:36:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-10-22 15:36:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1280 transitions. [2018-10-22 15:36:30,128 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1280 transitions. Word has length 179 [2018-10-22 15:36:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:30,128 INFO L481 AbstractCegarLoop]: Abstraction has 1053 states and 1280 transitions. [2018-10-22 15:36:30,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1280 transitions. [2018-10-22 15:36:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-22 15:36:30,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:30,130 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:30,131 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:30,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash 474206253, now seen corresponding path program 1 times [2018-10-22 15:36:30,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:30,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:30,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:30,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:30,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:30,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:30,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:30,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:30,314 INFO L87 Difference]: Start difference. First operand 1053 states and 1280 transitions. Second operand 4 states. [2018-10-22 15:36:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:30,626 INFO L93 Difference]: Finished difference Result 2116 states and 2580 transitions. [2018-10-22 15:36:30,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:30,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-22 15:36:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:30,630 INFO L225 Difference]: With dead ends: 2116 [2018-10-22 15:36:30,630 INFO L226 Difference]: Without dead ends: 1123 [2018-10-22 15:36:30,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-22 15:36:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1053. [2018-10-22 15:36:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-10-22 15:36:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1278 transitions. [2018-10-22 15:36:30,658 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1278 transitions. Word has length 180 [2018-10-22 15:36:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:30,658 INFO L481 AbstractCegarLoop]: Abstraction has 1053 states and 1278 transitions. [2018-10-22 15:36:30,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1278 transitions. [2018-10-22 15:36:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-22 15:36:30,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:30,661 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:30,661 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:30,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1350147591, now seen corresponding path program 1 times [2018-10-22 15:36:30,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:30,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:30,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:30,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:30,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:30,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:30,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:30,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:30,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:30,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:30,893 INFO L87 Difference]: Start difference. First operand 1053 states and 1278 transitions. Second operand 4 states. [2018-10-22 15:36:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:31,160 INFO L93 Difference]: Finished difference Result 2112 states and 2572 transitions. [2018-10-22 15:36:31,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:31,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-22 15:36:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:31,164 INFO L225 Difference]: With dead ends: 2112 [2018-10-22 15:36:31,164 INFO L226 Difference]: Without dead ends: 1119 [2018-10-22 15:36:31,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:31,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-22 15:36:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1053. [2018-10-22 15:36:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-10-22 15:36:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1276 transitions. [2018-10-22 15:36:31,192 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1276 transitions. Word has length 180 [2018-10-22 15:36:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:31,192 INFO L481 AbstractCegarLoop]: Abstraction has 1053 states and 1276 transitions. [2018-10-22 15:36:31,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1276 transitions. [2018-10-22 15:36:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-22 15:36:31,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:31,194 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:31,194 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:31,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2009935821, now seen corresponding path program 1 times [2018-10-22 15:36:31,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:31,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:31,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:31,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:31,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:31,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:31,505 INFO L87 Difference]: Start difference. First operand 1053 states and 1276 transitions. Second operand 4 states. [2018-10-22 15:36:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:31,955 INFO L93 Difference]: Finished difference Result 2288 states and 2787 transitions. [2018-10-22 15:36:31,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:31,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-22 15:36:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:31,957 INFO L225 Difference]: With dead ends: 2288 [2018-10-22 15:36:31,957 INFO L226 Difference]: Without dead ends: 1295 [2018-10-22 15:36:31,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-10-22 15:36:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1053. [2018-10-22 15:36:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-10-22 15:36:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1274 transitions. [2018-10-22 15:36:31,984 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1274 transitions. Word has length 180 [2018-10-22 15:36:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:31,984 INFO L481 AbstractCegarLoop]: Abstraction has 1053 states and 1274 transitions. [2018-10-22 15:36:31,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1274 transitions. [2018-10-22 15:36:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-22 15:36:31,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:31,986 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:31,986 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:31,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash 185581977, now seen corresponding path program 1 times [2018-10-22 15:36:31,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:31,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:32,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:32,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:32,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:32,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:32,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:32,097 INFO L87 Difference]: Start difference. First operand 1053 states and 1274 transitions. Second operand 4 states. [2018-10-22 15:36:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:32,529 INFO L93 Difference]: Finished difference Result 2284 states and 2779 transitions. [2018-10-22 15:36:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:32,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-22 15:36:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:32,531 INFO L225 Difference]: With dead ends: 2284 [2018-10-22 15:36:32,531 INFO L226 Difference]: Without dead ends: 1291 [2018-10-22 15:36:32,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-10-22 15:36:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1053. [2018-10-22 15:36:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-10-22 15:36:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1272 transitions. [2018-10-22 15:36:32,560 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1272 transitions. Word has length 180 [2018-10-22 15:36:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:32,560 INFO L481 AbstractCegarLoop]: Abstraction has 1053 states and 1272 transitions. [2018-10-22 15:36:32,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1272 transitions. [2018-10-22 15:36:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-22 15:36:32,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:32,562 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:32,563 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:32,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash -393472632, now seen corresponding path program 1 times [2018-10-22 15:36:32,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:32,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:32,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-22 15:36:32,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:32,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:32,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:32,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:32,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:32,667 INFO L87 Difference]: Start difference. First operand 1053 states and 1272 transitions. Second operand 4 states. [2018-10-22 15:36:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:32,964 INFO L93 Difference]: Finished difference Result 2086 states and 2530 transitions. [2018-10-22 15:36:32,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:32,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-10-22 15:36:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:32,966 INFO L225 Difference]: With dead ends: 2086 [2018-10-22 15:36:32,966 INFO L226 Difference]: Without dead ends: 1093 [2018-10-22 15:36:32,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-22 15:36:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1053. [2018-10-22 15:36:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-10-22 15:36:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1270 transitions. [2018-10-22 15:36:32,989 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1270 transitions. Word has length 182 [2018-10-22 15:36:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:32,989 INFO L481 AbstractCegarLoop]: Abstraction has 1053 states and 1270 transitions. [2018-10-22 15:36:32,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1270 transitions. [2018-10-22 15:36:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-22 15:36:32,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:32,991 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:32,992 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:32,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash 337740511, now seen corresponding path program 1 times [2018-10-22 15:36:32,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:32,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:32,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-22 15:36:33,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:33,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:36:33,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:36:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:36:33,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:36:33,109 INFO L87 Difference]: Start difference. First operand 1053 states and 1270 transitions. Second operand 3 states. [2018-10-22 15:36:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:33,227 INFO L93 Difference]: Finished difference Result 2052 states and 2489 transitions. [2018-10-22 15:36:33,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:36:33,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-22 15:36:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:33,229 INFO L225 Difference]: With dead ends: 2052 [2018-10-22 15:36:33,229 INFO L226 Difference]: Without dead ends: 1431 [2018-10-22 15:36:33,230 INFO L605 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 [2018-10-22 15:36:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2018-10-22 15:36:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2018-10-22 15:36:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2018-10-22 15:36:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1732 transitions. [2018-10-22 15:36:33,285 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1732 transitions. Word has length 182 [2018-10-22 15:36:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:33,285 INFO L481 AbstractCegarLoop]: Abstraction has 1431 states and 1732 transitions. [2018-10-22 15:36:33,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:36:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1732 transitions. [2018-10-22 15:36:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-22 15:36:33,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:33,287 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:33,287 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:33,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:33,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1103319563, now seen corresponding path program 1 times [2018-10-22 15:36:33,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:33,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:33,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:33,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:33,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-22 15:36:33,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:33,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:36:33,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:36:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:36:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:36:33,387 INFO L87 Difference]: Start difference. First operand 1431 states and 1732 transitions. Second operand 3 states. [2018-10-22 15:36:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:33,458 INFO L93 Difference]: Finished difference Result 1811 states and 2198 transitions. [2018-10-22 15:36:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:36:33,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-22 15:36:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:33,462 INFO L225 Difference]: With dead ends: 1811 [2018-10-22 15:36:33,462 INFO L226 Difference]: Without dead ends: 1809 [2018-10-22 15:36:33,463 INFO L605 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 [2018-10-22 15:36:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2018-10-22 15:36:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2018-10-22 15:36:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2018-10-22 15:36:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2195 transitions. [2018-10-22 15:36:33,500 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2195 transitions. Word has length 184 [2018-10-22 15:36:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:33,501 INFO L481 AbstractCegarLoop]: Abstraction has 1809 states and 2195 transitions. [2018-10-22 15:36:33,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:36:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2195 transitions. [2018-10-22 15:36:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-22 15:36:33,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:33,504 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:33,504 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:33,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2004616657, now seen corresponding path program 1 times [2018-10-22 15:36:33,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:33,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:33,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:33,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:33,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:33,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:33,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:36:33,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:36:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:36:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:36:33,630 INFO L87 Difference]: Start difference. First operand 1809 states and 2195 transitions. Second operand 3 states. [2018-10-22 15:36:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:33,815 INFO L93 Difference]: Finished difference Result 3179 states and 3866 transitions. [2018-10-22 15:36:33,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:36:33,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-10-22 15:36:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:33,820 INFO L225 Difference]: With dead ends: 3179 [2018-10-22 15:36:33,820 INFO L226 Difference]: Without dead ends: 1802 [2018-10-22 15:36:33,822 INFO L605 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 [2018-10-22 15:36:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-10-22 15:36:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2018-10-22 15:36:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2018-10-22 15:36:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2181 transitions. [2018-10-22 15:36:33,852 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2181 transitions. Word has length 223 [2018-10-22 15:36:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:33,853 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 2181 transitions. [2018-10-22 15:36:33,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:36:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2181 transitions. [2018-10-22 15:36:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-22 15:36:33,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:33,856 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:33,856 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:33,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash -900882395, now seen corresponding path program 1 times [2018-10-22 15:36:33,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:34,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:34,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:34,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:34,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:34,138 INFO L87 Difference]: Start difference. First operand 1802 states and 2181 transitions. Second operand 4 states. [2018-10-22 15:36:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:34,440 INFO L93 Difference]: Finished difference Result 3977 states and 4852 transitions. [2018-10-22 15:36:34,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:34,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2018-10-22 15:36:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:34,444 INFO L225 Difference]: With dead ends: 3977 [2018-10-22 15:36:34,445 INFO L226 Difference]: Without dead ends: 2235 [2018-10-22 15:36:34,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2018-10-22 15:36:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2017. [2018-10-22 15:36:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2018-10-22 15:36:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2486 transitions. [2018-10-22 15:36:34,489 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2486 transitions. Word has length 227 [2018-10-22 15:36:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:34,489 INFO L481 AbstractCegarLoop]: Abstraction has 2017 states and 2486 transitions. [2018-10-22 15:36:34,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2486 transitions. [2018-10-22 15:36:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-22 15:36:34,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:34,493 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:34,493 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:34,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1738027222, now seen corresponding path program 1 times [2018-10-22 15:36:34,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:34,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:34,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:34,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:34,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:34,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:34,863 INFO L87 Difference]: Start difference. First operand 2017 states and 2486 transitions. Second operand 6 states. [2018-10-22 15:36:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:35,619 INFO L93 Difference]: Finished difference Result 6354 states and 7819 transitions. [2018-10-22 15:36:35,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:35,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2018-10-22 15:36:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:35,623 INFO L225 Difference]: With dead ends: 6354 [2018-10-22 15:36:35,624 INFO L226 Difference]: Without dead ends: 4397 [2018-10-22 15:36:35,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2018-10-22 15:36:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 2037. [2018-10-22 15:36:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-10-22 15:36:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2506 transitions. [2018-10-22 15:36:35,678 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2506 transitions. Word has length 237 [2018-10-22 15:36:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:35,679 INFO L481 AbstractCegarLoop]: Abstraction has 2037 states and 2506 transitions. [2018-10-22 15:36:35,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2506 transitions. [2018-10-22 15:36:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-22 15:36:35,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:35,682 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:35,682 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:35,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1902060126, now seen corresponding path program 1 times [2018-10-22 15:36:35,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:35,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:35,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:35,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:35,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:35,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:35,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:35,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:35,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:35,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:35,955 INFO L87 Difference]: Start difference. First operand 2037 states and 2506 transitions. Second operand 4 states. [2018-10-22 15:36:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:36,260 INFO L93 Difference]: Finished difference Result 4382 states and 5407 transitions. [2018-10-22 15:36:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:36,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2018-10-22 15:36:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:36,263 INFO L225 Difference]: With dead ends: 4382 [2018-10-22 15:36:36,263 INFO L226 Difference]: Without dead ends: 2405 [2018-10-22 15:36:36,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2018-10-22 15:36:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2082. [2018-10-22 15:36:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-10-22 15:36:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2556 transitions. [2018-10-22 15:36:36,321 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2556 transitions. Word has length 255 [2018-10-22 15:36:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:36,321 INFO L481 AbstractCegarLoop]: Abstraction has 2082 states and 2556 transitions. [2018-10-22 15:36:36,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2556 transitions. [2018-10-22 15:36:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-22 15:36:36,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:36,325 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:36,326 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:36,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2110019479, now seen corresponding path program 1 times [2018-10-22 15:36:36,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:36,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:36,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-22 15:36:36,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:36,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:36,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:36,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:36,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:36,511 INFO L87 Difference]: Start difference. First operand 2082 states and 2556 transitions. Second operand 4 states. [2018-10-22 15:36:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:36,811 INFO L93 Difference]: Finished difference Result 3915 states and 4827 transitions. [2018-10-22 15:36:36,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:36,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-10-22 15:36:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:36,814 INFO L225 Difference]: With dead ends: 3915 [2018-10-22 15:36:36,814 INFO L226 Difference]: Without dead ends: 2321 [2018-10-22 15:36:36,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2018-10-22 15:36:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2206. [2018-10-22 15:36:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2018-10-22 15:36:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2728 transitions. [2018-10-22 15:36:36,877 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2728 transitions. Word has length 256 [2018-10-22 15:36:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:36,878 INFO L481 AbstractCegarLoop]: Abstraction has 2206 states and 2728 transitions. [2018-10-22 15:36:36,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2728 transitions. [2018-10-22 15:36:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-22 15:36:36,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:36,883 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:36,883 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:36,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:36,884 INFO L82 PathProgramCache]: Analyzing trace with hash -159100679, now seen corresponding path program 1 times [2018-10-22 15:36:36,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:36,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:36,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:36,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:36,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:37,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:37,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:37,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:37,210 INFO L87 Difference]: Start difference. First operand 2206 states and 2728 transitions. Second operand 4 states. [2018-10-22 15:36:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:37,598 INFO L93 Difference]: Finished difference Result 4675 states and 5796 transitions. [2018-10-22 15:36:37,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:37,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-10-22 15:36:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:37,600 INFO L225 Difference]: With dead ends: 4675 [2018-10-22 15:36:37,601 INFO L226 Difference]: Without dead ends: 2529 [2018-10-22 15:36:37,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-10-22 15:36:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2216. [2018-10-22 15:36:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-10-22 15:36:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2738 transitions. [2018-10-22 15:36:37,656 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2738 transitions. Word has length 257 [2018-10-22 15:36:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:37,656 INFO L481 AbstractCegarLoop]: Abstraction has 2216 states and 2738 transitions. [2018-10-22 15:36:37,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2738 transitions. [2018-10-22 15:36:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-22 15:36:37,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:37,661 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:37,662 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:37,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1240517652, now seen corresponding path program 1 times [2018-10-22 15:36:37,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:37,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:37,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:37,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:37,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:37,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:37,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:37,930 INFO L87 Difference]: Start difference. First operand 2216 states and 2738 transitions. Second operand 4 states. [2018-10-22 15:36:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:38,251 INFO L93 Difference]: Finished difference Result 4685 states and 5801 transitions. [2018-10-22 15:36:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:38,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2018-10-22 15:36:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:38,253 INFO L225 Difference]: With dead ends: 4685 [2018-10-22 15:36:38,253 INFO L226 Difference]: Without dead ends: 2529 [2018-10-22 15:36:38,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-10-22 15:36:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2226. [2018-10-22 15:36:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-10-22 15:36:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2748 transitions. [2018-10-22 15:36:38,297 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2748 transitions. Word has length 259 [2018-10-22 15:36:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:38,297 INFO L481 AbstractCegarLoop]: Abstraction has 2226 states and 2748 transitions. [2018-10-22 15:36:38,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2748 transitions. [2018-10-22 15:36:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-22 15:36:38,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:38,300 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:38,300 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:38,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1925027808, now seen corresponding path program 1 times [2018-10-22 15:36:38,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:38,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:38,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:38,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:38,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:38,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:38,459 INFO L87 Difference]: Start difference. First operand 2226 states and 2748 transitions. Second operand 4 states. [2018-10-22 15:36:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:38,752 INFO L93 Difference]: Finished difference Result 4685 states and 5796 transitions. [2018-10-22 15:36:38,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:38,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2018-10-22 15:36:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:38,755 INFO L225 Difference]: With dead ends: 4685 [2018-10-22 15:36:38,755 INFO L226 Difference]: Without dead ends: 2519 [2018-10-22 15:36:38,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2018-10-22 15:36:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2226. [2018-10-22 15:36:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-10-22 15:36:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2743 transitions. [2018-10-22 15:36:38,798 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2743 transitions. Word has length 259 [2018-10-22 15:36:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:38,798 INFO L481 AbstractCegarLoop]: Abstraction has 2226 states and 2743 transitions. [2018-10-22 15:36:38,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2743 transitions. [2018-10-22 15:36:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-22 15:36:38,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:38,801 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:38,801 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:38,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:38,802 INFO L82 PathProgramCache]: Analyzing trace with hash -150768721, now seen corresponding path program 1 times [2018-10-22 15:36:38,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:38,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:38,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:38,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:38,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:39,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:39,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:39,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:39,007 INFO L87 Difference]: Start difference. First operand 2226 states and 2743 transitions. Second operand 4 states. [2018-10-22 15:36:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:39,306 INFO L93 Difference]: Finished difference Result 4620 states and 5711 transitions. [2018-10-22 15:36:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:39,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-10-22 15:36:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:39,309 INFO L225 Difference]: With dead ends: 4620 [2018-10-22 15:36:39,309 INFO L226 Difference]: Without dead ends: 2454 [2018-10-22 15:36:39,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2018-10-22 15:36:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2236. [2018-10-22 15:36:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2018-10-22 15:36:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2753 transitions. [2018-10-22 15:36:39,362 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2753 transitions. Word has length 261 [2018-10-22 15:36:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:39,362 INFO L481 AbstractCegarLoop]: Abstraction has 2236 states and 2753 transitions. [2018-10-22 15:36:39,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2753 transitions. [2018-10-22 15:36:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-22 15:36:39,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:39,365 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:39,365 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:39,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:39,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1424252294, now seen corresponding path program 1 times [2018-10-22 15:36:39,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:39,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:39,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-10-22 15:36:39,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:39,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:36:39,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:36:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:36:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:36:39,510 INFO L87 Difference]: Start difference. First operand 2236 states and 2753 transitions. Second operand 4 states. [2018-10-22 15:36:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:39,820 INFO L93 Difference]: Finished difference Result 4805 states and 5946 transitions. [2018-10-22 15:36:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:36:39,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-10-22 15:36:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:39,823 INFO L225 Difference]: With dead ends: 4805 [2018-10-22 15:36:39,823 INFO L226 Difference]: Without dead ends: 2629 [2018-10-22 15:36:39,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2018-10-22 15:36:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2431. [2018-10-22 15:36:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2018-10-22 15:36:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3028 transitions. [2018-10-22 15:36:39,873 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3028 transitions. Word has length 261 [2018-10-22 15:36:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:39,873 INFO L481 AbstractCegarLoop]: Abstraction has 2431 states and 3028 transitions. [2018-10-22 15:36:39,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:36:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3028 transitions. [2018-10-22 15:36:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-22 15:36:39,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:39,877 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:39,877 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:39,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash -302233629, now seen corresponding path program 1 times [2018-10-22 15:36:39,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:39,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-22 15:36:40,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:40,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:36:40,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:36:40,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:36:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:36:40,031 INFO L87 Difference]: Start difference. First operand 2431 states and 3028 transitions. Second operand 3 states. [2018-10-22 15:36:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:40,174 INFO L93 Difference]: Finished difference Result 6820 states and 8495 transitions. [2018-10-22 15:36:40,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:36:40,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-10-22 15:36:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:40,179 INFO L225 Difference]: With dead ends: 6820 [2018-10-22 15:36:40,180 INFO L226 Difference]: Without dead ends: 4449 [2018-10-22 15:36:40,183 INFO L605 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 [2018-10-22 15:36:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4449 states. [2018-10-22 15:36:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4449 to 4445. [2018-10-22 15:36:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4445 states. [2018-10-22 15:36:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 5496 transitions. [2018-10-22 15:36:40,300 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 5496 transitions. Word has length 265 [2018-10-22 15:36:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:40,301 INFO L481 AbstractCegarLoop]: Abstraction has 4445 states and 5496 transitions. [2018-10-22 15:36:40,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:36:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 5496 transitions. [2018-10-22 15:36:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-22 15:36:40,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:40,308 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:40,308 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:40,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash -735962715, now seen corresponding path program 1 times [2018-10-22 15:36:40,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:40,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:40,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:40,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:40,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:40,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:40,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:40,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:40,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:40,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:40,907 INFO L87 Difference]: Start difference. First operand 4445 states and 5496 transitions. Second operand 6 states. [2018-10-22 15:36:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:41,984 INFO L93 Difference]: Finished difference Result 9383 states and 11528 transitions. [2018-10-22 15:36:41,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:41,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-10-22 15:36:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:41,994 INFO L225 Difference]: With dead ends: 9383 [2018-10-22 15:36:41,994 INFO L226 Difference]: Without dead ends: 7012 [2018-10-22 15:36:41,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-22 15:36:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2018-10-22 15:36:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 4445. [2018-10-22 15:36:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4445 states. [2018-10-22 15:36:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 5491 transitions. [2018-10-22 15:36:42,097 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 5491 transitions. Word has length 265 [2018-10-22 15:36:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:42,097 INFO L481 AbstractCegarLoop]: Abstraction has 4445 states and 5491 transitions. [2018-10-22 15:36:42,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 5491 transitions. [2018-10-22 15:36:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-22 15:36:42,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:42,103 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:42,103 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:42,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1174577124, now seen corresponding path program 1 times [2018-10-22 15:36:42,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:42,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:42,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:42,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:42,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-22 15:36:42,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:42,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:42,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:42,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:42,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:42,259 INFO L87 Difference]: Start difference. First operand 4445 states and 5491 transitions. Second operand 6 states. [2018-10-22 15:36:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:43,252 INFO L93 Difference]: Finished difference Result 8456 states and 10411 transitions. [2018-10-22 15:36:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:43,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2018-10-22 15:36:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:43,257 INFO L225 Difference]: With dead ends: 8456 [2018-10-22 15:36:43,257 INFO L226 Difference]: Without dead ends: 6558 [2018-10-22 15:36:43,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2018-10-22 15:36:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 4461. [2018-10-22 15:36:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4461 states. [2018-10-22 15:36:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 5507 transitions. [2018-10-22 15:36:43,358 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 5507 transitions. Word has length 266 [2018-10-22 15:36:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:43,359 INFO L481 AbstractCegarLoop]: Abstraction has 4461 states and 5507 transitions. [2018-10-22 15:36:43,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 5507 transitions. [2018-10-22 15:36:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-22 15:36:43,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:43,364 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:43,365 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:43,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1500251392, now seen corresponding path program 1 times [2018-10-22 15:36:43,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:43,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:43,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:43,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:43,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-22 15:36:43,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:43,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:43,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:43,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:43,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:43,665 INFO L87 Difference]: Start difference. First operand 4461 states and 5507 transitions. Second operand 6 states. [2018-10-22 15:36:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:44,580 INFO L93 Difference]: Finished difference Result 9423 states and 11558 transitions. [2018-10-22 15:36:44,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:44,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2018-10-22 15:36:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:44,586 INFO L225 Difference]: With dead ends: 9423 [2018-10-22 15:36:44,586 INFO L226 Difference]: Without dead ends: 7036 [2018-10-22 15:36:44,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-22 15:36:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2018-10-22 15:36:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 4461. [2018-10-22 15:36:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4461 states. [2018-10-22 15:36:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 5502 transitions. [2018-10-22 15:36:44,693 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 5502 transitions. Word has length 267 [2018-10-22 15:36:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:44,693 INFO L481 AbstractCegarLoop]: Abstraction has 4461 states and 5502 transitions. [2018-10-22 15:36:44,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 5502 transitions. [2018-10-22 15:36:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-22 15:36:44,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:44,699 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:44,699 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:44,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash -122516888, now seen corresponding path program 1 times [2018-10-22 15:36:44,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:44,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-22 15:36:45,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:45,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-22 15:36:45,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-22 15:36:45,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-22 15:36:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-22 15:36:45,234 INFO L87 Difference]: Start difference. First operand 4461 states and 5502 transitions. Second operand 10 states. [2018-10-22 15:36:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:46,354 INFO L93 Difference]: Finished difference Result 8870 states and 10949 transitions. [2018-10-22 15:36:46,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:46,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2018-10-22 15:36:46,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:46,359 INFO L225 Difference]: With dead ends: 8870 [2018-10-22 15:36:46,359 INFO L226 Difference]: Without dead ends: 4469 [2018-10-22 15:36:46,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-22 15:36:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2018-10-22 15:36:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4467. [2018-10-22 15:36:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2018-10-22 15:36:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5508 transitions. [2018-10-22 15:36:46,495 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5508 transitions. Word has length 268 [2018-10-22 15:36:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:46,496 INFO L481 AbstractCegarLoop]: Abstraction has 4467 states and 5508 transitions. [2018-10-22 15:36:46,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-22 15:36:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5508 transitions. [2018-10-22 15:36:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-22 15:36:46,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:46,501 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:46,501 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:46,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1483670493, now seen corresponding path program 1 times [2018-10-22 15:36:46,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:46,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:46,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:46,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:46,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-22 15:36:47,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:47,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 15:36:47,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:36:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:36:47,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:36:47,063 INFO L87 Difference]: Start difference. First operand 4467 states and 5508 transitions. Second operand 6 states. [2018-10-22 15:36:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:48,638 INFO L93 Difference]: Finished difference Result 11198 states and 13824 transitions. [2018-10-22 15:36:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-22 15:36:48,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 300 [2018-10-22 15:36:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:48,644 INFO L225 Difference]: With dead ends: 11198 [2018-10-22 15:36:48,644 INFO L226 Difference]: Without dead ends: 6797 [2018-10-22 15:36:48,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-22 15:36:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6797 states. [2018-10-22 15:36:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6797 to 4478. [2018-10-22 15:36:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4478 states. [2018-10-22 15:36:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 5521 transitions. [2018-10-22 15:36:48,771 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 5521 transitions. Word has length 300 [2018-10-22 15:36:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:48,772 INFO L481 AbstractCegarLoop]: Abstraction has 4478 states and 5521 transitions. [2018-10-22 15:36:48,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:36:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 5521 transitions. [2018-10-22 15:36:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-22 15:36:48,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:48,776 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:48,776 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:48,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:48,776 INFO L82 PathProgramCache]: Analyzing trace with hash 907633125, now seen corresponding path program 1 times [2018-10-22 15:36:48,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:48,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:48,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:48,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:48,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-22 15:36:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-22 15:36:49,189 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-22 15:36:49,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 03:36:49 BoogieIcfgContainer [2018-10-22 15:36:49,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 15:36:49,400 INFO L168 Benchmark]: Toolchain (without parser) took 48105.42 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.7 MB). Peak memory consumption was 521.8 MB. Max. memory is 7.1 GB. [2018-10-22 15:36:49,403 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 15:36:49,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1202.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-22 15:36:49,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 308.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -970.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2018-10-22 15:36:49,405 INFO L168 Benchmark]: Boogie Preprocessor took 85.05 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 15:36:49,409 INFO L168 Benchmark]: RCFGBuilder took 3001.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. [2018-10-22 15:36:49,410 INFO L168 Benchmark]: TraceAbstraction took 43498.13 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 550.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -92.3 MB). Peak memory consumption was 457.7 MB. Max. memory is 7.1 GB. [2018-10-22 15:36:49,414 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1202.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 308.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -970.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.05 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3001.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43498.13 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 550.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -92.3 MB). Peak memory consumption was 457.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; VAL [init=1] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; [L1040] RET static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20484:0}] [L1062] SSL *s ; VAL [init=1, SSLv3_client_data={20484:0}] [L1066] EXPR, FCALL malloc (sizeof (SSL)) VAL [init=1, SSLv3_client_data={20484:0}] [L1066] s = malloc (sizeof (SSL)) VAL [init=1, SSLv3_client_data={20484:0}] [L1067] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [init=1, SSLv3_client_data={20484:0}] [L1067] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [init=1, SSLv3_client_data={20484:0}] [L1068] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [init=1, SSLv3_client_data={20484:0}] [L1068] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [init=1, SSLv3_client_data={20484:0}] [L1069] FCALL s->state = 12292 VAL [init=1, SSLv3_client_data={20484:0}] [L1070] FCALL s->version = __VERIFIER_nondet_int() VAL [init=1, SSLv3_client_data={20484:0}] [L1071] CALL ssl3_connect(s) [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1101] FCALL s->state = 12292 VAL [init=1, SSLv3_client_data={20484:0}] [L1102] FCALL s->hit = __VERIFIER_nondet_int() VAL [init=1, SSLv3_client_data={20484:0}] [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1108] EXPR, FCALL malloc(sizeof(int)) VAL [init=1, SSLv3_client_data={20484:0}] [L1108] tmp___0 = (int*)malloc(sizeof(int)) VAL [init=1, SSLv3_client_data={20484:0}] [L1109] FCALL *tmp___0 = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1110] EXPR, FCALL s->info_callback VAL [init=1, SSLv3_client_data={20484:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR, FCALL s->info_callback VAL [init=1, SSLv3_client_data={20484:0}] [L1111] cb = s->info_callback [L1119] EXPR, FCALL s->in_handshake VAL [init=1, SSLv3_client_data={20484:0}] [L1119] FCALL s->in_handshake += 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={20484:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1133] COND TRUE s->state == 12292 [L1236] FCALL s->new_session = 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1237] FCALL s->state = 4096 VAL [init=1, SSLv3_client_data={20484:0}] [L1238] EXPR, FCALL s->ctx VAL [init=1, SSLv3_client_data={20484:0}] [L1238] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [init=1, SSLv3_client_data={20484:0}] [L1238] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1243] FCALL s->server = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={20484:0}] [L1249] EXPR, FCALL s->version VAL [init=1, SSLv3_client_data={20484:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] FCALL s->type = 4096 VAL [init=1, SSLv3_client_data={20484:0}] [L1256] EXPR, FCALL s->init_buf VAL [init=1, SSLv3_client_data={20484:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) VAL [init=1, SSLv3_client_data={20484:0}] [L1282] FCALL s->state = 4368 VAL [init=1, SSLv3_client_data={20484:0}] [L1283] EXPR, FCALL s->ctx VAL [init=1, SSLv3_client_data={20484:0}] [L1283] EXPR, FCALL (s->ctx)->stats.sess_connect VAL [init=1, SSLv3_client_data={20484:0}] [L1283] FCALL (s->ctx)->stats.sess_connect += 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1284] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20484:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1148] COND TRUE s->state == 4368 [L1288] FCALL s->shutdown = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1295] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20484:0}] [L1300] FCALL s->state = 4384 VAL [init=1, SSLv3_client_data={20484:0}] [L1301] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1302] EXPR, FCALL s->bbio VAL [init=1, SSLv3_client_data={20484:0}] [L1302] EXPR, FCALL s->wbio VAL [init=1, SSLv3_client_data={20484:0}] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20484:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [init=1, SSLv3_client_data={20484:0}] [L1316] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20484:0}] [L1321] FCALL s->hit VAL [init=1, SSLv3_client_data={20484:0}] [L1321] COND FALSE !(s->hit) [L1324] FCALL s->state = 4400 VAL [init=1, SSLv3_client_data={20484:0}] [L1326] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20484:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1160] COND TRUE s->state == 4400 [L1330] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20484:0}] [L1330] EXPR, FCALL (s->s3)->tmp.new_cipher VAL [init=1, SSLv3_client_data={20484:0}] [L1330] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={20484:0}] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [init=1, SSLv3_client_data={20484:0}] [L1339] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20484:0}] [L1345] FCALL s->state = 4416 VAL [init=1, SSLv3_client_data={20484:0}] [L1346] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20484:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [init=1, SSLv3_client_data={20484:0}] [L1356] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20484:0}] [L1361] FCALL s->state = 4432 VAL [init=1, SSLv3_client_data={20484:0}] [L1362] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20484:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={20484:0}] [L1379] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20484:0}] [L1384] FCALL s->state = 4448 VAL [init=1, SSLv3_client_data={20484:0}] [L1385] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20484:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20484:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20484:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20484:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20484:0}] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={20484:0}] [L1645] __VERIFIER_error() VAL [init=1, SSLv3_client_data={20484:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 344 locations, 1 error locations. UNSAFE Result, 43.4s OverallTime, 44 OverallIterations, 7 TraceHistogramMax, 28.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21645 SDtfs, 10698 SDslu, 41600 SDs, 0 SdLazy, 14790 SolverSat, 418 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 152 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4478occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 23514 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 8873 NumberOfCodeBlocks, 8873 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 8530 ConstructedInterpolants, 0 QuantifiedInterpolants, 3514977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 6910/6910 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...