./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer --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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:32:18,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:32:18,183 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:32:18,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:32:18,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:32:18,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:32:18,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:32:18,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:32:18,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:32:18,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:32:18,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:32:18,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:32:18,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:32:18,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:32:18,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:32:18,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:32:18,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:32:18,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:32:18,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:32:18,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:32:18,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:32:18,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:32:18,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:32:18,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:32:18,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:32:18,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:32:18,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:32:18,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:32:18,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:32:18,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:32:18,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:32:18,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:32:18,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:32:18,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:32:18,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:32:18,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:32:18,210 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:32:18,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:32:18,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:32:18,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:32:18,219 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:32:18,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:32:18,220 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:32:18,220 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:32:18,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:32:18,220 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:32:18,220 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:32:18,221 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:32:18,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:32:18,221 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:32:18,221 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:32:18,221 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:32:18,221 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:32:18,221 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:32:18,222 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:32:18,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:32:18,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:32:18,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:32:18,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:32:18,222 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:32:18,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:32:18,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:32:18,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:32:18,223 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:32:18,223 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:32:18,223 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:32:18,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:32:18,224 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer 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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-11-28 12:32:18,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:32:18,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:32:18,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:32:18,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:32:18,258 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:32:18,259 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:32:18,302 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/data/c73c674c1/ba0cf5ec3700420d87bf9deb884ecf03/FLAGd66946a8c [2018-11-28 12:32:18,727 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:32:18,728 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:32:18,734 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/data/c73c674c1/ba0cf5ec3700420d87bf9deb884ecf03/FLAGd66946a8c [2018-11-28 12:32:18,744 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/data/c73c674c1/ba0cf5ec3700420d87bf9deb884ecf03 [2018-11-28 12:32:18,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:32:18,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:32:18,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:32:18,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:32:18,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:32:18,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28035eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18, skipping insertion in model container [2018-11-28 12:32:18,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:32:18,772 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:32:18,886 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:32:18,889 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:32:18,907 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:32:18,915 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:32:18,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18 WrapperNode [2018-11-28 12:32:18,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:32:18,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:32:18,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:32:18,916 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:32:18,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:32:18,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:32:18,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:32:18,967 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:32:18,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... [2018-11-28 12:32:18,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:32:18,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:32:18,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:32:18,991 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:32:18,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/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-11-28 12:32:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:32:19,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:32:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:32:19,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:32:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:32:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:32:19,217 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:32:19,217 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:32:19,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:32:19 BoogieIcfgContainer [2018-11-28 12:32:19,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:32:19,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:32:19,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:32:19,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:32:19,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:32:18" (1/3) ... [2018-11-28 12:32:19,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9a87ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:32:19, skipping insertion in model container [2018-11-28 12:32:19,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:18" (2/3) ... [2018-11-28 12:32:19,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9a87ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:32:19, skipping insertion in model container [2018-11-28 12:32:19,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:32:19" (3/3) ... [2018-11-28 12:32:19,223 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:32:19,229 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:32:19,233 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:32:19,246 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:32:19,272 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:32:19,273 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:32:19,273 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:32:19,273 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:32:19,274 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:32:19,274 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:32:19,274 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:32:19,274 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:32:19,274 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:32:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-28 12:32:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:32:19,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:19,293 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-11-28 12:32:19,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:19,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-11-28 12:32:19,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:19,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:19,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:19,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:19,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:19,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:19,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:19,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:19,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:19,461 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-11-28 12:32:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:19,506 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-11-28 12:32:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:19,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:32:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:19,517 INFO L225 Difference]: With dead ends: 105 [2018-11-28 12:32:19,517 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 12:32:19,519 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-11-28 12:32:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 12:32:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-11-28 12:32:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 12:32:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-11-28 12:32:19,550 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-11-28 12:32:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:19,550 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-11-28 12:32:19,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-11-28 12:32:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:32:19,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:19,551 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-11-28 12:32:19,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:19,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-11-28 12:32:19,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:19,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:19,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:19,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:19,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:19,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:19,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:19,601 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-11-28 12:32:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:19,637 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-11-28 12:32:19,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:19,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:32:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:19,638 INFO L225 Difference]: With dead ends: 147 [2018-11-28 12:32:19,638 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 12:32:19,639 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-11-28 12:32:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 12:32:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-28 12:32:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 12:32:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-11-28 12:32:19,645 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-11-28 12:32:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:19,645 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-11-28 12:32:19,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-11-28 12:32:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:32:19,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:19,646 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-11-28 12:32:19,647 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:19,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:19,647 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-11-28 12:32:19,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:19,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:19,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:19,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:19,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:19,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:19,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:19,687 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-11-28 12:32:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:19,700 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-11-28 12:32:19,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:19,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:32:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:19,701 INFO L225 Difference]: With dead ends: 135 [2018-11-28 12:32:19,702 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 12:32:19,702 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-11-28 12:32:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 12:32:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-28 12:32:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 12:32:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-11-28 12:32:19,707 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-11-28 12:32:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:19,708 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-11-28 12:32:19,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-11-28 12:32:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:32:19,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:19,708 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-11-28 12:32:19,709 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:19,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-11-28 12:32:19,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:19,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:19,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:19,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:19,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:19,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:19,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:19,755 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-11-28 12:32:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:19,771 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-11-28 12:32:19,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:19,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:32:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:19,772 INFO L225 Difference]: With dead ends: 172 [2018-11-28 12:32:19,773 INFO L226 Difference]: Without dead ends: 170 [2018-11-28 12:32:19,773 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-11-28 12:32:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-28 12:32:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-11-28 12:32:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 12:32:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-11-28 12:32:19,781 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-11-28 12:32:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:19,782 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-11-28 12:32:19,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-11-28 12:32:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:32:19,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:19,782 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-11-28 12:32:19,783 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:19,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-11-28 12:32:19,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:19,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:19,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:19,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:19,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:19,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:19,815 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-11-28 12:32:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:19,830 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-11-28 12:32:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:19,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:32:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:19,831 INFO L225 Difference]: With dead ends: 284 [2018-11-28 12:32:19,832 INFO L226 Difference]: Without dead ends: 172 [2018-11-28 12:32:19,832 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-11-28 12:32:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-28 12:32:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-11-28 12:32:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-28 12:32:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-11-28 12:32:19,841 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-11-28 12:32:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:19,841 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-11-28 12:32:19,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-11-28 12:32:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:32:19,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:19,842 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-11-28 12:32:19,843 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:19,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-11-28 12:32:19,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:19,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:19,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:19,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:19,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:19,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:19,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:19,887 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-11-28 12:32:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:19,902 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-11-28 12:32:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:19,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:32:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:19,903 INFO L225 Difference]: With dead ends: 255 [2018-11-28 12:32:19,903 INFO L226 Difference]: Without dead ends: 174 [2018-11-28 12:32:19,904 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-11-28 12:32:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-28 12:32:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-28 12:32:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 12:32:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-11-28 12:32:19,912 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-11-28 12:32:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:19,912 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-11-28 12:32:19,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-11-28 12:32:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:32:19,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:19,913 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-11-28 12:32:19,913 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:19,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-11-28 12:32:19,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:19,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:19,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:19,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:19,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:19,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:19,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:19,942 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-11-28 12:32:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:19,964 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-11-28 12:32:19,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:19,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:32:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:19,969 INFO L225 Difference]: With dead ends: 324 [2018-11-28 12:32:19,969 INFO L226 Difference]: Without dead ends: 322 [2018-11-28 12:32:19,970 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-11-28 12:32:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-28 12:32:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-11-28 12:32:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-28 12:32:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-11-28 12:32:19,978 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-11-28 12:32:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:19,978 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-11-28 12:32:19,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-11-28 12:32:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:32:19,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:19,981 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-11-28 12:32:19,981 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:19,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-11-28 12:32:19,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,015 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-11-28 12:32:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,040 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-11-28 12:32:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:32:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,042 INFO L225 Difference]: With dead ends: 552 [2018-11-28 12:32:20,042 INFO L226 Difference]: Without dead ends: 330 [2018-11-28 12:32:20,043 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-11-28 12:32:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-28 12:32:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-11-28 12:32:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-28 12:32:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-11-28 12:32:20,052 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-11-28 12:32:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,053 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-11-28 12:32:20,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-11-28 12:32:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:32:20,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,054 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-11-28 12:32:20,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,099 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-11-28 12:32:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,124 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-11-28 12:32:20,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:32:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,126 INFO L225 Difference]: With dead ends: 492 [2018-11-28 12:32:20,126 INFO L226 Difference]: Without dead ends: 334 [2018-11-28 12:32:20,127 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-11-28 12:32:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-28 12:32:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-11-28 12:32:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-28 12:32:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-11-28 12:32:20,136 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-11-28 12:32:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,137 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-11-28 12:32:20,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-11-28 12:32:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:32:20,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,138 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-11-28 12:32:20,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,159 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-11-28 12:32:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,181 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-11-28 12:32:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:32:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,184 INFO L225 Difference]: With dead ends: 620 [2018-11-28 12:32:20,184 INFO L226 Difference]: Without dead ends: 618 [2018-11-28 12:32:20,185 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-11-28 12:32:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-28 12:32:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-11-28 12:32:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-28 12:32:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-11-28 12:32:20,199 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-11-28 12:32:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,199 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-11-28 12:32:20,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-11-28 12:32:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:32:20,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,201 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-11-28 12:32:20,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,223 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-11-28 12:32:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,252 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-11-28 12:32:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:32:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,255 INFO L225 Difference]: With dead ends: 1084 [2018-11-28 12:32:20,255 INFO L226 Difference]: Without dead ends: 642 [2018-11-28 12:32:20,256 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-11-28 12:32:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-28 12:32:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-11-28 12:32:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-28 12:32:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-11-28 12:32:20,274 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-11-28 12:32:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,275 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-11-28 12:32:20,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-11-28 12:32:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:32:20,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,277 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-11-28 12:32:20,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,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-11-28 12:32:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,304 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-11-28 12:32:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,335 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-11-28 12:32:20,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:32:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,338 INFO L225 Difference]: With dead ends: 960 [2018-11-28 12:32:20,338 INFO L226 Difference]: Without dead ends: 650 [2018-11-28 12:32:20,339 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-11-28 12:32:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-28 12:32:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-11-28 12:32:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-28 12:32:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-11-28 12:32:20,358 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-11-28 12:32:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,359 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-11-28 12:32:20,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-11-28 12:32:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:32:20,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,360 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-11-28 12:32:20,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,383 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-11-28 12:32:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,408 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-11-28 12:32:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:32:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,412 INFO L225 Difference]: With dead ends: 1196 [2018-11-28 12:32:20,413 INFO L226 Difference]: Without dead ends: 1194 [2018-11-28 12:32:20,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-11-28 12:32:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-11-28 12:32:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-11-28 12:32:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-28 12:32:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-11-28 12:32:20,439 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-11-28 12:32:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,440 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-11-28 12:32:20,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-11-28 12:32:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:32:20,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,442 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,442 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-11-28 12:32:20,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,471 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-11-28 12:32:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,502 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-11-28 12:32:20,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:32:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,507 INFO L225 Difference]: With dead ends: 2140 [2018-11-28 12:32:20,507 INFO L226 Difference]: Without dead ends: 1258 [2018-11-28 12:32:20,509 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-11-28 12:32:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-11-28 12:32:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-11-28 12:32:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-11-28 12:32:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-11-28 12:32:20,550 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-11-28 12:32:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,550 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-11-28 12:32:20,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-11-28 12:32:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:32:20,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,552 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-11-28 12:32:20,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,583 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-11-28 12:32:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,631 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-11-28 12:32:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:32:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,636 INFO L225 Difference]: With dead ends: 1884 [2018-11-28 12:32:20,636 INFO L226 Difference]: Without dead ends: 1274 [2018-11-28 12:32:20,637 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-11-28 12:32:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-11-28 12:32:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-11-28 12:32:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-28 12:32:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-11-28 12:32:20,678 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-11-28 12:32:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,678 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-11-28 12:32:20,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-11-28 12:32:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:32:20,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,680 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-11-28 12:32:20,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,704 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-11-28 12:32:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,759 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-11-28 12:32:20,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:32:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,767 INFO L225 Difference]: With dead ends: 2316 [2018-11-28 12:32:20,767 INFO L226 Difference]: Without dead ends: 2314 [2018-11-28 12:32:20,768 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-11-28 12:32:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-28 12:32:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-11-28 12:32:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-11-28 12:32:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-11-28 12:32:20,814 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-11-28 12:32:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,814 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-11-28 12:32:20,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-11-28 12:32:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:32:20,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,817 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-11-28 12:32:20,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,842 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-11-28 12:32:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:20,886 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-11-28 12:32:20,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:20,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:32:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:20,893 INFO L225 Difference]: With dead ends: 4236 [2018-11-28 12:32:20,893 INFO L226 Difference]: Without dead ends: 2474 [2018-11-28 12:32:20,896 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-11-28 12:32:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-11-28 12:32:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-11-28 12:32:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-11-28 12:32:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-11-28 12:32:20,958 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-11-28 12:32:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:20,959 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-11-28 12:32:20,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-11-28 12:32:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:32:20,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:20,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:20,961 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:20,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-11-28 12:32:20,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:20,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:20,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:20,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:20,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:20,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:20,989 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-11-28 12:32:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:21,038 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-11-28 12:32:21,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:21,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:32:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:21,046 INFO L225 Difference]: With dead ends: 3708 [2018-11-28 12:32:21,046 INFO L226 Difference]: Without dead ends: 2506 [2018-11-28 12:32:21,048 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-11-28 12:32:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-28 12:32:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-11-28 12:32:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-11-28 12:32:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-11-28 12:32:21,111 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-11-28 12:32:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:21,112 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-11-28 12:32:21,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-11-28 12:32:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:32:21,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:21,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:21,114 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:21,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-11-28 12:32:21,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:21,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:21,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:21,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:21,139 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-11-28 12:32:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:21,206 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-11-28 12:32:21,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:21,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:32:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:21,218 INFO L225 Difference]: With dead ends: 4492 [2018-11-28 12:32:21,218 INFO L226 Difference]: Without dead ends: 4490 [2018-11-28 12:32:21,220 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-11-28 12:32:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-28 12:32:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-11-28 12:32:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-11-28 12:32:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-11-28 12:32:21,301 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-11-28 12:32:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:21,302 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-11-28 12:32:21,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-11-28 12:32:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:32:21,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:21,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:21,306 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:21,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,306 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-11-28 12:32:21,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:21,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:21,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:21,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:21,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:21,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:21,322 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-11-28 12:32:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:21,398 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-11-28 12:32:21,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:21,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:32:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:21,412 INFO L225 Difference]: With dead ends: 8396 [2018-11-28 12:32:21,412 INFO L226 Difference]: Without dead ends: 4874 [2018-11-28 12:32:21,417 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-11-28 12:32:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-28 12:32:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-11-28 12:32:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-11-28 12:32:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-11-28 12:32:21,534 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-11-28 12:32:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:21,534 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-11-28 12:32:21,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-11-28 12:32:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:32:21,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:21,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:21,564 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:21,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-11-28 12:32:21,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:21,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:21,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:21,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:21,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:21,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:21,598 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-11-28 12:32:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:21,674 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-11-28 12:32:21,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:21,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:32:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:21,683 INFO L225 Difference]: With dead ends: 7308 [2018-11-28 12:32:21,684 INFO L226 Difference]: Without dead ends: 4938 [2018-11-28 12:32:21,687 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-11-28 12:32:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-11-28 12:32:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-11-28 12:32:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-11-28 12:32:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-11-28 12:32:21,801 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-11-28 12:32:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:21,801 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-11-28 12:32:21,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-11-28 12:32:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:32:21,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:21,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:21,806 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:21,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-11-28 12:32:21,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:21,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:21,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:21,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:21,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:21,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:21,830 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-11-28 12:32:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:21,956 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-11-28 12:32:21,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:21,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:32:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:21,973 INFO L225 Difference]: With dead ends: 14412 [2018-11-28 12:32:21,974 INFO L226 Difference]: Without dead ends: 9610 [2018-11-28 12:32:21,982 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-11-28 12:32:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-11-28 12:32:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-11-28 12:32:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-28 12:32:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-11-28 12:32:22,207 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-11-28 12:32:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:22,207 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-11-28 12:32:22,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-11-28 12:32:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:32:22,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:22,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:22,215 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:22,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-11-28 12:32:22,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:22,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:22,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:22,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:22,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:22,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:22,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:22,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:22,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:22,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:22,230 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-11-28 12:32:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:22,402 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-11-28 12:32:22,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:22,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:32:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:22,420 INFO L225 Difference]: With dead ends: 11148 [2018-11-28 12:32:22,420 INFO L226 Difference]: Without dead ends: 11146 [2018-11-28 12:32:22,424 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-11-28 12:32:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-28 12:32:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-11-28 12:32:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-28 12:32:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-11-28 12:32:22,666 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-11-28 12:32:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:22,666 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-11-28 12:32:22,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-11-28 12:32:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:32:22,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:22,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:22,675 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:22,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-11-28 12:32:22,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:22,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:22,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:22,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:22,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:22,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:22,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:22,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:22,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:22,698 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-11-28 12:32:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:22,900 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-11-28 12:32:22,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:22,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:32:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:22,926 INFO L225 Difference]: With dead ends: 16780 [2018-11-28 12:32:22,926 INFO L226 Difference]: Without dead ends: 16778 [2018-11-28 12:32:22,931 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-11-28 12:32:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-11-28 12:32:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-11-28 12:32:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-28 12:32:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-11-28 12:32:23,244 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-11-28 12:32:23,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:23,244 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-11-28 12:32:23,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:23,244 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-11-28 12:32:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:32:23,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:23,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:23,261 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:23,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:23,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-11-28 12:32:23,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:23,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:23,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:23,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:23,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:23,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:23,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:23,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:23,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:23,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:23,282 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2018-11-28 12:32:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:23,544 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2018-11-28 12:32:23,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:23,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:32:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:23,564 INFO L225 Difference]: With dead ends: 32908 [2018-11-28 12:32:23,564 INFO L226 Difference]: Without dead ends: 18826 [2018-11-28 12:32:23,585 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-11-28 12:32:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2018-11-28 12:32:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2018-11-28 12:32:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2018-11-28 12:32:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2018-11-28 12:32:23,908 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2018-11-28 12:32:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:23,908 INFO L480 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2018-11-28 12:32:23,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2018-11-28 12:32:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:32:23,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:23,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:23,921 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:23,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:23,922 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2018-11-28 12:32:23,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:23,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:23,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:23,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:23,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:23,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:23,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:23,939 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2018-11-28 12:32:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:24,178 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2018-11-28 12:32:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:24,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:32:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:24,191 INFO L225 Difference]: With dead ends: 28428 [2018-11-28 12:32:24,191 INFO L226 Difference]: Without dead ends: 19210 [2018-11-28 12:32:24,198 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-11-28 12:32:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2018-11-28 12:32:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2018-11-28 12:32:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-11-28 12:32:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2018-11-28 12:32:24,431 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2018-11-28 12:32:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:24,431 INFO L480 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2018-11-28 12:32:24,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2018-11-28 12:32:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:32:24,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:24,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:24,439 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:24,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2018-11-28 12:32:24,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:24,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:24,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:24,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:24,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:24,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:24,459 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2018-11-28 12:32:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:24,738 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2018-11-28 12:32:24,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:24,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:32:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:24,760 INFO L225 Difference]: With dead ends: 32780 [2018-11-28 12:32:24,760 INFO L226 Difference]: Without dead ends: 32778 [2018-11-28 12:32:24,764 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-11-28 12:32:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2018-11-28 12:32:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2018-11-28 12:32:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2018-11-28 12:32:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2018-11-28 12:32:25,164 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2018-11-28 12:32:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:25,164 INFO L480 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2018-11-28 12:32:25,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2018-11-28 12:32:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:32:25,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:25,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:25,178 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:25,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:25,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2018-11-28 12:32:25,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:25,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:25,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:25,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:25,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:25,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:25,218 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2018-11-28 12:32:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:25,613 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2018-11-28 12:32:25,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:25,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:32:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:25,643 INFO L225 Difference]: With dead ends: 65548 [2018-11-28 12:32:25,643 INFO L226 Difference]: Without dead ends: 37386 [2018-11-28 12:32:25,669 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-11-28 12:32:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2018-11-28 12:32:26,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2018-11-28 12:32:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2018-11-28 12:32:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2018-11-28 12:32:26,255 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2018-11-28 12:32:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:26,255 INFO L480 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2018-11-28 12:32:26,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2018-11-28 12:32:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:32:26,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:26,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:26,268 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:26,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2018-11-28 12:32:26,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:26,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:26,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:26,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:26,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:26,310 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2018-11-28 12:32:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:26,625 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2018-11-28 12:32:26,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:26,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 12:32:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:26,654 INFO L225 Difference]: With dead ends: 56076 [2018-11-28 12:32:26,654 INFO L226 Difference]: Without dead ends: 37898 [2018-11-28 12:32:26,669 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-11-28 12:32:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2018-11-28 12:32:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2018-11-28 12:32:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2018-11-28 12:32:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2018-11-28 12:32:27,228 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2018-11-28 12:32:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:27,228 INFO L480 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2018-11-28 12:32:27,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2018-11-28 12:32:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:32:27,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:27,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:27,240 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:27,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2018-11-28 12:32:27,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:27,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:27,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:27,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:27,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:27,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:27,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:27,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:27,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:27,273 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2018-11-28 12:32:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:27,750 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2018-11-28 12:32:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:27,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 12:32:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:27,804 INFO L225 Difference]: With dead ends: 63500 [2018-11-28 12:32:27,804 INFO L226 Difference]: Without dead ends: 63498 [2018-11-28 12:32:27,815 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-11-28 12:32:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2018-11-28 12:32:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2018-11-28 12:32:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2018-11-28 12:32:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2018-11-28 12:32:28,592 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2018-11-28 12:32:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:28,592 INFO L480 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2018-11-28 12:32:28,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2018-11-28 12:32:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:32:28,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:28,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:28,619 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:28,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2018-11-28 12:32:28,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:28,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:28,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:28,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:28,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:28,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:28,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:28,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:28,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:28,640 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2018-11-28 12:32:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:29,422 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2018-11-28 12:32:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:29,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 12:32:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:29,471 INFO L225 Difference]: With dead ends: 130060 [2018-11-28 12:32:29,471 INFO L226 Difference]: Without dead ends: 73738 [2018-11-28 12:32:29,505 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-11-28 12:32:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2018-11-28 12:32:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2018-11-28 12:32:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2018-11-28 12:32:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2018-11-28 12:32:30,469 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2018-11-28 12:32:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:30,469 INFO L480 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2018-11-28 12:32:30,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2018-11-28 12:32:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 12:32:30,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:30,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:30,506 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:30,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:30,506 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2018-11-28 12:32:30,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:30,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:30,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:30,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:30,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:30,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:30,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:30,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:30,527 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2018-11-28 12:32:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:31,286 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2018-11-28 12:32:31,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:31,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 12:32:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:31,340 INFO L225 Difference]: With dead ends: 110604 [2018-11-28 12:32:31,340 INFO L226 Difference]: Without dead ends: 74762 [2018-11-28 12:32:31,365 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-11-28 12:32:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2018-11-28 12:32:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2018-11-28 12:32:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2018-11-28 12:32:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2018-11-28 12:32:32,567 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2018-11-28 12:32:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:32,568 INFO L480 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2018-11-28 12:32:32,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2018-11-28 12:32:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 12:32:32,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:32,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:32,595 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:32,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2018-11-28 12:32:32,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:32,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:32,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:32,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:32,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:32,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:32,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:32,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:32,634 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2018-11-28 12:32:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:33,656 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2018-11-28 12:32:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:33,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 12:32:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:33,756 INFO L225 Difference]: With dead ends: 122892 [2018-11-28 12:32:33,756 INFO L226 Difference]: Without dead ends: 122890 [2018-11-28 12:32:33,778 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-11-28 12:32:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2018-11-28 12:32:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2018-11-28 12:32:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2018-11-28 12:32:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2018-11-28 12:32:35,411 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2018-11-28 12:32:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:35,411 INFO L480 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2018-11-28 12:32:35,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2018-11-28 12:32:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 12:32:35,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:35,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:35,465 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:35,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2018-11-28 12:32:35,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:35,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:35,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:35,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:35,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:35,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:35,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:35,491 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2018-11-28 12:32:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:36,871 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2018-11-28 12:32:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:36,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 12:32:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:36,995 INFO L225 Difference]: With dead ends: 258060 [2018-11-28 12:32:36,995 INFO L226 Difference]: Without dead ends: 145418 [2018-11-28 12:32:37,064 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-11-28 12:32:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2018-11-28 12:32:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2018-11-28 12:32:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2018-11-28 12:32:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2018-11-28 12:32:39,431 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2018-11-28 12:32:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:39,431 INFO L480 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2018-11-28 12:32:39,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2018-11-28 12:32:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 12:32:39,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:39,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:39,490 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:39,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:39,491 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2018-11-28 12:32:39,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:39,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:39,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:39,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:39,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:39,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:39,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:39,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:39,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:39,526 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2018-11-28 12:32:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:41,191 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2018-11-28 12:32:41,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:41,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 12:32:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:41,300 INFO L225 Difference]: With dead ends: 218124 [2018-11-28 12:32:41,301 INFO L226 Difference]: Without dead ends: 147466 [2018-11-28 12:32:41,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-11-28 12:32:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-11-28 12:32:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2018-11-28 12:32:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2018-11-28 12:32:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2018-11-28 12:32:43,230 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2018-11-28 12:32:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:43,230 INFO L480 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2018-11-28 12:32:43,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2018-11-28 12:32:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 12:32:43,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:43,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:43,289 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:43,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2018-11-28 12:32:43,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:43,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:43,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:43,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:43,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:43,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:43,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:43,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:43,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:43,326 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2018-11-28 12:32:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:45,610 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2018-11-28 12:32:45,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:45,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 12:32:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:45,799 INFO L225 Difference]: With dead ends: 237578 [2018-11-28 12:32:45,799 INFO L226 Difference]: Without dead ends: 237576 [2018-11-28 12:32:45,824 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-11-28 12:32:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2018-11-28 12:32:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2018-11-28 12:32:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2018-11-28 12:32:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2018-11-28 12:32:50,533 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2018-11-28 12:32:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:50,533 INFO L480 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2018-11-28 12:32:50,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2018-11-28 12:32:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 12:32:50,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:50,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:50,645 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:50,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:50,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2018-11-28 12:32:50,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:50,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:50,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:50,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:50,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:50,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:50,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:50,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:50,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:50,665 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2018-11-28 12:32:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:53,718 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2018-11-28 12:32:53,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:53,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 12:32:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:53,719 INFO L225 Difference]: With dead ends: 512008 [2018-11-28 12:32:53,719 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:32:53,905 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-11-28 12:32:53,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:32:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:32:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:32:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:32:53,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-11-28 12:32:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:53,906 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:32:53,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:32:53,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:32:53,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:32:53,959 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 12:32:53,959 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:32:53,959 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:32:53,959 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 12:32:53,959 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:32:53,959 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,960 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,961 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-11-28 12:32:53,962 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,963 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-28 12:32:53,963 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,963 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-28 12:32:53,963 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-28 12:32:53,963 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,963 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,963 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-11-28 12:32:53,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:32:53 BoogieIcfgContainer [2018-11-28 12:32:53,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:32:53,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:32:53,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:32:53,970 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:32:53,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:32:19" (3/4) ... [2018-11-28 12:32:53,974 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:32:53,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:32:53,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:32:53,986 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:32:53,986 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 12:32:53,987 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:32:54,042 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d5ef2e0a-82cd-4005-8f12-035d56f80678/bin-2019/uautomizer/witness.graphml [2018-11-28 12:32:54,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:32:54,043 INFO L168 Benchmark]: Toolchain (without parser) took 35296.82 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 954.4 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-28 12:32:54,045 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:32:54,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.21 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:54,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:54,046 INFO L168 Benchmark]: Boogie Preprocessor took 23.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:54,046 INFO L168 Benchmark]: RCFGBuilder took 226.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:54,046 INFO L168 Benchmark]: TraceAbstraction took 34751.28 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-28 12:32:54,046 INFO L168 Benchmark]: Witness Printer took 72.63 ms. Allocated memory is still 5.5 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:54,048 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.21 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 226.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34751.28 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 72.63 ms. Allocated memory is still 5.5 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. SAFE Result, 34.6s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 15.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, 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: 17.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...