./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_10_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 0f7b0b589689413087c164ce10eb80c902ee4046 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:10:02,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:10:02,806 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:10:02,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:10:02,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:10:02,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:10:02,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:10:02,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:10:02,829 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:10:02,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:10:02,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:10:02,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:10:02,832 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:10:02,833 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:10:02,834 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:10:02,835 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:10:02,836 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:10:02,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:10:02,840 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:10:02,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:10:02,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:10:02,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:10:02,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:10:02,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:10:02,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:10:02,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:10:02,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:10:02,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:10:02,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:10:02,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:10:02,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:10:02,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:10:02,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:10:02,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:10:02,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:10:02,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:10:02,855 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:10:02,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:10:02,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:10:02,886 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:10:02,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:10:02,887 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:10:02,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:10:02,888 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:10:02,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:10:02,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:10:02,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:10:02,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:10:02,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:10:02,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:10:02,889 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:10:02,889 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:10:02,889 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:10:02,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:10:02,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:10:02,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:10:02,891 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:10:02,892 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:10:02,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:10:02,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:10:02,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:10:02,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:10:02,893 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:10:02,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:10:02,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:10:02,893 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-12-30 16:10:02,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:10:02,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:10:02,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:10:02,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:10:02,984 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:10:02,985 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:03,043 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86354f3c/fc0e05d012544f4fb576a516170cb735/FLAG612229969 [2018-12-30 16:10:03,481 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:10:03,482 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:03,490 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86354f3c/fc0e05d012544f4fb576a516170cb735/FLAG612229969 [2018-12-30 16:10:03,853 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86354f3c/fc0e05d012544f4fb576a516170cb735 [2018-12-30 16:10:03,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:10:03,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:10:03,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:03,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:10:03,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:10:03,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:03" (1/1) ... [2018-12-30 16:10:03,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb3b9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:03, skipping insertion in model container [2018-12-30 16:10:03,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:03" (1/1) ... [2018-12-30 16:10:03,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:10:03,905 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:10:04,147 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:04,151 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:10:04,181 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:04,195 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:10:04,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04 WrapperNode [2018-12-30 16:10:04,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:04,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:04,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:10:04,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:10:04,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:04,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:10:04,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:10:04,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:10:04,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (1/1) ... [2018-12-30 16:10:04,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:10:04,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:10:04,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:10:04,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:10:04,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (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 [2018-12-30 16:10:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:10:04,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:10:04,962 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:10:04,962 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-30 16:10:04,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:04 BoogieIcfgContainer [2018-12-30 16:10:04,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:10:04,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:10:04,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:10:04,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:10:04,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:10:03" (1/3) ... [2018-12-30 16:10:04,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d0dbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:04, skipping insertion in model container [2018-12-30 16:10:04,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:04" (2/3) ... [2018-12-30 16:10:04,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d0dbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:04, skipping insertion in model container [2018-12-30 16:10:04,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:04" (3/3) ... [2018-12-30 16:10:04,972 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:04,983 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:10:04,991 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:10:05,007 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:10:05,043 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:10:05,044 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:10:05,044 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:10:05,044 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:10:05,045 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:10:05,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:10:05,045 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:10:05,045 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:10:05,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:10:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-12-30 16:10:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:05,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:05,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:05,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash -977352837, now seen corresponding path program 1 times [2018-12-30 16:10:05,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:05,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:05,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:05,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:05,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:05,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:05,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:05,332 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-12-30 16:10:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:05,395 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2018-12-30 16:10:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:05,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:05,409 INFO L225 Difference]: With dead ends: 82 [2018-12-30 16:10:05,410 INFO L226 Difference]: Without dead ends: 68 [2018-12-30 16:10:05,413 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 [2018-12-30 16:10:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-30 16:10:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2018-12-30 16:10:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-30 16:10:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2018-12-30 16:10:05,455 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2018-12-30 16:10:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:05,456 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2018-12-30 16:10:05,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2018-12-30 16:10:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:05,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:05,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:05,457 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1564158851, now seen corresponding path program 1 times [2018-12-30 16:10:05,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:05,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:05,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:05,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:05,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:05,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:05,545 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand 3 states. [2018-12-30 16:10:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:05,607 INFO L93 Difference]: Finished difference Result 113 states and 208 transitions. [2018-12-30 16:10:05,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:05,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:05,609 INFO L225 Difference]: With dead ends: 113 [2018-12-30 16:10:05,610 INFO L226 Difference]: Without dead ends: 68 [2018-12-30 16:10:05,611 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 [2018-12-30 16:10:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-30 16:10:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-30 16:10:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-30 16:10:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-12-30 16:10:05,623 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 16 [2018-12-30 16:10:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:05,623 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-12-30 16:10:05,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-12-30 16:10:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:05,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:05,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:05,625 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:05,625 INFO L82 PathProgramCache]: Analyzing trace with hash -232953528, now seen corresponding path program 1 times [2018-12-30 16:10:05,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:05,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:05,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:05,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:05,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:05,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:05,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:05,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:05,721 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-12-30 16:10:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:05,770 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2018-12-30 16:10:05,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:05,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:05,772 INFO L225 Difference]: With dead ends: 104 [2018-12-30 16:10:05,775 INFO L226 Difference]: Without dead ends: 71 [2018-12-30 16:10:05,775 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 [2018-12-30 16:10:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-30 16:10:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-30 16:10:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-30 16:10:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 123 transitions. [2018-12-30 16:10:05,788 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 123 transitions. Word has length 17 [2018-12-30 16:10:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:05,788 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 123 transitions. [2018-12-30 16:10:05,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2018-12-30 16:10:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:05,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:05,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:05,791 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1244070778, now seen corresponding path program 1 times [2018-12-30 16:10:05,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:05,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:05,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:05,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:05,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:05,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:05,874 INFO L87 Difference]: Start difference. First operand 69 states and 123 transitions. Second operand 3 states. [2018-12-30 16:10:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:05,922 INFO L93 Difference]: Finished difference Result 132 states and 236 transitions. [2018-12-30 16:10:05,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:05,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:05,924 INFO L225 Difference]: With dead ends: 132 [2018-12-30 16:10:05,925 INFO L226 Difference]: Without dead ends: 130 [2018-12-30 16:10:05,926 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 [2018-12-30 16:10:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-30 16:10:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2018-12-30 16:10:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-30 16:10:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2018-12-30 16:10:05,937 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 17 [2018-12-30 16:10:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:05,937 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2018-12-30 16:10:05,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2018-12-30 16:10:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:05,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:05,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:05,939 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:05,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1830876792, now seen corresponding path program 1 times [2018-12-30 16:10:05,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:05,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,012 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand 3 states. [2018-12-30 16:10:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:06,095 INFO L93 Difference]: Finished difference Result 220 states and 394 transitions. [2018-12-30 16:10:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:06,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:06,098 INFO L225 Difference]: With dead ends: 220 [2018-12-30 16:10:06,098 INFO L226 Difference]: Without dead ends: 132 [2018-12-30 16:10:06,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 [2018-12-30 16:10:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-30 16:10:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-12-30 16:10:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-30 16:10:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 230 transitions. [2018-12-30 16:10:06,126 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 230 transitions. Word has length 17 [2018-12-30 16:10:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:06,126 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 230 transitions. [2018-12-30 16:10:06,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 230 transitions. [2018-12-30 16:10:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:06,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:06,128 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash 88725234, now seen corresponding path program 1 times [2018-12-30 16:10:06,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,250 INFO L87 Difference]: Start difference. First operand 130 states and 230 transitions. Second operand 3 states. [2018-12-30 16:10:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:06,272 INFO L93 Difference]: Finished difference Result 197 states and 345 transitions. [2018-12-30 16:10:06,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:06,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:06,274 INFO L225 Difference]: With dead ends: 197 [2018-12-30 16:10:06,274 INFO L226 Difference]: Without dead ends: 134 [2018-12-30 16:10:06,275 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 [2018-12-30 16:10:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-30 16:10:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-12-30 16:10:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-30 16:10:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2018-12-30 16:10:06,286 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 18 [2018-12-30 16:10:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:06,286 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2018-12-30 16:10:06,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2018-12-30 16:10:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:06,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:06,288 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,288 INFO L82 PathProgramCache]: Analyzing trace with hash -922392016, now seen corresponding path program 1 times [2018-12-30 16:10:06,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,355 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand 3 states. [2018-12-30 16:10:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:06,390 INFO L93 Difference]: Finished difference Result 380 states and 664 transitions. [2018-12-30 16:10:06,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:06,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:06,393 INFO L225 Difference]: With dead ends: 380 [2018-12-30 16:10:06,394 INFO L226 Difference]: Without dead ends: 254 [2018-12-30 16:10:06,395 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 [2018-12-30 16:10:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-30 16:10:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-12-30 16:10:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-30 16:10:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 434 transitions. [2018-12-30 16:10:06,413 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 434 transitions. Word has length 18 [2018-12-30 16:10:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:06,413 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 434 transitions. [2018-12-30 16:10:06,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 434 transitions. [2018-12-30 16:10:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:06,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:06,416 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,418 INFO L82 PathProgramCache]: Analyzing trace with hash -335586002, now seen corresponding path program 1 times [2018-12-30 16:10:06,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,505 INFO L87 Difference]: Start difference. First operand 252 states and 434 transitions. Second operand 3 states. [2018-12-30 16:10:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:06,547 INFO L93 Difference]: Finished difference Result 320 states and 556 transitions. [2018-12-30 16:10:06,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:06,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:06,550 INFO L225 Difference]: With dead ends: 320 [2018-12-30 16:10:06,550 INFO L226 Difference]: Without dead ends: 318 [2018-12-30 16:10:06,551 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 [2018-12-30 16:10:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-30 16:10:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 252. [2018-12-30 16:10:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-30 16:10:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 430 transitions. [2018-12-30 16:10:06,565 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 430 transitions. Word has length 18 [2018-12-30 16:10:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:06,565 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 430 transitions. [2018-12-30 16:10:06,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 430 transitions. [2018-12-30 16:10:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:06,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:06,567 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1470832605, now seen corresponding path program 1 times [2018-12-30 16:10:06,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,612 INFO L87 Difference]: Start difference. First operand 252 states and 430 transitions. Second operand 3 states. [2018-12-30 16:10:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:06,658 INFO L93 Difference]: Finished difference Result 468 states and 808 transitions. [2018-12-30 16:10:06,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:06,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:06,663 INFO L225 Difference]: With dead ends: 468 [2018-12-30 16:10:06,663 INFO L226 Difference]: Without dead ends: 466 [2018-12-30 16:10:06,664 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 [2018-12-30 16:10:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-30 16:10:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 352. [2018-12-30 16:10:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-30 16:10:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 590 transitions. [2018-12-30 16:10:06,682 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 590 transitions. Word has length 19 [2018-12-30 16:10:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:06,683 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 590 transitions. [2018-12-30 16:10:06,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 590 transitions. [2018-12-30 16:10:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:06,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:06,687 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,687 INFO L82 PathProgramCache]: Analyzing trace with hash 884026591, now seen corresponding path program 1 times [2018-12-30 16:10:06,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,764 INFO L87 Difference]: Start difference. First operand 352 states and 590 transitions. Second operand 3 states. [2018-12-30 16:10:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:06,869 INFO L93 Difference]: Finished difference Result 836 states and 1408 transitions. [2018-12-30 16:10:06,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:06,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:06,874 INFO L225 Difference]: With dead ends: 836 [2018-12-30 16:10:06,874 INFO L226 Difference]: Without dead ends: 490 [2018-12-30 16:10:06,876 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 [2018-12-30 16:10:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-12-30 16:10:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2018-12-30 16:10:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-12-30 16:10:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2018-12-30 16:10:06,899 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 19 [2018-12-30 16:10:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:06,900 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2018-12-30 16:10:06,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2018-12-30 16:10:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:06,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,903 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] [2018-12-30 16:10:06,904 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1648615131, now seen corresponding path program 1 times [2018-12-30 16:10:06,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,981 INFO L87 Difference]: Start difference. First operand 488 states and 810 transitions. Second operand 3 states. [2018-12-30 16:10:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,062 INFO L93 Difference]: Finished difference Result 740 states and 1224 transitions. [2018-12-30 16:10:07,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:07,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,070 INFO L225 Difference]: With dead ends: 740 [2018-12-30 16:10:07,070 INFO L226 Difference]: Without dead ends: 502 [2018-12-30 16:10:07,071 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 [2018-12-30 16:10:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-12-30 16:10:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2018-12-30 16:10:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-12-30 16:10:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 818 transitions. [2018-12-30 16:10:07,091 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 818 transitions. Word has length 20 [2018-12-30 16:10:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,091 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 818 transitions. [2018-12-30 16:10:07,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 818 transitions. [2018-12-30 16:10:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:07,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,093 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] [2018-12-30 16:10:07,093 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1635234915, now seen corresponding path program 1 times [2018-12-30 16:10:07,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,173 INFO L87 Difference]: Start difference. First operand 500 states and 818 transitions. Second operand 3 states. [2018-12-30 16:10:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,280 INFO L93 Difference]: Finished difference Result 904 states and 1500 transitions. [2018-12-30 16:10:07,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,289 INFO L225 Difference]: With dead ends: 904 [2018-12-30 16:10:07,289 INFO L226 Difference]: Without dead ends: 902 [2018-12-30 16:10:07,290 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 [2018-12-30 16:10:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-12-30 16:10:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 708. [2018-12-30 16:10:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-12-30 16:10:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1130 transitions. [2018-12-30 16:10:07,320 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1130 transitions. Word has length 20 [2018-12-30 16:10:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,320 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 1130 transitions. [2018-12-30 16:10:07,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1130 transitions. [2018-12-30 16:10:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:07,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,325 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] [2018-12-30 16:10:07,325 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1048428901, now seen corresponding path program 1 times [2018-12-30 16:10:07,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,393 INFO L87 Difference]: Start difference. First operand 708 states and 1130 transitions. Second operand 3 states. [2018-12-30 16:10:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,521 INFO L93 Difference]: Finished difference Result 1656 states and 2652 transitions. [2018-12-30 16:10:07,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,528 INFO L225 Difference]: With dead ends: 1656 [2018-12-30 16:10:07,529 INFO L226 Difference]: Without dead ends: 966 [2018-12-30 16:10:07,531 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 [2018-12-30 16:10:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-12-30 16:10:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2018-12-30 16:10:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-12-30 16:10:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1522 transitions. [2018-12-30 16:10:07,572 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1522 transitions. Word has length 20 [2018-12-30 16:10:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,573 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1522 transitions. [2018-12-30 16:10:07,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1522 transitions. [2018-12-30 16:10:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:07,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,579 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] [2018-12-30 16:10:07,579 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,579 INFO L82 PathProgramCache]: Analyzing trace with hash -847110476, now seen corresponding path program 1 times [2018-12-30 16:10:07,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,667 INFO L87 Difference]: Start difference. First operand 964 states and 1522 transitions. Second operand 3 states. [2018-12-30 16:10:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,787 INFO L93 Difference]: Finished difference Result 1448 states and 2276 transitions. [2018-12-30 16:10:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,795 INFO L225 Difference]: With dead ends: 1448 [2018-12-30 16:10:07,795 INFO L226 Difference]: Without dead ends: 982 [2018-12-30 16:10:07,797 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 [2018-12-30 16:10:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-12-30 16:10:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2018-12-30 16:10:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2018-12-30 16:10:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1522 transitions. [2018-12-30 16:10:07,845 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1522 transitions. Word has length 21 [2018-12-30 16:10:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,846 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 1522 transitions. [2018-12-30 16:10:07,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1522 transitions. [2018-12-30 16:10:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:07,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,848 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] [2018-12-30 16:10:07,853 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1858227726, now seen corresponding path program 1 times [2018-12-30 16:10:07,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,944 INFO L87 Difference]: Start difference. First operand 980 states and 1522 transitions. Second operand 3 states. [2018-12-30 16:10:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,069 INFO L93 Difference]: Finished difference Result 1736 states and 2740 transitions. [2018-12-30 16:10:08,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:08,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,080 INFO L225 Difference]: With dead ends: 1736 [2018-12-30 16:10:08,080 INFO L226 Difference]: Without dead ends: 1734 [2018-12-30 16:10:08,082 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 [2018-12-30 16:10:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2018-12-30 16:10:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1412. [2018-12-30 16:10:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-12-30 16:10:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2130 transitions. [2018-12-30 16:10:08,144 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2130 transitions. Word has length 21 [2018-12-30 16:10:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:08,144 INFO L480 AbstractCegarLoop]: Abstraction has 1412 states and 2130 transitions. [2018-12-30 16:10:08,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2130 transitions. [2018-12-30 16:10:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:08,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:08,150 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] [2018-12-30 16:10:08,150 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1849933556, now seen corresponding path program 1 times [2018-12-30 16:10:08,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:08,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:08,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:08,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,225 INFO L87 Difference]: Start difference. First operand 1412 states and 2130 transitions. Second operand 3 states. [2018-12-30 16:10:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,382 INFO L93 Difference]: Finished difference Result 3272 states and 4948 transitions. [2018-12-30 16:10:08,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:08,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,394 INFO L225 Difference]: With dead ends: 3272 [2018-12-30 16:10:08,394 INFO L226 Difference]: Without dead ends: 1894 [2018-12-30 16:10:08,397 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 [2018-12-30 16:10:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2018-12-30 16:10:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2018-12-30 16:10:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2018-12-30 16:10:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2818 transitions. [2018-12-30 16:10:08,476 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2818 transitions. Word has length 21 [2018-12-30 16:10:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:08,477 INFO L480 AbstractCegarLoop]: Abstraction has 1892 states and 2818 transitions. [2018-12-30 16:10:08,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2818 transitions. [2018-12-30 16:10:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:08,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:08,481 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] [2018-12-30 16:10:08,483 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1770269606, now seen corresponding path program 1 times [2018-12-30 16:10:08,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:08,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:08,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:08,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:08,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:08,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:08,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,559 INFO L87 Difference]: Start difference. First operand 1892 states and 2818 transitions. Second operand 3 states. [2018-12-30 16:10:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,685 INFO L93 Difference]: Finished difference Result 2840 states and 4212 transitions. [2018-12-30 16:10:08,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:08,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,697 INFO L225 Difference]: With dead ends: 2840 [2018-12-30 16:10:08,697 INFO L226 Difference]: Without dead ends: 1926 [2018-12-30 16:10:08,700 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 [2018-12-30 16:10:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2018-12-30 16:10:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2018-12-30 16:10:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2018-12-30 16:10:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2818 transitions. [2018-12-30 16:10:08,779 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2818 transitions. Word has length 22 [2018-12-30 16:10:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:08,779 INFO L480 AbstractCegarLoop]: Abstraction has 1924 states and 2818 transitions. [2018-12-30 16:10:08,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2818 transitions. [2018-12-30 16:10:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:08,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:08,785 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] [2018-12-30 16:10:08,785 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:08,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1513580440, now seen corresponding path program 1 times [2018-12-30 16:10:08,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:08,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:08,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:08,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:08,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:08,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:08,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:08,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,875 INFO L87 Difference]: Start difference. First operand 1924 states and 2818 transitions. Second operand 3 states. [2018-12-30 16:10:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:09,048 INFO L93 Difference]: Finished difference Result 3336 states and 4964 transitions. [2018-12-30 16:10:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:09,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:09,064 INFO L225 Difference]: With dead ends: 3336 [2018-12-30 16:10:09,065 INFO L226 Difference]: Without dead ends: 3334 [2018-12-30 16:10:09,066 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 [2018-12-30 16:10:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2018-12-30 16:10:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2820. [2018-12-30 16:10:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2018-12-30 16:10:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4002 transitions. [2018-12-30 16:10:09,164 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4002 transitions. Word has length 22 [2018-12-30 16:10:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:09,165 INFO L480 AbstractCegarLoop]: Abstraction has 2820 states and 4002 transitions. [2018-12-30 16:10:09,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4002 transitions. [2018-12-30 16:10:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:09,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:09,170 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] [2018-12-30 16:10:09,171 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:09,171 INFO L82 PathProgramCache]: Analyzing trace with hash 926774426, now seen corresponding path program 1 times [2018-12-30 16:10:09,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:09,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:09,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:09,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:09,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:09,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:09,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:09,245 INFO L87 Difference]: Start difference. First operand 2820 states and 4002 transitions. Second operand 3 states. [2018-12-30 16:10:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:09,437 INFO L93 Difference]: Finished difference Result 6472 states and 9188 transitions. [2018-12-30 16:10:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:09,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:09,455 INFO L225 Difference]: With dead ends: 6472 [2018-12-30 16:10:09,456 INFO L226 Difference]: Without dead ends: 3718 [2018-12-30 16:10:09,460 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 [2018-12-30 16:10:09,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2018-12-30 16:10:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2018-12-30 16:10:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2018-12-30 16:10:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 5186 transitions. [2018-12-30 16:10:09,605 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 5186 transitions. Word has length 22 [2018-12-30 16:10:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:09,605 INFO L480 AbstractCegarLoop]: Abstraction has 3716 states and 5186 transitions. [2018-12-30 16:10:09,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 5186 transitions. [2018-12-30 16:10:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:09,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:09,613 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] [2018-12-30 16:10:09,614 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash -323431223, now seen corresponding path program 1 times [2018-12-30 16:10:09,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:09,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:09,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:09,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:09,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:09,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:09,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:09,698 INFO L87 Difference]: Start difference. First operand 3716 states and 5186 transitions. Second operand 3 states. [2018-12-30 16:10:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:09,866 INFO L93 Difference]: Finished difference Result 5576 states and 7748 transitions. [2018-12-30 16:10:09,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:09,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:09,885 INFO L225 Difference]: With dead ends: 5576 [2018-12-30 16:10:09,885 INFO L226 Difference]: Without dead ends: 3782 [2018-12-30 16:10:09,889 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 [2018-12-30 16:10:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2018-12-30 16:10:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3780. [2018-12-30 16:10:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2018-12-30 16:10:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5186 transitions. [2018-12-30 16:10:10,050 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5186 transitions. Word has length 23 [2018-12-30 16:10:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:10,050 INFO L480 AbstractCegarLoop]: Abstraction has 3780 states and 5186 transitions. [2018-12-30 16:10:10,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5186 transitions. [2018-12-30 16:10:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:10,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:10,058 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] [2018-12-30 16:10:10,058 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1334548473, now seen corresponding path program 1 times [2018-12-30 16:10:10,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:10,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:10,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:10,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:10,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:10,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:10,136 INFO L87 Difference]: Start difference. First operand 3780 states and 5186 transitions. Second operand 3 states. [2018-12-30 16:10:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:10,358 INFO L93 Difference]: Finished difference Result 6408 states and 8900 transitions. [2018-12-30 16:10:10,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:10,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:10,402 INFO L225 Difference]: With dead ends: 6408 [2018-12-30 16:10:10,406 INFO L226 Difference]: Without dead ends: 6406 [2018-12-30 16:10:10,411 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 [2018-12-30 16:10:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2018-12-30 16:10:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5636. [2018-12-30 16:10:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2018-12-30 16:10:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7490 transitions. [2018-12-30 16:10:10,598 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7490 transitions. Word has length 23 [2018-12-30 16:10:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:10,598 INFO L480 AbstractCegarLoop]: Abstraction has 5636 states and 7490 transitions. [2018-12-30 16:10:10,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7490 transitions. [2018-12-30 16:10:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:10,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:10,607 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] [2018-12-30 16:10:10,607 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:10,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1921354487, now seen corresponding path program 1 times [2018-12-30 16:10:10,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:10,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:10,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:10,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:10,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:10,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:10,678 INFO L87 Difference]: Start difference. First operand 5636 states and 7490 transitions. Second operand 3 states. [2018-12-30 16:10:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:10,936 INFO L93 Difference]: Finished difference Result 12808 states and 16964 transitions. [2018-12-30 16:10:10,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:10,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:10,952 INFO L225 Difference]: With dead ends: 12808 [2018-12-30 16:10:10,952 INFO L226 Difference]: Without dead ends: 7302 [2018-12-30 16:10:10,960 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 [2018-12-30 16:10:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2018-12-30 16:10:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7300. [2018-12-30 16:10:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2018-12-30 16:10:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 9474 transitions. [2018-12-30 16:10:11,331 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 9474 transitions. Word has length 23 [2018-12-30 16:10:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:11,332 INFO L480 AbstractCegarLoop]: Abstraction has 7300 states and 9474 transitions. [2018-12-30 16:10:11,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 9474 transitions. [2018-12-30 16:10:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:11,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:11,342 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] [2018-12-30 16:10:11,342 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:11,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:11,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1578886031, now seen corresponding path program 1 times [2018-12-30 16:10:11,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:11,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:11,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:11,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:11,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:11,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:11,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:11,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:11,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:11,409 INFO L87 Difference]: Start difference. First operand 7300 states and 9474 transitions. Second operand 3 states. [2018-12-30 16:10:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:11,635 INFO L93 Difference]: Finished difference Result 10952 states and 14148 transitions. [2018-12-30 16:10:11,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:11,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:11,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:11,649 INFO L225 Difference]: With dead ends: 10952 [2018-12-30 16:10:11,649 INFO L226 Difference]: Without dead ends: 7430 [2018-12-30 16:10:11,655 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 [2018-12-30 16:10:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2018-12-30 16:10:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 7428. [2018-12-30 16:10:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7428 states. [2018-12-30 16:10:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 9474 transitions. [2018-12-30 16:10:11,893 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 9474 transitions. Word has length 24 [2018-12-30 16:10:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:11,894 INFO L480 AbstractCegarLoop]: Abstraction has 7428 states and 9474 transitions. [2018-12-30 16:10:11,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 9474 transitions. [2018-12-30 16:10:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:11,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:11,903 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] [2018-12-30 16:10:11,903 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:11,903 INFO L82 PathProgramCache]: Analyzing trace with hash 567768781, now seen corresponding path program 1 times [2018-12-30 16:10:11,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:11,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:11,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:11,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:11,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:11,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:11,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:11,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:11,968 INFO L87 Difference]: Start difference. First operand 7428 states and 9474 transitions. Second operand 3 states. [2018-12-30 16:10:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:12,314 INFO L93 Difference]: Finished difference Result 12296 states and 15748 transitions. [2018-12-30 16:10:12,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:12,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:12,338 INFO L225 Difference]: With dead ends: 12296 [2018-12-30 16:10:12,339 INFO L226 Difference]: Without dead ends: 12294 [2018-12-30 16:10:12,344 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 [2018-12-30 16:10:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2018-12-30 16:10:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11268. [2018-12-30 16:10:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-12-30 16:10:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13954 transitions. [2018-12-30 16:10:12,663 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13954 transitions. Word has length 24 [2018-12-30 16:10:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:12,663 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 13954 transitions. [2018-12-30 16:10:12,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13954 transitions. [2018-12-30 16:10:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:12,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:12,682 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] [2018-12-30 16:10:12,682 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash -19037233, now seen corresponding path program 1 times [2018-12-30 16:10:12,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:12,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:12,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:12,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:12,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:12,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:12,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:12,759 INFO L87 Difference]: Start difference. First operand 11268 states and 13954 transitions. Second operand 3 states. [2018-12-30 16:10:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:13,189 INFO L93 Difference]: Finished difference Result 25352 states and 31108 transitions. [2018-12-30 16:10:13,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:13,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:13,220 INFO L225 Difference]: With dead ends: 25352 [2018-12-30 16:10:13,220 INFO L226 Difference]: Without dead ends: 14342 [2018-12-30 16:10:13,237 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 [2018-12-30 16:10:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2018-12-30 16:10:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 14340. [2018-12-30 16:10:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2018-12-30 16:10:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 17154 transitions. [2018-12-30 16:10:13,819 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 17154 transitions. Word has length 24 [2018-12-30 16:10:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:13,819 INFO L480 AbstractCegarLoop]: Abstraction has 14340 states and 17154 transitions. [2018-12-30 16:10:13,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 17154 transitions. [2018-12-30 16:10:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:13,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:13,839 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] [2018-12-30 16:10:13,839 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash 421179102, now seen corresponding path program 1 times [2018-12-30 16:10:13,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:13,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:13,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:13,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:13,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:13,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:13,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:13,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:13,920 INFO L87 Difference]: Start difference. First operand 14340 states and 17154 transitions. Second operand 3 states. [2018-12-30 16:10:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:14,279 INFO L93 Difference]: Finished difference Result 21512 states and 25604 transitions. [2018-12-30 16:10:14,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:14,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:14,305 INFO L225 Difference]: With dead ends: 21512 [2018-12-30 16:10:14,306 INFO L226 Difference]: Without dead ends: 14598 [2018-12-30 16:10:14,317 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 [2018-12-30 16:10:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2018-12-30 16:10:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2018-12-30 16:10:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14596 states. [2018-12-30 16:10:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 17154 transitions. [2018-12-30 16:10:14,756 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 17154 transitions. Word has length 25 [2018-12-30 16:10:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:14,756 INFO L480 AbstractCegarLoop]: Abstraction has 14596 states and 17154 transitions. [2018-12-30 16:10:14,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 17154 transitions. [2018-12-30 16:10:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:14,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:14,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] [2018-12-30 16:10:14,777 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash -589938148, now seen corresponding path program 1 times [2018-12-30 16:10:14,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:14,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:14,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:14,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:14,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:14,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:14,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:14,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:14,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:14,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:14,842 INFO L87 Difference]: Start difference. First operand 14596 states and 17154 transitions. Second operand 3 states. [2018-12-30 16:10:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:15,497 INFO L93 Difference]: Finished difference Result 23558 states and 27395 transitions. [2018-12-30 16:10:15,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:15,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:15,541 INFO L225 Difference]: With dead ends: 23558 [2018-12-30 16:10:15,541 INFO L226 Difference]: Without dead ends: 23556 [2018-12-30 16:10:15,547 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 [2018-12-30 16:10:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23556 states. [2018-12-30 16:10:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23556 to 22532. [2018-12-30 16:10:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2018-12-30 16:10:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 25858 transitions. [2018-12-30 16:10:16,197 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 25858 transitions. Word has length 25 [2018-12-30 16:10:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:16,198 INFO L480 AbstractCegarLoop]: Abstraction has 22532 states and 25858 transitions. [2018-12-30 16:10:16,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 25858 transitions. [2018-12-30 16:10:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:16,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:16,241 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] [2018-12-30 16:10:16,241 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1176744162, now seen corresponding path program 1 times [2018-12-30 16:10:16,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:16,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:16,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:16,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:16,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:16,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:16,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:16,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:16,301 INFO L87 Difference]: Start difference. First operand 22532 states and 25858 transitions. Second operand 3 states. [2018-12-30 16:10:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:17,046 INFO L93 Difference]: Finished difference Result 50180 states and 56578 transitions. [2018-12-30 16:10:17,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:17,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:17,048 INFO L225 Difference]: With dead ends: 50180 [2018-12-30 16:10:17,048 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:10:17,086 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 [2018-12-30 16:10:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:10:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:10:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:10:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:10:17,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-12-30 16:10:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:17,088 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:10:17,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:10:17,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:10:17,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:10:17,177 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-12-30 16:10:17,177 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,177 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-12-30 16:10:17,177 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:10:17,177 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:10:17,178 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-30 16:10:17,178 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,178 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-30 16:10:17,178 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,178 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,178 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,178 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-12-30 16:10:17,178 INFO L451 ceAbstractionStarter]: At program point L162(lines 4 163) the Hoare annotation is: true [2018-12-30 16:10:17,183 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-30 16:10:17,183 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 16:10:17,184 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-12-30 16:10:17,184 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,184 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,184 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-30 16:10:17,184 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 16:10:17,184 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,184 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,184 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,188 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,188 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,188 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-12-30 16:10:17,188 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,188 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-30 16:10:17,188 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:10:17,188 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,189 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 16:10:17,189 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-12-30 16:10:17,189 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,189 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-12-30 16:10:17,189 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 16:10:17,189 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-12-30 16:10:17,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:10:17 BoogieIcfgContainer [2018-12-30 16:10:17,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:10:17,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:10:17,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:10:17,202 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:10:17,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:04" (3/4) ... [2018-12-30 16:10:17,210 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:10:17,225 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 16:10:17,226 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:10:17,346 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:10:17,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:10:17,352 INFO L168 Benchmark]: Toolchain (without parser) took 13493.01 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 493.9 MB). Free memory was 951.4 MB in the beginning and 839.2 MB in the end (delta: 112.1 MB). Peak memory consumption was 606.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:17,355 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-12-30 16:10:17,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.53 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:17,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.43 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:17,358 INFO L168 Benchmark]: Boogie Preprocessor took 26.01 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:17,358 INFO L168 Benchmark]: RCFGBuilder took 695.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:17,359 INFO L168 Benchmark]: TraceAbstraction took 12237.68 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 371.7 MB). Free memory was 1.1 GB in the beginning and 839.2 MB in the end (delta: 245.2 MB). Peak memory consumption was 616.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:17,359 INFO L168 Benchmark]: Witness Printer took 148.86 ms. Allocated memory is still 1.5 GB. Free memory is still 839.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:17,366 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.18 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 334.53 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 44.43 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.01 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 695.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12237.68 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 371.7 MB). Free memory was 1.1 GB in the beginning and 839.2 MB in the end (delta: 245.2 MB). Peak memory consumption was 616.9 MB. Max. memory is 11.5 GB. * Witness Printer took 148.86 ms. Allocated memory is still 1.5 GB. Free memory is still 839.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. SAFE Result, 12.1s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2276 SDtfs, 1149 SDslu, 1505 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22532occurred in iteration=27, 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: 3.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 24156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...