./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5a3d22d49117f02662b197492bc1b16616a2878 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:59:48,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:59:48,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:59:48,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:59:48,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:59:48,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:59:48,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:59:48,914 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:59:48,916 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:59:48,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:59:48,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:59:48,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:59:48,919 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:59:48,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:59:48,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:59:48,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:59:48,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:59:48,924 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:59:48,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:59:48,928 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:59:48,929 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:59:48,930 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:59:48,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:59:48,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:59:48,936 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:59:48,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:59:48,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:59:48,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:59:48,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:59:48,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:59:48,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:59:48,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:59:48,950 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:59:48,950 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:59:48,951 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:59:48,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:59:48,954 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:59:48,971 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:59:48,971 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:59:48,972 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:59:48,972 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:59:48,972 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:59:48,973 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:59:48,973 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:59:48,973 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:59:48,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:59:48,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:59:48,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:59:48,974 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:59:48,975 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:59:48,975 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:59:48,975 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:59:48,975 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:59:48,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:59:48,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:59:48,976 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:59:48,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:59:48,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:59:48,977 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:59:48,978 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:59:48,978 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:59:48,978 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:59:48,978 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:59:48,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:59:48,979 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5a3d22d49117f02662b197492bc1b16616a2878 [2019-01-14 14:59:49,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:59:49,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:59:49,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:59:49,041 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:59:49,042 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:59:49,042 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:49,103 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bfd3b1d/92fedbfd73c04a05ab90245d65237459/FLAG1cdadf364 [2019-01-14 14:59:49,496 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:59:49,497 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:49,509 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bfd3b1d/92fedbfd73c04a05ab90245d65237459/FLAG1cdadf364 [2019-01-14 14:59:49,882 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bfd3b1d/92fedbfd73c04a05ab90245d65237459 [2019-01-14 14:59:49,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:59:49,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:59:49,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:49,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:59:49,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:59:49,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:49" (1/1) ... [2019-01-14 14:59:49,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea255f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:49, skipping insertion in model container [2019-01-14 14:59:49,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:49" (1/1) ... [2019-01-14 14:59:49,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:59:49,932 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:59:50,175 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:50,183 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:59:50,237 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:50,257 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:59:50,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50 WrapperNode [2019-01-14 14:59:50,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:50,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:50,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:59:50,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:59:50,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:50,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:59:50,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:59:50,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:59:50,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... [2019-01-14 14:59:50,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:59:50,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:59:50,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:59:50,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:59:50,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:59:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:59:50,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:59:51,108 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:59:51,108 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 14:59:51,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:51 BoogieIcfgContainer [2019-01-14 14:59:51,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:59:51,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:59:51,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:59:51,113 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:59:51,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:59:49" (1/3) ... [2019-01-14 14:59:51,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693722a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:51, skipping insertion in model container [2019-01-14 14:59:51,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:50" (2/3) ... [2019-01-14 14:59:51,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693722a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:51, skipping insertion in model container [2019-01-14 14:59:51,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:51" (3/3) ... [2019-01-14 14:59:51,117 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:51,127 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:59:51,135 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:59:51,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:59:51,180 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:59:51,181 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:59:51,181 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:59:51,181 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:59:51,181 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:59:51,181 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:59:51,181 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:59:51,182 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:59:51,182 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:59:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-01-14 14:59:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:51,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:51,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:51,209 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:51,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:51,215 INFO L82 PathProgramCache]: Analyzing trace with hash 458325173, now seen corresponding path program 1 times [2019-01-14 14:59:51,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:51,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:51,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:51,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:51,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:51,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:51,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:51,488 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2019-01-14 14:59:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:51,610 INFO L93 Difference]: Finished difference Result 106 states and 192 transitions. [2019-01-14 14:59:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:51,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:51,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:51,626 INFO L225 Difference]: With dead ends: 106 [2019-01-14 14:59:51,626 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 14:59:51,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 14:59:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2019-01-14 14:59:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 14:59:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2019-01-14 14:59:51,688 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 20 [2019-01-14 14:59:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:51,689 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2019-01-14 14:59:51,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2019-01-14 14:59:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:51,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:51,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:51,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1130022729, now seen corresponding path program 1 times [2019-01-14 14:59:51,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:51,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:51,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:51,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:51,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:51,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:51,816 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand 3 states. [2019-01-14 14:59:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:51,905 INFO L93 Difference]: Finished difference Result 153 states and 288 transitions. [2019-01-14 14:59:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:51,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:51,908 INFO L225 Difference]: With dead ends: 153 [2019-01-14 14:59:51,908 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 14:59:51,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 14:59:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-01-14 14:59:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 14:59:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 169 transitions. [2019-01-14 14:59:51,927 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 169 transitions. Word has length 20 [2019-01-14 14:59:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:51,928 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 169 transitions. [2019-01-14 14:59:51,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 169 transitions. [2019-01-14 14:59:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:51,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:51,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:51,932 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1323390526, now seen corresponding path program 1 times [2019-01-14 14:59:51,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:51,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:51,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:52,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:52,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:52,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,040 INFO L87 Difference]: Start difference. First operand 90 states and 169 transitions. Second operand 3 states. [2019-01-14 14:59:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:52,116 INFO L93 Difference]: Finished difference Result 140 states and 257 transitions. [2019-01-14 14:59:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:52,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:52,119 INFO L225 Difference]: With dead ends: 140 [2019-01-14 14:59:52,119 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 14:59:52,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 14:59:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-01-14 14:59:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 14:59:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 171 transitions. [2019-01-14 14:59:52,137 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 171 transitions. Word has length 21 [2019-01-14 14:59:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:52,138 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 171 transitions. [2019-01-14 14:59:52,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2019-01-14 14:59:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:52,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:52,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:52,145 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:52,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:52,146 INFO L82 PathProgramCache]: Analyzing trace with hash -670754180, now seen corresponding path program 1 times [2019-01-14 14:59:52,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:52,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:52,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:52,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:52,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:52,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:52,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:52,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:52,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,259 INFO L87 Difference]: Start difference. First operand 93 states and 171 transitions. Second operand 3 states. [2019-01-14 14:59:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:52,347 INFO L93 Difference]: Finished difference Result 180 states and 332 transitions. [2019-01-14 14:59:52,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:52,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:52,350 INFO L225 Difference]: With dead ends: 180 [2019-01-14 14:59:52,350 INFO L226 Difference]: Without dead ends: 178 [2019-01-14 14:59:52,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-14 14:59:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2019-01-14 14:59:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-14 14:59:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 228 transitions. [2019-01-14 14:59:52,365 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 228 transitions. Word has length 21 [2019-01-14 14:59:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:52,366 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 228 transitions. [2019-01-14 14:59:52,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 228 transitions. [2019-01-14 14:59:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:52,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:52,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:52,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2035865214, now seen corresponding path program 1 times [2019-01-14 14:59:52,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:52,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:52,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:52,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:52,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:52,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:52,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,443 INFO L87 Difference]: Start difference. First operand 124 states and 228 transitions. Second operand 3 states. [2019-01-14 14:59:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:52,469 INFO L93 Difference]: Finished difference Result 300 states and 554 transitions. [2019-01-14 14:59:52,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:52,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:52,473 INFO L225 Difference]: With dead ends: 300 [2019-01-14 14:59:52,473 INFO L226 Difference]: Without dead ends: 180 [2019-01-14 14:59:52,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-14 14:59:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-14 14:59:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-14 14:59:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 326 transitions. [2019-01-14 14:59:52,489 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 326 transitions. Word has length 21 [2019-01-14 14:59:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:52,490 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 326 transitions. [2019-01-14 14:59:52,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 326 transitions. [2019-01-14 14:59:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:52,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:52,492 INFO L402 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] [2019-01-14 14:59:52,493 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 681669292, now seen corresponding path program 1 times [2019-01-14 14:59:52,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:52,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:52,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:52,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:52,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,556 INFO L87 Difference]: Start difference. First operand 178 states and 326 transitions. Second operand 3 states. [2019-01-14 14:59:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:52,610 INFO L93 Difference]: Finished difference Result 269 states and 489 transitions. [2019-01-14 14:59:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:52,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:52,612 INFO L225 Difference]: With dead ends: 269 [2019-01-14 14:59:52,612 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 14:59:52,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 14:59:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-01-14 14:59:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 14:59:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 326 transitions. [2019-01-14 14:59:52,641 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 326 transitions. Word has length 22 [2019-01-14 14:59:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:52,641 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 326 transitions. [2019-01-14 14:59:52,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 326 transitions. [2019-01-14 14:59:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:52,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:52,648 INFO L402 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] [2019-01-14 14:59:52,648 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1312475414, now seen corresponding path program 1 times [2019-01-14 14:59:52,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:52,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:52,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:52,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:52,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,716 INFO L87 Difference]: Start difference. First operand 180 states and 326 transitions. Second operand 3 states. [2019-01-14 14:59:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:52,796 INFO L93 Difference]: Finished difference Result 524 states and 952 transitions. [2019-01-14 14:59:52,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:52,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:52,799 INFO L225 Difference]: With dead ends: 524 [2019-01-14 14:59:52,799 INFO L226 Difference]: Without dead ends: 350 [2019-01-14 14:59:52,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-14 14:59:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-01-14 14:59:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-14 14:59:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-01-14 14:59:52,825 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 22 [2019-01-14 14:59:52,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:52,826 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-01-14 14:59:52,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-01-14 14:59:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:52,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:52,829 INFO L402 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] [2019-01-14 14:59:52,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash 275872488, now seen corresponding path program 1 times [2019-01-14 14:59:52,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:52,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:52,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:52,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:52,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:52,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,913 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-01-14 14:59:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:52,992 INFO L93 Difference]: Finished difference Result 448 states and 812 transitions. [2019-01-14 14:59:52,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:52,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:52,997 INFO L225 Difference]: With dead ends: 448 [2019-01-14 14:59:52,997 INFO L226 Difference]: Without dead ends: 446 [2019-01-14 14:59:52,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-01-14 14:59:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 348. [2019-01-14 14:59:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-14 14:59:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 622 transitions. [2019-01-14 14:59:53,012 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 622 transitions. Word has length 22 [2019-01-14 14:59:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:53,012 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 622 transitions. [2019-01-14 14:59:53,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 622 transitions. [2019-01-14 14:59:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:53,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:53,016 INFO L402 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] [2019-01-14 14:59:53,016 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2031819437, now seen corresponding path program 1 times [2019-01-14 14:59:53,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:53,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:53,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:53,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:53,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:53,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:53,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,089 INFO L87 Difference]: Start difference. First operand 348 states and 622 transitions. Second operand 3 states. [2019-01-14 14:59:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:53,163 INFO L93 Difference]: Finished difference Result 660 states and 1192 transitions. [2019-01-14 14:59:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:53,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:53,170 INFO L225 Difference]: With dead ends: 660 [2019-01-14 14:59:53,170 INFO L226 Difference]: Without dead ends: 658 [2019-01-14 14:59:53,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-01-14 14:59:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 480. [2019-01-14 14:59:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 14:59:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 846 transitions. [2019-01-14 14:59:53,198 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 846 transitions. Word has length 23 [2019-01-14 14:59:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:53,198 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 846 transitions. [2019-01-14 14:59:53,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 846 transitions. [2019-01-14 14:59:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:53,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:53,201 INFO L402 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] [2019-01-14 14:59:53,201 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash 674799957, now seen corresponding path program 1 times [2019-01-14 14:59:53,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:53,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:53,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:53,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:53,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:53,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:53,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,297 INFO L87 Difference]: Start difference. First operand 480 states and 846 transitions. Second operand 3 states. [2019-01-14 14:59:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:53,420 INFO L93 Difference]: Finished difference Result 1156 states and 2048 transitions. [2019-01-14 14:59:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:53,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:53,425 INFO L225 Difference]: With dead ends: 1156 [2019-01-14 14:59:53,425 INFO L226 Difference]: Without dead ends: 682 [2019-01-14 14:59:53,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-01-14 14:59:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-01-14 14:59:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-01-14 14:59:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1194 transitions. [2019-01-14 14:59:53,451 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1194 transitions. Word has length 23 [2019-01-14 14:59:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:53,451 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 1194 transitions. [2019-01-14 14:59:53,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1194 transitions. [2019-01-14 14:59:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:53,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:53,454 INFO L402 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] [2019-01-14 14:59:53,454 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1438319967, now seen corresponding path program 1 times [2019-01-14 14:59:53,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:53,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:53,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:53,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:53,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:53,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,544 INFO L87 Difference]: Start difference. First operand 680 states and 1194 transitions. Second operand 3 states. [2019-01-14 14:59:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:53,650 INFO L93 Difference]: Finished difference Result 1028 states and 1800 transitions. [2019-01-14 14:59:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:53,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:53,655 INFO L225 Difference]: With dead ends: 1028 [2019-01-14 14:59:53,656 INFO L226 Difference]: Without dead ends: 694 [2019-01-14 14:59:53,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-01-14 14:59:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-01-14 14:59:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-01-14 14:59:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1202 transitions. [2019-01-14 14:59:53,696 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1202 transitions. Word has length 24 [2019-01-14 14:59:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:53,696 INFO L480 AbstractCegarLoop]: Abstraction has 692 states and 1202 transitions. [2019-01-14 14:59:53,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1202 transitions. [2019-01-14 14:59:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:53,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:53,703 INFO L402 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] [2019-01-14 14:59:53,703 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash -555824739, now seen corresponding path program 1 times [2019-01-14 14:59:53,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:53,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:53,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:53,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:53,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:53,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:53,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,801 INFO L87 Difference]: Start difference. First operand 692 states and 1202 transitions. Second operand 3 states. [2019-01-14 14:59:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:53,919 INFO L93 Difference]: Finished difference Result 1288 states and 2268 transitions. [2019-01-14 14:59:53,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:53,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:53,932 INFO L225 Difference]: With dead ends: 1288 [2019-01-14 14:59:53,932 INFO L226 Difference]: Without dead ends: 1286 [2019-01-14 14:59:53,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2019-01-14 14:59:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 964. [2019-01-14 14:59:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-01-14 14:59:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1642 transitions. [2019-01-14 14:59:53,982 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1642 transitions. Word has length 24 [2019-01-14 14:59:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:53,982 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1642 transitions. [2019-01-14 14:59:53,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1642 transitions. [2019-01-14 14:59:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:53,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:53,987 INFO L402 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] [2019-01-14 14:59:53,987 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2144172641, now seen corresponding path program 1 times [2019-01-14 14:59:53,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:53,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:54,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:54,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:54,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:54,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:54,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:54,075 INFO L87 Difference]: Start difference. First operand 964 states and 1642 transitions. Second operand 3 states. [2019-01-14 14:59:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:54,193 INFO L93 Difference]: Finished difference Result 2296 states and 3932 transitions. [2019-01-14 14:59:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:54,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:54,205 INFO L225 Difference]: With dead ends: 2296 [2019-01-14 14:59:54,205 INFO L226 Difference]: Without dead ends: 1350 [2019-01-14 14:59:54,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-01-14 14:59:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-01-14 14:59:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-01-14 14:59:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2290 transitions. [2019-01-14 14:59:54,263 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2290 transitions. Word has length 24 [2019-01-14 14:59:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:54,265 INFO L480 AbstractCegarLoop]: Abstraction has 1348 states and 2290 transitions. [2019-01-14 14:59:54,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2290 transitions. [2019-01-14 14:59:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:54,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:54,273 INFO L402 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] [2019-01-14 14:59:54,274 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash -50484310, now seen corresponding path program 1 times [2019-01-14 14:59:54,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:54,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:54,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:54,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:54,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:54,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:54,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:54,372 INFO L87 Difference]: Start difference. First operand 1348 states and 2290 transitions. Second operand 3 states. [2019-01-14 14:59:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:54,506 INFO L93 Difference]: Finished difference Result 2024 states and 3428 transitions. [2019-01-14 14:59:54,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:54,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:54,518 INFO L225 Difference]: With dead ends: 2024 [2019-01-14 14:59:54,518 INFO L226 Difference]: Without dead ends: 1366 [2019-01-14 14:59:54,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-01-14 14:59:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1364. [2019-01-14 14:59:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2019-01-14 14:59:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2290 transitions. [2019-01-14 14:59:54,580 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2290 transitions. Word has length 25 [2019-01-14 14:59:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:54,581 INFO L480 AbstractCegarLoop]: Abstraction has 1364 states and 2290 transitions. [2019-01-14 14:59:54,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2290 transitions. [2019-01-14 14:59:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:54,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:54,586 INFO L402 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] [2019-01-14 14:59:54,586 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:54,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2044629016, now seen corresponding path program 1 times [2019-01-14 14:59:54,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:54,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:54,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:54,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:54,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:54,662 INFO L87 Difference]: Start difference. First operand 1364 states and 2290 transitions. Second operand 3 states. [2019-01-14 14:59:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:54,775 INFO L93 Difference]: Finished difference Result 2504 states and 4276 transitions. [2019-01-14 14:59:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:54,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:54,789 INFO L225 Difference]: With dead ends: 2504 [2019-01-14 14:59:54,789 INFO L226 Difference]: Without dead ends: 2502 [2019-01-14 14:59:54,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-01-14 14:59:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1924. [2019-01-14 14:59:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-01-14 14:59:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3154 transitions. [2019-01-14 14:59:54,848 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3154 transitions. Word has length 25 [2019-01-14 14:59:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:54,848 INFO L480 AbstractCegarLoop]: Abstraction has 1924 states and 3154 transitions. [2019-01-14 14:59:54,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3154 transitions. [2019-01-14 14:59:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:54,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:54,853 INFO L402 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] [2019-01-14 14:59:54,853 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:54,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash 661990378, now seen corresponding path program 1 times [2019-01-14 14:59:54,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:54,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:54,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:54,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:54,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:54,934 INFO L87 Difference]: Start difference. First operand 1924 states and 3154 transitions. Second operand 3 states. [2019-01-14 14:59:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:55,083 INFO L93 Difference]: Finished difference Result 4552 states and 7508 transitions. [2019-01-14 14:59:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:55,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:55,097 INFO L225 Difference]: With dead ends: 4552 [2019-01-14 14:59:55,097 INFO L226 Difference]: Without dead ends: 2662 [2019-01-14 14:59:55,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-01-14 14:59:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-01-14 14:59:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-01-14 14:59:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4354 transitions. [2019-01-14 14:59:55,225 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4354 transitions. Word has length 25 [2019-01-14 14:59:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:55,225 INFO L480 AbstractCegarLoop]: Abstraction has 2660 states and 4354 transitions. [2019-01-14 14:59:55,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4354 transitions. [2019-01-14 14:59:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:55,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:55,232 INFO L402 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] [2019-01-14 14:59:55,232 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1041223700, now seen corresponding path program 1 times [2019-01-14 14:59:55,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:55,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:55,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:55,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:55,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:55,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:55,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:55,295 INFO L87 Difference]: Start difference. First operand 2660 states and 4354 transitions. Second operand 3 states. [2019-01-14 14:59:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:55,431 INFO L93 Difference]: Finished difference Result 3992 states and 6516 transitions. [2019-01-14 14:59:55,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:55,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:55,446 INFO L225 Difference]: With dead ends: 3992 [2019-01-14 14:59:55,446 INFO L226 Difference]: Without dead ends: 2694 [2019-01-14 14:59:55,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-01-14 14:59:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2692. [2019-01-14 14:59:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-01-14 14:59:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4354 transitions. [2019-01-14 14:59:55,554 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4354 transitions. Word has length 26 [2019-01-14 14:59:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:55,554 INFO L480 AbstractCegarLoop]: Abstraction has 2692 states and 4354 transitions. [2019-01-14 14:59:55,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4354 transitions. [2019-01-14 14:59:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:55,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:55,559 INFO L402 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] [2019-01-14 14:59:55,560 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash -952921006, now seen corresponding path program 1 times [2019-01-14 14:59:55,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:55,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:55,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:55,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:55,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:55,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:55,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:55,628 INFO L87 Difference]: Start difference. First operand 2692 states and 4354 transitions. Second operand 3 states. [2019-01-14 14:59:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:55,778 INFO L93 Difference]: Finished difference Result 4872 states and 8036 transitions. [2019-01-14 14:59:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:55,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:55,801 INFO L225 Difference]: With dead ends: 4872 [2019-01-14 14:59:55,802 INFO L226 Difference]: Without dead ends: 4870 [2019-01-14 14:59:55,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-01-14 14:59:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3844. [2019-01-14 14:59:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-01-14 14:59:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 6050 transitions. [2019-01-14 14:59:55,920 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 6050 transitions. Word has length 26 [2019-01-14 14:59:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:55,921 INFO L480 AbstractCegarLoop]: Abstraction has 3844 states and 6050 transitions. [2019-01-14 14:59:55,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 6050 transitions. [2019-01-14 14:59:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:55,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:55,928 INFO L402 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] [2019-01-14 14:59:55,928 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1753698388, now seen corresponding path program 1 times [2019-01-14 14:59:55,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:55,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:55,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:55,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:55,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:55,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:55,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:55,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:55,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:55,998 INFO L87 Difference]: Start difference. First operand 3844 states and 6050 transitions. Second operand 3 states. [2019-01-14 14:59:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:56,163 INFO L93 Difference]: Finished difference Result 9032 states and 14308 transitions. [2019-01-14 14:59:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:56,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:56,190 INFO L225 Difference]: With dead ends: 9032 [2019-01-14 14:59:56,191 INFO L226 Difference]: Without dead ends: 5254 [2019-01-14 14:59:56,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2019-01-14 14:59:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5252. [2019-01-14 14:59:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-01-14 14:59:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8258 transitions. [2019-01-14 14:59:56,358 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8258 transitions. Word has length 26 [2019-01-14 14:59:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:56,359 INFO L480 AbstractCegarLoop]: Abstraction has 5252 states and 8258 transitions. [2019-01-14 14:59:56,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8258 transitions. [2019-01-14 14:59:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:56,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:56,367 INFO L402 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] [2019-01-14 14:59:56,368 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash 524433983, now seen corresponding path program 1 times [2019-01-14 14:59:56,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:56,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:56,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:56,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:56,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:56,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:56,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:56,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:56,440 INFO L87 Difference]: Start difference. First operand 5252 states and 8258 transitions. Second operand 3 states. [2019-01-14 14:59:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:56,619 INFO L93 Difference]: Finished difference Result 7880 states and 12356 transitions. [2019-01-14 14:59:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:56,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:56,644 INFO L225 Difference]: With dead ends: 7880 [2019-01-14 14:59:56,645 INFO L226 Difference]: Without dead ends: 5318 [2019-01-14 14:59:56,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-01-14 14:59:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 5316. [2019-01-14 14:59:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-01-14 14:59:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 8258 transitions. [2019-01-14 14:59:56,793 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 8258 transitions. Word has length 27 [2019-01-14 14:59:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:56,793 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 8258 transitions. [2019-01-14 14:59:56,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 8258 transitions. [2019-01-14 14:59:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:56,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:56,800 INFO L402 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] [2019-01-14 14:59:56,802 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1469710723, now seen corresponding path program 1 times [2019-01-14 14:59:56,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:56,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:56,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:56,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:56,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:56,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:56,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:56,880 INFO L87 Difference]: Start difference. First operand 5316 states and 8258 transitions. Second operand 3 states. [2019-01-14 14:59:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:57,071 INFO L93 Difference]: Finished difference Result 9480 states and 15044 transitions. [2019-01-14 14:59:57,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:57,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:57,094 INFO L225 Difference]: With dead ends: 9480 [2019-01-14 14:59:57,095 INFO L226 Difference]: Without dead ends: 9478 [2019-01-14 14:59:57,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2019-01-14 14:59:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7684. [2019-01-14 14:59:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-01-14 14:59:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 11586 transitions. [2019-01-14 14:59:57,321 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 11586 transitions. Word has length 27 [2019-01-14 14:59:57,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:57,374 INFO L480 AbstractCegarLoop]: Abstraction has 7684 states and 11586 transitions. [2019-01-14 14:59:57,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 11586 transitions. [2019-01-14 14:59:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:57,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:57,386 INFO L402 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] [2019-01-14 14:59:57,386 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:57,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1236908671, now seen corresponding path program 1 times [2019-01-14 14:59:57,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:57,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:57,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:57,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:57,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:57,455 INFO L87 Difference]: Start difference. First operand 7684 states and 11586 transitions. Second operand 3 states. [2019-01-14 14:59:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:57,697 INFO L93 Difference]: Finished difference Result 17928 states and 27204 transitions. [2019-01-14 14:59:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:57,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:57,720 INFO L225 Difference]: With dead ends: 17928 [2019-01-14 14:59:57,720 INFO L226 Difference]: Without dead ends: 10374 [2019-01-14 14:59:57,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2019-01-14 14:59:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 10372. [2019-01-14 14:59:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10372 states. [2019-01-14 14:59:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10372 states to 10372 states and 15618 transitions. [2019-01-14 14:59:57,981 INFO L78 Accepts]: Start accepts. Automaton has 10372 states and 15618 transitions. Word has length 27 [2019-01-14 14:59:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:57,982 INFO L480 AbstractCegarLoop]: Abstraction has 10372 states and 15618 transitions. [2019-01-14 14:59:57,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10372 states and 15618 transitions. [2019-01-14 14:59:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:57,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:57,994 INFO L402 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] [2019-01-14 14:59:57,995 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:57,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1683822281, now seen corresponding path program 1 times [2019-01-14 14:59:57,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:57,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:58,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:58,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:58,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:58,064 INFO L87 Difference]: Start difference. First operand 10372 states and 15618 transitions. Second operand 3 states. [2019-01-14 14:59:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:58,314 INFO L93 Difference]: Finished difference Result 15560 states and 23364 transitions. [2019-01-14 14:59:58,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:58,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:58,335 INFO L225 Difference]: With dead ends: 15560 [2019-01-14 14:59:58,335 INFO L226 Difference]: Without dead ends: 10502 [2019-01-14 14:59:58,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2019-01-14 14:59:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10500. [2019-01-14 14:59:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2019-01-14 14:59:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 15618 transitions. [2019-01-14 14:59:58,586 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 15618 transitions. Word has length 28 [2019-01-14 14:59:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:58,587 INFO L480 AbstractCegarLoop]: Abstraction has 10500 states and 15618 transitions. [2019-01-14 14:59:58,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 15618 transitions. [2019-01-14 14:59:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:58,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:58,601 INFO L402 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] [2019-01-14 14:59:58,601 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash -310322425, now seen corresponding path program 1 times [2019-01-14 14:59:58,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:58,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:58,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:58,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:58,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:58,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:58,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:58,660 INFO L87 Difference]: Start difference. First operand 10500 states and 15618 transitions. Second operand 3 states. [2019-01-14 14:59:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:58,971 INFO L93 Difference]: Finished difference Result 18440 states and 28036 transitions. [2019-01-14 14:59:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:58,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:59,011 INFO L225 Difference]: With dead ends: 18440 [2019-01-14 14:59:59,011 INFO L226 Difference]: Without dead ends: 18438 [2019-01-14 14:59:59,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2019-01-14 14:59:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 15364. [2019-01-14 14:59:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15364 states. [2019-01-14 14:59:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15364 states to 15364 states and 22146 transitions. [2019-01-14 14:59:59,492 INFO L78 Accepts]: Start accepts. Automaton has 15364 states and 22146 transitions. Word has length 28 [2019-01-14 14:59:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:59,492 INFO L480 AbstractCegarLoop]: Abstraction has 15364 states and 22146 transitions. [2019-01-14 14:59:59,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 15364 states and 22146 transitions. [2019-01-14 14:59:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:59,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:59,514 INFO L402 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] [2019-01-14 14:59:59,514 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:59,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1898670327, now seen corresponding path program 1 times [2019-01-14 14:59:59,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:59,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:59,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:59,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:59,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:59,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:59,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:59,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:59,591 INFO L87 Difference]: Start difference. First operand 15364 states and 22146 transitions. Second operand 3 states. [2019-01-14 14:59:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:59,958 INFO L93 Difference]: Finished difference Result 35592 states and 51588 transitions. [2019-01-14 14:59:59,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:59,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:59,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:59,996 INFO L225 Difference]: With dead ends: 35592 [2019-01-14 14:59:59,996 INFO L226 Difference]: Without dead ends: 20486 [2019-01-14 15:00:00,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2019-01-14 15:00:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20484. [2019-01-14 15:00:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-01-14 15:00:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 29442 transitions. [2019-01-14 15:00:00,375 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 29442 transitions. Word has length 28 [2019-01-14 15:00:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:00,376 INFO L480 AbstractCegarLoop]: Abstraction has 20484 states and 29442 transitions. [2019-01-14 15:00:00,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 29442 transitions. [2019-01-14 15:00:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:00:00,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:00,397 INFO L402 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] [2019-01-14 15:00:00,397 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1029845804, now seen corresponding path program 1 times [2019-01-14 15:00:00,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:00,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:00,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:00,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:00,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:00,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:00,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:00,471 INFO L87 Difference]: Start difference. First operand 20484 states and 29442 transitions. Second operand 3 states. [2019-01-14 15:00:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:00,882 INFO L93 Difference]: Finished difference Result 30728 states and 44036 transitions. [2019-01-14 15:00:00,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:00,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 15:00:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:00,927 INFO L225 Difference]: With dead ends: 30728 [2019-01-14 15:00:00,927 INFO L226 Difference]: Without dead ends: 20742 [2019-01-14 15:00:00,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2019-01-14 15:00:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20740. [2019-01-14 15:00:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20740 states. [2019-01-14 15:00:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20740 states to 20740 states and 29442 transitions. [2019-01-14 15:00:01,423 INFO L78 Accepts]: Start accepts. Automaton has 20740 states and 29442 transitions. Word has length 29 [2019-01-14 15:00:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:01,424 INFO L480 AbstractCegarLoop]: Abstraction has 20740 states and 29442 transitions. [2019-01-14 15:00:01,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 20740 states and 29442 transitions. [2019-01-14 15:00:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:00:01,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:01,441 INFO L402 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] [2019-01-14 15:00:01,441 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:01,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:01,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1270976786, now seen corresponding path program 1 times [2019-01-14 15:00:01,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:01,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:01,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:01,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:01,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:01,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:01,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:01,509 INFO L87 Difference]: Start difference. First operand 20740 states and 29442 transitions. Second operand 3 states. [2019-01-14 15:00:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:02,078 INFO L93 Difference]: Finished difference Result 35848 states and 51972 transitions. [2019-01-14 15:00:02,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:02,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 15:00:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:02,135 INFO L225 Difference]: With dead ends: 35848 [2019-01-14 15:00:02,135 INFO L226 Difference]: Without dead ends: 35846 [2019-01-14 15:00:02,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35846 states. [2019-01-14 15:00:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35846 to 30724. [2019-01-14 15:00:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30724 states. [2019-01-14 15:00:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30724 states to 30724 states and 42242 transitions. [2019-01-14 15:00:02,862 INFO L78 Accepts]: Start accepts. Automaton has 30724 states and 42242 transitions. Word has length 29 [2019-01-14 15:00:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:02,862 INFO L480 AbstractCegarLoop]: Abstraction has 30724 states and 42242 transitions. [2019-01-14 15:00:02,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 30724 states and 42242 transitions. [2019-01-14 15:00:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:00:02,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:02,879 INFO L402 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] [2019-01-14 15:00:02,879 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash -317371116, now seen corresponding path program 1 times [2019-01-14 15:00:02,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:02,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:02,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:02,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:02,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:02,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:02,936 INFO L87 Difference]: Start difference. First operand 30724 states and 42242 transitions. Second operand 3 states. [2019-01-14 15:00:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:03,403 INFO L93 Difference]: Finished difference Result 70664 states and 97540 transitions. [2019-01-14 15:00:03,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:03,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 15:00:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:03,441 INFO L225 Difference]: With dead ends: 70664 [2019-01-14 15:00:03,442 INFO L226 Difference]: Without dead ends: 40454 [2019-01-14 15:00:03,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40454 states. [2019-01-14 15:00:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40454 to 40452. [2019-01-14 15:00:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40452 states. [2019-01-14 15:00:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40452 states to 40452 states and 55298 transitions. [2019-01-14 15:00:04,368 INFO L78 Accepts]: Start accepts. Automaton has 40452 states and 55298 transitions. Word has length 29 [2019-01-14 15:00:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:04,368 INFO L480 AbstractCegarLoop]: Abstraction has 40452 states and 55298 transitions. [2019-01-14 15:00:04,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 40452 states and 55298 transitions. [2019-01-14 15:00:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 15:00:04,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:04,382 INFO L402 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] [2019-01-14 15:00:04,382 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash 745789822, now seen corresponding path program 1 times [2019-01-14 15:00:04,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:04,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:04,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:04,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:04,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:04,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:04,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:04,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:04,453 INFO L87 Difference]: Start difference. First operand 40452 states and 55298 transitions. Second operand 3 states. [2019-01-14 15:00:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:04,886 INFO L93 Difference]: Finished difference Result 60680 states and 82692 transitions. [2019-01-14 15:00:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:04,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-14 15:00:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:04,918 INFO L225 Difference]: With dead ends: 60680 [2019-01-14 15:00:04,918 INFO L226 Difference]: Without dead ends: 40966 [2019-01-14 15:00:04,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40966 states. [2019-01-14 15:00:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40966 to 40964. [2019-01-14 15:00:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40964 states. [2019-01-14 15:00:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40964 states to 40964 states and 55298 transitions. [2019-01-14 15:00:05,608 INFO L78 Accepts]: Start accepts. Automaton has 40964 states and 55298 transitions. Word has length 30 [2019-01-14 15:00:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:05,608 INFO L480 AbstractCegarLoop]: Abstraction has 40964 states and 55298 transitions. [2019-01-14 15:00:05,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 40964 states and 55298 transitions. [2019-01-14 15:00:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 15:00:05,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:05,633 INFO L402 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] [2019-01-14 15:00:05,633 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1248354884, now seen corresponding path program 1 times [2019-01-14 15:00:05,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:05,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:05,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:05,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:05,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:05,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:05,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:05,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:05,697 INFO L87 Difference]: Start difference. First operand 40964 states and 55298 transitions. Second operand 3 states. [2019-01-14 15:00:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:06,847 INFO L93 Difference]: Finished difference Result 119816 states and 159748 transitions. [2019-01-14 15:00:06,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:06,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-14 15:00:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:06,916 INFO L225 Difference]: With dead ends: 119816 [2019-01-14 15:00:06,916 INFO L226 Difference]: Without dead ends: 79878 [2019-01-14 15:00:06,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-01-14 15:00:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 79876. [2019-01-14 15:00:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-01-14 15:00:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 104450 transitions. [2019-01-14 15:00:08,471 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 104450 transitions. Word has length 30 [2019-01-14 15:00:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:08,471 INFO L480 AbstractCegarLoop]: Abstraction has 79876 states and 104450 transitions. [2019-01-14 15:00:08,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 104450 transitions. [2019-01-14 15:00:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 15:00:08,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:08,513 INFO L402 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] [2019-01-14 15:00:08,513 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash 339993018, now seen corresponding path program 1 times [2019-01-14 15:00:08,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:08,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:08,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:08,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:08,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:08,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:08,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:08,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:08,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:08,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:08,583 INFO L87 Difference]: Start difference. First operand 79876 states and 104450 transitions. Second operand 3 states. [2019-01-14 15:00:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:09,519 INFO L93 Difference]: Finished difference Result 88072 states and 118788 transitions. [2019-01-14 15:00:09,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:09,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-14 15:00:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:09,595 INFO L225 Difference]: With dead ends: 88072 [2019-01-14 15:00:09,595 INFO L226 Difference]: Without dead ends: 88070 [2019-01-14 15:00:09,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88070 states. [2019-01-14 15:00:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88070 to 79876. [2019-01-14 15:00:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-01-14 15:00:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 103426 transitions. [2019-01-14 15:00:11,473 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 103426 transitions. Word has length 30 [2019-01-14 15:00:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:11,473 INFO L480 AbstractCegarLoop]: Abstraction has 79876 states and 103426 transitions. [2019-01-14 15:00:11,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 103426 transitions. [2019-01-14 15:00:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 15:00:11,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:11,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:11,500 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:11,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:11,501 INFO L82 PathProgramCache]: Analyzing trace with hash -44080279, now seen corresponding path program 1 times [2019-01-14 15:00:11,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:11,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:11,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:11,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:11,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:11,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:11,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:11,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:11,565 INFO L87 Difference]: Start difference. First operand 79876 states and 103426 transitions. Second operand 3 states. [2019-01-14 15:00:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:12,855 INFO L93 Difference]: Finished difference Result 134152 states and 176132 transitions. [2019-01-14 15:00:12,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:12,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-14 15:00:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:12,977 INFO L225 Difference]: With dead ends: 134152 [2019-01-14 15:00:12,977 INFO L226 Difference]: Without dead ends: 134150 [2019-01-14 15:00:13,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134150 states. [2019-01-14 15:00:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134150 to 121860. [2019-01-14 15:00:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121860 states. [2019-01-14 15:00:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121860 states to 121860 states and 153602 transitions. [2019-01-14 15:00:15,298 INFO L78 Accepts]: Start accepts. Automaton has 121860 states and 153602 transitions. Word has length 31 [2019-01-14 15:00:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:15,298 INFO L480 AbstractCegarLoop]: Abstraction has 121860 states and 153602 transitions. [2019-01-14 15:00:15,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 121860 states and 153602 transitions. [2019-01-14 15:00:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 15:00:15,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:15,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:15,351 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1632428181, now seen corresponding path program 1 times [2019-01-14 15:00:15,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:15,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:15,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:15,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:15,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:15,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:15,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:15,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:15,414 INFO L87 Difference]: Start difference. First operand 121860 states and 153602 transitions. Second operand 3 states. [2019-01-14 15:00:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:19,818 INFO L93 Difference]: Finished difference Result 277512 states and 350212 transitions. [2019-01-14 15:00:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:19,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-14 15:00:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:19,941 INFO L225 Difference]: With dead ends: 277512 [2019-01-14 15:00:19,941 INFO L226 Difference]: Without dead ends: 156678 [2019-01-14 15:00:20,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156678 states. [2019-01-14 15:00:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156678 to 156676. [2019-01-14 15:00:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156676 states. [2019-01-14 15:00:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156676 states to 156676 states and 194562 transitions. [2019-01-14 15:00:22,924 INFO L78 Accepts]: Start accepts. Automaton has 156676 states and 194562 transitions. Word has length 31 [2019-01-14 15:00:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:22,924 INFO L480 AbstractCegarLoop]: Abstraction has 156676 states and 194562 transitions. [2019-01-14 15:00:22,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 156676 states and 194562 transitions. [2019-01-14 15:00:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 15:00:22,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:22,982 INFO L402 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] [2019-01-14 15:00:22,983 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:22,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1366272847, now seen corresponding path program 1 times [2019-01-14 15:00:22,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:22,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:22,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:23,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,044 INFO L87 Difference]: Start difference. First operand 156676 states and 194562 transitions. Second operand 3 states. [2019-01-14 15:00:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,759 INFO L93 Difference]: Finished difference Result 236552 states and 293892 transitions. [2019-01-14 15:00:24,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-14 15:00:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,898 INFO L225 Difference]: With dead ends: 236552 [2019-01-14 15:00:24,898 INFO L226 Difference]: Without dead ends: 159750 [2019-01-14 15:00:24,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159750 states. [2019-01-14 15:00:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159750 to 159748. [2019-01-14 15:00:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159748 states. [2019-01-14 15:00:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159748 states to 159748 states and 196610 transitions. [2019-01-14 15:00:28,714 INFO L78 Accepts]: Start accepts. Automaton has 159748 states and 196610 transitions. Word has length 32 [2019-01-14 15:00:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:28,714 INFO L480 AbstractCegarLoop]: Abstraction has 159748 states and 196610 transitions. [2019-01-14 15:00:28,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 159748 states and 196610 transitions. [2019-01-14 15:00:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 15:00:28,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:28,776 INFO L402 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] [2019-01-14 15:00:28,776 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:28,777 INFO L82 PathProgramCache]: Analyzing trace with hash 934549743, now seen corresponding path program 1 times [2019-01-14 15:00:28,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:28,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:28,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:28,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:28,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:28,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:28,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:28,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:28,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:28,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:28,839 INFO L87 Difference]: Start difference. First operand 159748 states and 196610 transitions. Second operand 3 states. [2019-01-14 15:00:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:31,987 INFO L93 Difference]: Finished difference Result 262152 states and 323588 transitions. [2019-01-14 15:00:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:31,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-14 15:00:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:32,246 INFO L225 Difference]: With dead ends: 262152 [2019-01-14 15:00:32,246 INFO L226 Difference]: Without dead ends: 262150 [2019-01-14 15:00:32,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262150 states. [2019-01-14 15:00:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262150 to 245764. [2019-01-14 15:00:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245764 states. [2019-01-14 15:00:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245764 states to 245764 states and 294914 transitions. [2019-01-14 15:00:36,224 INFO L78 Accepts]: Start accepts. Automaton has 245764 states and 294914 transitions. Word has length 32 [2019-01-14 15:00:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:36,224 INFO L480 AbstractCegarLoop]: Abstraction has 245764 states and 294914 transitions. [2019-01-14 15:00:36,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 245764 states and 294914 transitions. [2019-01-14 15:00:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 15:00:36,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:36,349 INFO L402 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] [2019-01-14 15:00:36,349 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash -653798159, now seen corresponding path program 1 times [2019-01-14 15:00:36,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:36,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:36,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:36,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:36,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:36,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:36,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:36,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:36,416 INFO L87 Difference]: Start difference. First operand 245764 states and 294914 transitions. Second operand 3 states. [2019-01-14 15:00:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:40,820 INFO L93 Difference]: Finished difference Result 552968 states and 659460 transitions. [2019-01-14 15:00:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:40,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-14 15:00:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:41,103 INFO L225 Difference]: With dead ends: 552968 [2019-01-14 15:00:41,104 INFO L226 Difference]: Without dead ends: 311302 [2019-01-14 15:00:41,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311302 states. [2019-01-14 15:00:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311302 to 311300. [2019-01-14 15:00:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311300 states. [2019-01-14 15:00:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311300 states to 311300 states and 364546 transitions. [2019-01-14 15:00:52,573 INFO L78 Accepts]: Start accepts. Automaton has 311300 states and 364546 transitions. Word has length 32 [2019-01-14 15:00:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:52,573 INFO L480 AbstractCegarLoop]: Abstraction has 311300 states and 364546 transitions. [2019-01-14 15:00:52,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 311300 states and 364546 transitions. [2019-01-14 15:00:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 15:00:52,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:52,709 INFO L402 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] [2019-01-14 15:00:52,709 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:52,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:52,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1093512896, now seen corresponding path program 1 times [2019-01-14 15:00:52,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:52,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:52,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:52,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:52,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:52,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:52,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:52,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:52,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:52,775 INFO L87 Difference]: Start difference. First operand 311300 states and 364546 transitions. Second operand 3 states. [2019-01-14 15:00:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:56,908 INFO L93 Difference]: Finished difference Result 466952 states and 544772 transitions. [2019-01-14 15:00:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:56,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-14 15:00:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:57,226 INFO L225 Difference]: With dead ends: 466952 [2019-01-14 15:00:57,226 INFO L226 Difference]: Without dead ends: 315398 [2019-01-14 15:00:57,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315398 states. [2019-01-14 15:01:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315398 to 315396. [2019-01-14 15:01:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315396 states. [2019-01-14 15:01:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315396 states to 315396 states and 364546 transitions. [2019-01-14 15:01:03,696 INFO L78 Accepts]: Start accepts. Automaton has 315396 states and 364546 transitions. Word has length 33 [2019-01-14 15:01:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:01:03,696 INFO L480 AbstractCegarLoop]: Abstraction has 315396 states and 364546 transitions. [2019-01-14 15:01:03,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:01:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 315396 states and 364546 transitions. [2019-01-14 15:01:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 15:01:03,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:01:03,828 INFO L402 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] [2019-01-14 15:01:03,829 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:01:03,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:01:03,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309694, now seen corresponding path program 1 times [2019-01-14 15:01:03,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:01:03,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:01:03,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:01:03,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:01:03,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:01:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:01:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:01:03,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:01:03,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:01:03,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:01:03,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:01:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:01:03,893 INFO L87 Difference]: Start difference. First operand 315396 states and 364546 transitions. Second operand 3 states. [2019-01-14 15:01:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:01:11,016 INFO L93 Difference]: Finished difference Result 507910 states and 581635 transitions. [2019-01-14 15:01:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:01:11,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-14 15:01:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:01:11,516 INFO L225 Difference]: With dead ends: 507910 [2019-01-14 15:01:11,516 INFO L226 Difference]: Without dead ends: 507908 [2019-01-14 15:01:11,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:01:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507908 states. [2019-01-14 15:01:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507908 to 491524. [2019-01-14 15:01:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491524 states. [2019-01-14 15:01:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491524 states to 491524 states and 557058 transitions. [2019-01-14 15:01:24,167 INFO L78 Accepts]: Start accepts. Automaton has 491524 states and 557058 transitions. Word has length 33 [2019-01-14 15:01:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:01:24,167 INFO L480 AbstractCegarLoop]: Abstraction has 491524 states and 557058 transitions. [2019-01-14 15:01:24,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:01:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 491524 states and 557058 transitions. [2019-01-14 15:01:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 15:01:24,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:01:24,446 INFO L402 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] [2019-01-14 15:01:24,446 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:01:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:01:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash -381038208, now seen corresponding path program 1 times [2019-01-14 15:01:24,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:01:24,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:01:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:01:24,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:01:24,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:01:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:01:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:01:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:01:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:01:24,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:01:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:01:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:01:24,515 INFO L87 Difference]: Start difference. First operand 491524 states and 557058 transitions. Second operand 3 states. [2019-01-14 15:01:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:01:38,796 INFO L93 Difference]: Finished difference Result 1097732 states and 1228802 transitions. [2019-01-14 15:01:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:01:38,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-14 15:01:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:01:38,797 INFO L225 Difference]: With dead ends: 1097732 [2019-01-14 15:01:38,797 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:01:39,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:01:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:01:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:01:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:01:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:01:39,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-01-14 15:01:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:01:39,038 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:01:39,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:01:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:01:39,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:01:39,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:01:39,158 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,158 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,158 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,158 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:01:39,158 INFO L451 ceAbstractionStarter]: At program point L218(lines 4 219) the Hoare annotation is: true [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,159 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,160 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,161 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-01-14 15:01:39,168 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,168 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-14 15:01:39,168 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:01:39,168 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-01-14 15:01:39,168 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-01-14 15:01:39,168 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-14 15:01:39,169 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-01-14 15:01:39,169 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,170 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,172 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-01-14 15:01:39,172 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-14 15:01:39,172 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-01-14 15:01:39,172 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2019-01-14 15:01:39,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:01:39 BoogieIcfgContainer [2019-01-14 15:01:39,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:01:39,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:01:39,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:01:39,190 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:01:39,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:51" (3/4) ... [2019-01-14 15:01:39,197 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:01:39,217 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:01:39,221 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 15:01:39,326 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:01:39,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:01:39,329 INFO L168 Benchmark]: Toolchain (without parser) took 109442.79 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 952.7 MB in the beginning and 4.2 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-14 15:01:39,331 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:01:39,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.03 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:01:39,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.05 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:01:39,333 INFO L168 Benchmark]: Boogie Preprocessor took 83.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:01:39,334 INFO L168 Benchmark]: RCFGBuilder took 705.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:01:39,338 INFO L168 Benchmark]: TraceAbstraction took 108078.20 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-14 15:01:39,338 INFO L168 Benchmark]: Witness Printer took 139.27 ms. Allocated memory is still 6.4 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:01:39,342 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.03 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.05 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 705.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108078.20 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 139.27 ms. Allocated memory is still 6.4 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. SAFE Result, 108.0s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 51.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4378 SDtfs, 2248 SDslu, 2956 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491524occurred in iteration=38, 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: 52.0s AutomataMinimizationTime, 39 MinimizatonAttempts, 65578 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 16393 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 58966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...