./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 18:56:14,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 18:56:14,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 18:56:14,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 18:56:14,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 18:56:14,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 18:56:14,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 18:56:14,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 18:56:14,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 18:56:14,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 18:56:14,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 18:56:14,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 18:56:14,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 18:56:14,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 18:56:14,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 18:56:14,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 18:56:14,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 18:56:14,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 18:56:14,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 18:56:14,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 18:56:14,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 18:56:14,460 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 18:56:14,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 18:56:14,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 18:56:14,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 18:56:14,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 18:56:14,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 18:56:14,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 18:56:14,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 18:56:14,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 18:56:14,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 18:56:14,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 18:56:14,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 18:56:14,465 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 18:56:14,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 18:56:14,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 18:56:14,466 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 18:56:14,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 18:56:14,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 18:56:14,473 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 18:56:14,473 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 18:56:14,474 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 18:56:14,474 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 18:56:14,474 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 18:56:14,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 18:56:14,474 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 18:56:14,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 18:56:14,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 18:56:14,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 18:56:14,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 18:56:14,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 18:56:14,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 18:56:14,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 18:56:14,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 18:56:14,476 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 18:56:14,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 18:56:14,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 18:56:14,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 18:56:14,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 18:56:14,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 18:56:14,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:56:14,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 18:56:14,477 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 18:56:14,477 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 18:56:14,477 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 18:56:14,477 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 18:56:14,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 18:56:14,477 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_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-12-08 18:56:14,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 18:56:14,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 18:56:14,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 18:56:14,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 18:56:14,506 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 18:56:14,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 18:56:14,543 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/data/247124932/e87d8ad06a32410d885f4a82a4cd7c2c/FLAG20dfc21cf [2018-12-08 18:56:14,984 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 18:56:14,985 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 18:56:14,992 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/data/247124932/e87d8ad06a32410d885f4a82a4cd7c2c/FLAG20dfc21cf [2018-12-08 18:56:15,001 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/data/247124932/e87d8ad06a32410d885f4a82a4cd7c2c [2018-12-08 18:56:15,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 18:56:15,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 18:56:15,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 18:56:15,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 18:56:15,007 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 18:56:15,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15, skipping insertion in model container [2018-12-08 18:56:15,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 18:56:15,030 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 18:56:15,144 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:56:15,147 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 18:56:15,169 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:56:15,180 INFO L195 MainTranslator]: Completed translation [2018-12-08 18:56:15,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15 WrapperNode [2018-12-08 18:56:15,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 18:56:15,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 18:56:15,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 18:56:15,182 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 18:56:15,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 18:56:15,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 18:56:15,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 18:56:15,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 18:56:15,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... [2018-12-08 18:56:15,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 18:56:15,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 18:56:15,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 18:56:15,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 18:56:15,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/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-12-08 18:56:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 18:56:15,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 18:56:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 18:56:15,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 18:56:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 18:56:15,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 18:56:15,464 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 18:56:15,464 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 18:56:15,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:56:15 BoogieIcfgContainer [2018-12-08 18:56:15,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 18:56:15,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 18:56:15,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 18:56:15,467 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 18:56:15,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 06:56:15" (1/3) ... [2018-12-08 18:56:15,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c5a831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:56:15, skipping insertion in model container [2018-12-08 18:56:15,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:56:15" (2/3) ... [2018-12-08 18:56:15,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c5a831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:56:15, skipping insertion in model container [2018-12-08 18:56:15,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:56:15" (3/3) ... [2018-12-08 18:56:15,469 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 18:56:15,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 18:56:15,479 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 18:56:15,488 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 18:56:15,506 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 18:56:15,506 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 18:56:15,506 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 18:56:15,506 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 18:56:15,506 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 18:56:15,506 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 18:56:15,507 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 18:56:15,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 18:56:15,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 18:56:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-08 18:56:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 18:56:15,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:15,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:56:15,522 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:15,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2018-12-08 18:56:15,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:15,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:15,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:15,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:15,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:15,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:15,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,641 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-12-08 18:56:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:15,679 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2018-12-08 18:56:15,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:15,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 18:56:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:15,687 INFO L225 Difference]: With dead ends: 117 [2018-12-08 18:56:15,687 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 18:56:15,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 18:56:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-12-08 18:56:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-08 18:56:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2018-12-08 18:56:15,713 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2018-12-08 18:56:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:15,713 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2018-12-08 18:56:15,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2018-12-08 18:56:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 18:56:15,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:15,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:56:15,714 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:15,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2018-12-08 18:56:15,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:15,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:15,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:15,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:15,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:15,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:15,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:15,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,746 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2018-12-08 18:56:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:15,767 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2018-12-08 18:56:15,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:15,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 18:56:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:15,768 INFO L225 Difference]: With dead ends: 167 [2018-12-08 18:56:15,768 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 18:56:15,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 18:56:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-12-08 18:56:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 18:56:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2018-12-08 18:56:15,774 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2018-12-08 18:56:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:15,774 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2018-12-08 18:56:15,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2018-12-08 18:56:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 18:56:15,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:15,775 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-12-08 18:56:15,775 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:15,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2018-12-08 18:56:15,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:15,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:15,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:15,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:15,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:15,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:15,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,798 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2018-12-08 18:56:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:15,817 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2018-12-08 18:56:15,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:15,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 18:56:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:15,818 INFO L225 Difference]: With dead ends: 153 [2018-12-08 18:56:15,818 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 18:56:15,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 18:56:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-08 18:56:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 18:56:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2018-12-08 18:56:15,823 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2018-12-08 18:56:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:15,824 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2018-12-08 18:56:15,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2018-12-08 18:56:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 18:56:15,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:15,824 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-12-08 18:56:15,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:15,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2018-12-08 18:56:15,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:15,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:15,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:15,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:15,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:15,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:15,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,848 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2018-12-08 18:56:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:15,867 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2018-12-08 18:56:15,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:15,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 18:56:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:15,869 INFO L225 Difference]: With dead ends: 196 [2018-12-08 18:56:15,869 INFO L226 Difference]: Without dead ends: 194 [2018-12-08 18:56:15,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-08 18:56:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-12-08 18:56:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 18:56:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2018-12-08 18:56:15,875 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2018-12-08 18:56:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:15,875 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2018-12-08 18:56:15,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2018-12-08 18:56:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 18:56:15,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:15,876 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-12-08 18:56:15,877 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:15,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2018-12-08 18:56:15,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:15,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:15,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:15,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:15,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:15,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:15,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:15,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,895 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2018-12-08 18:56:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:15,905 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2018-12-08 18:56:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:15,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 18:56:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:15,906 INFO L225 Difference]: With dead ends: 324 [2018-12-08 18:56:15,907 INFO L226 Difference]: Without dead ends: 196 [2018-12-08 18:56:15,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-08 18:56:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-12-08 18:56:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-08 18:56:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2018-12-08 18:56:15,914 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2018-12-08 18:56:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:15,914 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2018-12-08 18:56:15,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2018-12-08 18:56:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 18:56:15,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:15,915 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-12-08 18:56:15,915 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:15,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:15,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2018-12-08 18:56:15,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:15,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:15,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:15,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:15,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,933 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2018-12-08 18:56:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:15,942 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2018-12-08 18:56:15,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:15,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 18:56:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:15,943 INFO L225 Difference]: With dead ends: 291 [2018-12-08 18:56:15,943 INFO L226 Difference]: Without dead ends: 198 [2018-12-08 18:56:15,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-08 18:56:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-12-08 18:56:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-08 18:56:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2018-12-08 18:56:15,949 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2018-12-08 18:56:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:15,949 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2018-12-08 18:56:15,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2018-12-08 18:56:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 18:56:15,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:15,950 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-12-08 18:56:15,950 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:15,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:15,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2018-12-08 18:56:15,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:15,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:15,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:15,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:15,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:15,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:15,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,965 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2018-12-08 18:56:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:15,975 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2018-12-08 18:56:15,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:15,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 18:56:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:15,977 INFO L225 Difference]: With dead ends: 372 [2018-12-08 18:56:15,977 INFO L226 Difference]: Without dead ends: 370 [2018-12-08 18:56:15,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-12-08 18:56:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-12-08 18:56:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-08 18:56:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2018-12-08 18:56:15,983 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2018-12-08 18:56:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:15,983 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2018-12-08 18:56:15,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2018-12-08 18:56:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 18:56:15,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:15,984 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-12-08 18:56:15,984 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:15,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:15,985 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2018-12-08 18:56:15,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:15,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:15,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:15,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:15,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:15,997 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2018-12-08 18:56:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,009 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2018-12-08 18:56:16,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 18:56:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,010 INFO L225 Difference]: With dead ends: 632 [2018-12-08 18:56:16,010 INFO L226 Difference]: Without dead ends: 378 [2018-12-08 18:56:16,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-08 18:56:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-12-08 18:56:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-08 18:56:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2018-12-08 18:56:16,018 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2018-12-08 18:56:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,018 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2018-12-08 18:56:16,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2018-12-08 18:56:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 18:56:16,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,019 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-12-08 18:56:16,019 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2018-12-08 18:56:16,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,032 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2018-12-08 18:56:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,043 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2018-12-08 18:56:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 18:56:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,044 INFO L225 Difference]: With dead ends: 564 [2018-12-08 18:56:16,044 INFO L226 Difference]: Without dead ends: 382 [2018-12-08 18:56:16,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-08 18:56:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-12-08 18:56:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-08 18:56:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2018-12-08 18:56:16,052 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2018-12-08 18:56:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,052 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2018-12-08 18:56:16,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2018-12-08 18:56:16,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 18:56:16,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,053 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-12-08 18:56:16,053 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2018-12-08 18:56:16,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,068 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2018-12-08 18:56:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,081 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2018-12-08 18:56:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 18:56:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,083 INFO L225 Difference]: With dead ends: 716 [2018-12-08 18:56:16,083 INFO L226 Difference]: Without dead ends: 714 [2018-12-08 18:56:16,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-08 18:56:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2018-12-08 18:56:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-08 18:56:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2018-12-08 18:56:16,093 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2018-12-08 18:56:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,094 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2018-12-08 18:56:16,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2018-12-08 18:56:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 18:56:16,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,095 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-12-08 18:56:16,095 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2018-12-08 18:56:16,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,108 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2018-12-08 18:56:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,124 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2018-12-08 18:56:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 18:56:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,125 INFO L225 Difference]: With dead ends: 1244 [2018-12-08 18:56:16,126 INFO L226 Difference]: Without dead ends: 738 [2018-12-08 18:56:16,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-08 18:56:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-12-08 18:56:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-08 18:56:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2018-12-08 18:56:16,139 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2018-12-08 18:56:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,139 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2018-12-08 18:56:16,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2018-12-08 18:56:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 18:56:16,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,140 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-12-08 18:56:16,140 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2018-12-08 18:56:16,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,153 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2018-12-08 18:56:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,173 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2018-12-08 18:56:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 18:56:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,175 INFO L225 Difference]: With dead ends: 1104 [2018-12-08 18:56:16,176 INFO L226 Difference]: Without dead ends: 746 [2018-12-08 18:56:16,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-08 18:56:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-12-08 18:56:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-08 18:56:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2018-12-08 18:56:16,198 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2018-12-08 18:56:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,199 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2018-12-08 18:56:16,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2018-12-08 18:56:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 18:56:16,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,200 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-12-08 18:56:16,200 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2018-12-08 18:56:16,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,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-12-08 18:56:16,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,218 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2018-12-08 18:56:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,234 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2018-12-08 18:56:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 18:56:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,237 INFO L225 Difference]: With dead ends: 1388 [2018-12-08 18:56:16,237 INFO L226 Difference]: Without dead ends: 1386 [2018-12-08 18:56:16,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-12-08 18:56:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2018-12-08 18:56:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-12-08 18:56:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2018-12-08 18:56:16,256 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2018-12-08 18:56:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,256 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2018-12-08 18:56:16,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2018-12-08 18:56:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 18:56:16,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,257 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-12-08 18:56:16,257 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2018-12-08 18:56:16,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,269 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2018-12-08 18:56:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,294 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2018-12-08 18:56:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 18:56:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,297 INFO L225 Difference]: With dead ends: 2460 [2018-12-08 18:56:16,297 INFO L226 Difference]: Without dead ends: 1450 [2018-12-08 18:56:16,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-12-08 18:56:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2018-12-08 18:56:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-12-08 18:56:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2018-12-08 18:56:16,322 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2018-12-08 18:56:16,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,323 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2018-12-08 18:56:16,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2018-12-08 18:56:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 18:56:16,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,324 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-12-08 18:56:16,324 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2018-12-08 18:56:16,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,336 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2018-12-08 18:56:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,356 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2018-12-08 18:56:16,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 18:56:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,361 INFO L225 Difference]: With dead ends: 2172 [2018-12-08 18:56:16,361 INFO L226 Difference]: Without dead ends: 1466 [2018-12-08 18:56:16,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-12-08 18:56:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2018-12-08 18:56:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-12-08 18:56:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2018-12-08 18:56:16,402 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2018-12-08 18:56:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,402 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2018-12-08 18:56:16,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2018-12-08 18:56:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 18:56:16,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,404 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-12-08 18:56:16,404 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2018-12-08 18:56:16,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,420 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2018-12-08 18:56:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,454 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2018-12-08 18:56:16,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 18:56:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,459 INFO L225 Difference]: With dead ends: 2700 [2018-12-08 18:56:16,459 INFO L226 Difference]: Without dead ends: 2698 [2018-12-08 18:56:16,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-12-08 18:56:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2018-12-08 18:56:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-12-08 18:56:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2018-12-08 18:56:16,488 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2018-12-08 18:56:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,488 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2018-12-08 18:56:16,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2018-12-08 18:56:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 18:56:16,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,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] [2018-12-08 18:56:16,490 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2018-12-08 18:56:16,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,500 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2018-12-08 18:56:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,529 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2018-12-08 18:56:16,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 18:56:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,534 INFO L225 Difference]: With dead ends: 4876 [2018-12-08 18:56:16,534 INFO L226 Difference]: Without dead ends: 2858 [2018-12-08 18:56:16,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-12-08 18:56:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2018-12-08 18:56:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-12-08 18:56:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2018-12-08 18:56:16,577 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2018-12-08 18:56:16,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,577 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2018-12-08 18:56:16,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2018-12-08 18:56:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 18:56:16,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,578 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-12-08 18:56:16,578 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2018-12-08 18:56:16,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,588 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2018-12-08 18:56:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,630 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2018-12-08 18:56:16,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 18:56:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,638 INFO L225 Difference]: With dead ends: 4284 [2018-12-08 18:56:16,638 INFO L226 Difference]: Without dead ends: 2890 [2018-12-08 18:56:16,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-12-08 18:56:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2018-12-08 18:56:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-12-08 18:56:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2018-12-08 18:56:16,688 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2018-12-08 18:56:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,688 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2018-12-08 18:56:16,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2018-12-08 18:56:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 18:56:16,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,689 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-12-08 18:56:16,690 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,690 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2018-12-08 18:56:16,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,705 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2018-12-08 18:56:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,764 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2018-12-08 18:56:16,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 18:56:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,774 INFO L225 Difference]: With dead ends: 5260 [2018-12-08 18:56:16,774 INFO L226 Difference]: Without dead ends: 5258 [2018-12-08 18:56:16,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-08 18:56:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2018-12-08 18:56:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-12-08 18:56:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2018-12-08 18:56:16,841 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2018-12-08 18:56:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:16,841 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2018-12-08 18:56:16,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2018-12-08 18:56:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 18:56:16,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:16,845 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-12-08 18:56:16,845 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:16,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:16,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2018-12-08 18:56:16,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:16,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:16,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:16,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:16,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:16,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,857 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2018-12-08 18:56:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:16,943 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2018-12-08 18:56:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:16,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 18:56:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:16,957 INFO L225 Difference]: With dead ends: 9676 [2018-12-08 18:56:16,957 INFO L226 Difference]: Without dead ends: 5642 [2018-12-08 18:56:16,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-12-08 18:56:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2018-12-08 18:56:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2018-12-08 18:56:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2018-12-08 18:56:17,060 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2018-12-08 18:56:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:17,060 INFO L480 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2018-12-08 18:56:17,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2018-12-08 18:56:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 18:56:17,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:17,063 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-12-08 18:56:17,063 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:17,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:17,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2018-12-08 18:56:17,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:17,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:17,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:17,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:17,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:17,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:17,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:17,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:17,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:17,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:17,074 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2018-12-08 18:56:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:17,120 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2018-12-08 18:56:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:17,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-08 18:56:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:17,127 INFO L225 Difference]: With dead ends: 8460 [2018-12-08 18:56:17,127 INFO L226 Difference]: Without dead ends: 5706 [2018-12-08 18:56:17,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2018-12-08 18:56:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2018-12-08 18:56:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-12-08 18:56:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2018-12-08 18:56:17,201 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2018-12-08 18:56:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:17,202 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2018-12-08 18:56:17,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2018-12-08 18:56:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 18:56:17,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:17,205 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-12-08 18:56:17,205 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:17,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2018-12-08 18:56:17,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:17,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:17,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:17,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:17,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:17,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:17,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:17,216 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2018-12-08 18:56:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:17,293 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2018-12-08 18:56:17,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:17,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-08 18:56:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:17,306 INFO L225 Difference]: With dead ends: 16716 [2018-12-08 18:56:17,306 INFO L226 Difference]: Without dead ends: 11146 [2018-12-08 18:56:17,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-12-08 18:56:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2018-12-08 18:56:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-08 18:56:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2018-12-08 18:56:17,456 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2018-12-08 18:56:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:17,456 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2018-12-08 18:56:17,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2018-12-08 18:56:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 18:56:17,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:17,463 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-12-08 18:56:17,463 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:17,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2018-12-08 18:56:17,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:17,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:17,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:17,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:17,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:17,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:17,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:17,475 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2018-12-08 18:56:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:17,580 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2018-12-08 18:56:17,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:17,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-08 18:56:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:17,594 INFO L225 Difference]: With dead ends: 13196 [2018-12-08 18:56:17,594 INFO L226 Difference]: Without dead ends: 13194 [2018-12-08 18:56:17,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2018-12-08 18:56:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2018-12-08 18:56:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-08 18:56:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2018-12-08 18:56:17,727 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2018-12-08 18:56:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:17,727 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2018-12-08 18:56:17,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2018-12-08 18:56:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 18:56:17,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:17,732 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-12-08 18:56:17,732 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:17,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:17,732 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2018-12-08 18:56:17,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:17,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:17,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:17,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:17,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:17,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:17,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:17,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:17,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:17,742 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2018-12-08 18:56:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:17,848 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2018-12-08 18:56:17,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:17,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 18:56:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:17,868 INFO L225 Difference]: With dead ends: 19852 [2018-12-08 18:56:17,868 INFO L226 Difference]: Without dead ends: 19850 [2018-12-08 18:56:17,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2018-12-08 18:56:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2018-12-08 18:56:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2018-12-08 18:56:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2018-12-08 18:56:18,052 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2018-12-08 18:56:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:18,052 INFO L480 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2018-12-08 18:56:18,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2018-12-08 18:56:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 18:56:18,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:18,059 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-12-08 18:56:18,059 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:18,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:18,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2018-12-08 18:56:18,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:18,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:18,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:18,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:18,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:18,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:18,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:18,071 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2018-12-08 18:56:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:18,242 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2018-12-08 18:56:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:18,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 18:56:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:18,260 INFO L225 Difference]: With dead ends: 38028 [2018-12-08 18:56:18,260 INFO L226 Difference]: Without dead ends: 21898 [2018-12-08 18:56:18,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2018-12-08 18:56:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2018-12-08 18:56:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2018-12-08 18:56:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2018-12-08 18:56:18,565 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2018-12-08 18:56:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:18,565 INFO L480 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2018-12-08 18:56:18,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2018-12-08 18:56:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 18:56:18,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:18,572 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-12-08 18:56:18,572 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:18,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2018-12-08 18:56:18,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:18,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:18,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:18,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:18,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:18,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:18,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:18,582 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2018-12-08 18:56:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:18,738 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2018-12-08 18:56:18,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:18,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 18:56:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:18,753 INFO L225 Difference]: With dead ends: 33036 [2018-12-08 18:56:18,753 INFO L226 Difference]: Without dead ends: 22282 [2018-12-08 18:56:18,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2018-12-08 18:56:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2018-12-08 18:56:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2018-12-08 18:56:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2018-12-08 18:56:19,008 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2018-12-08 18:56:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:19,008 INFO L480 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2018-12-08 18:56:19,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2018-12-08 18:56:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 18:56:19,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:19,015 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-12-08 18:56:19,015 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:19,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2018-12-08 18:56:19,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:19,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:19,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:19,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:19,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:19,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:19,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:19,025 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2018-12-08 18:56:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:19,305 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2018-12-08 18:56:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:19,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 18:56:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:19,335 INFO L225 Difference]: With dead ends: 38924 [2018-12-08 18:56:19,335 INFO L226 Difference]: Without dead ends: 38922 [2018-12-08 18:56:19,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-12-08 18:56:19,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2018-12-08 18:56:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2018-12-08 18:56:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2018-12-08 18:56:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2018-12-08 18:56:19,647 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2018-12-08 18:56:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:19,647 INFO L480 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2018-12-08 18:56:19,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2018-12-08 18:56:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 18:56:19,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:19,659 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-12-08 18:56:19,659 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:19,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2018-12-08 18:56:19,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:19,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:19,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:19,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:19,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:19,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:19,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:19,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:19,669 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2018-12-08 18:56:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:20,069 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2018-12-08 18:56:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:20,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 18:56:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:20,093 INFO L225 Difference]: With dead ends: 75788 [2018-12-08 18:56:20,093 INFO L226 Difference]: Without dead ends: 43530 [2018-12-08 18:56:20,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2018-12-08 18:56:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2018-12-08 18:56:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2018-12-08 18:56:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2018-12-08 18:56:20,562 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2018-12-08 18:56:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:20,562 INFO L480 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2018-12-08 18:56:20,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2018-12-08 18:56:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 18:56:20,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:20,573 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-12-08 18:56:20,573 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:20,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2018-12-08 18:56:20,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:20,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:20,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:20,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:20,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:20,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:20,583 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2018-12-08 18:56:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:20,933 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2018-12-08 18:56:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:20,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 18:56:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:20,963 INFO L225 Difference]: With dead ends: 65292 [2018-12-08 18:56:20,963 INFO L226 Difference]: Without dead ends: 44042 [2018-12-08 18:56:20,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2018-12-08 18:56:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2018-12-08 18:56:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2018-12-08 18:56:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2018-12-08 18:56:21,428 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2018-12-08 18:56:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:21,428 INFO L480 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2018-12-08 18:56:21,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2018-12-08 18:56:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 18:56:21,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:21,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, 1, 1, 1] [2018-12-08 18:56:21,440 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:21,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2018-12-08 18:56:21,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:21,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:21,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:21,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:21,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:21,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:21,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:21,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:21,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:21,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:21,462 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2018-12-08 18:56:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:21,950 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2018-12-08 18:56:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:21,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 18:56:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:22,089 INFO L225 Difference]: With dead ends: 75788 [2018-12-08 18:56:22,089 INFO L226 Difference]: Without dead ends: 75786 [2018-12-08 18:56:22,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2018-12-08 18:56:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2018-12-08 18:56:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2018-12-08 18:56:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2018-12-08 18:56:22,733 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2018-12-08 18:56:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:22,733 INFO L480 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2018-12-08 18:56:22,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2018-12-08 18:56:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 18:56:22,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:22,758 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-12-08 18:56:22,758 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:22,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2018-12-08 18:56:22,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:22,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:22,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:22,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:22,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:22,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:22,785 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2018-12-08 18:56:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:23,471 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2018-12-08 18:56:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:23,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 18:56:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:23,524 INFO L225 Difference]: With dead ends: 150540 [2018-12-08 18:56:23,524 INFO L226 Difference]: Without dead ends: 86026 [2018-12-08 18:56:23,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2018-12-08 18:56:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2018-12-08 18:56:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2018-12-08 18:56:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2018-12-08 18:56:24,528 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2018-12-08 18:56:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:24,528 INFO L480 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2018-12-08 18:56:24,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2018-12-08 18:56:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 18:56:24,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:24,562 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, 1] [2018-12-08 18:56:24,562 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:24,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2018-12-08 18:56:24,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:24,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:24,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:24,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:24,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:24,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:24,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:24,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:24,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:24,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:24,584 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2018-12-08 18:56:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:25,256 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2018-12-08 18:56:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:25,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 18:56:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:25,314 INFO L225 Difference]: With dead ends: 129036 [2018-12-08 18:56:25,314 INFO L226 Difference]: Without dead ends: 87050 [2018-12-08 18:56:25,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2018-12-08 18:56:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2018-12-08 18:56:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2018-12-08 18:56:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2018-12-08 18:56:26,515 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2018-12-08 18:56:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:26,515 INFO L480 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2018-12-08 18:56:26,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2018-12-08 18:56:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 18:56:26,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:26,540 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, 1] [2018-12-08 18:56:26,540 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:26,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2018-12-08 18:56:26,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:26,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:26,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:26,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:26,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:26,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:26,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:26,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:26,553 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2018-12-08 18:56:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:27,563 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2018-12-08 18:56:27,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:27,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 18:56:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:27,678 INFO L225 Difference]: With dead ends: 147468 [2018-12-08 18:56:27,678 INFO L226 Difference]: Without dead ends: 147466 [2018-12-08 18:56:27,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-12-08 18:56:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2018-12-08 18:56:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2018-12-08 18:56:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2018-12-08 18:56:29,332 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2018-12-08 18:56:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:29,332 INFO L480 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2018-12-08 18:56:29,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2018-12-08 18:56:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 18:56:29,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:29,383 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, 1] [2018-12-08 18:56:29,383 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:29,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2018-12-08 18:56:29,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:29,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:29,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:29,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:29,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:29,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:29,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:29,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:29,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:29,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:29,394 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2018-12-08 18:56:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:30,750 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2018-12-08 18:56:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:30,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 18:56:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:30,885 INFO L225 Difference]: With dead ends: 299020 [2018-12-08 18:56:30,885 INFO L226 Difference]: Without dead ends: 169994 [2018-12-08 18:56:30,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2018-12-08 18:56:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2018-12-08 18:56:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2018-12-08 18:56:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2018-12-08 18:56:34,035 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2018-12-08 18:56:34,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:34,035 INFO L480 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2018-12-08 18:56:34,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2018-12-08 18:56:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 18:56:34,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:34,090 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, 1, 1] [2018-12-08 18:56:34,090 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:34,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2018-12-08 18:56:34,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:34,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:34,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:34,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:34,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:34,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:34,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:34,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:34,100 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2018-12-08 18:56:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:35,634 INFO L93 Difference]: Finished difference Result 254988 states and 324616 transitions. [2018-12-08 18:56:35,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:35,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-08 18:56:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:35,758 INFO L225 Difference]: With dead ends: 254988 [2018-12-08 18:56:35,758 INFO L226 Difference]: Without dead ends: 172042 [2018-12-08 18:56:35,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2018-12-08 18:56:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2018-12-08 18:56:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2018-12-08 18:56:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2018-12-08 18:56:37,848 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2018-12-08 18:56:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:37,848 INFO L480 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2018-12-08 18:56:37,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2018-12-08 18:56:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 18:56:37,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:37,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:56:37,903 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:37,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2018-12-08 18:56:37,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:37,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:37,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:37,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:37,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:37,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:37,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:37,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:37,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:37,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:37,919 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2018-12-08 18:56:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:40,239 INFO L93 Difference]: Finished difference Result 286732 states and 366600 transitions. [2018-12-08 18:56:40,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:40,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-08 18:56:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:40,475 INFO L225 Difference]: With dead ends: 286732 [2018-12-08 18:56:40,476 INFO L226 Difference]: Without dead ends: 286730 [2018-12-08 18:56:40,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2018-12-08 18:56:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2018-12-08 18:56:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2018-12-08 18:56:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2018-12-08 18:56:43,565 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2018-12-08 18:56:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:43,565 INFO L480 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2018-12-08 18:56:43,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2018-12-08 18:56:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 18:56:43,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:43,691 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, 1, 1] [2018-12-08 18:56:43,692 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:43,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2018-12-08 18:56:43,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:43,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:43,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:43,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:43,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:43,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:43,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:43,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:43,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:43,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:43,717 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2018-12-08 18:56:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:47,760 INFO L93 Difference]: Finished difference Result 593932 states and 727048 transitions. [2018-12-08 18:56:47,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:47,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-08 18:56:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:48,016 INFO L225 Difference]: With dead ends: 593932 [2018-12-08 18:56:48,016 INFO L226 Difference]: Without dead ends: 335882 [2018-12-08 18:56:48,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2018-12-08 18:56:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2018-12-08 18:56:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2018-12-08 18:56:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2018-12-08 18:56:52,441 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2018-12-08 18:56:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:56:52,441 INFO L480 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2018-12-08 18:56:52,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:56:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2018-12-08 18:56:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 18:56:52,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:56:52,561 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, 1, 1, 1] [2018-12-08 18:56:52,561 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:56:52,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:56:52,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2018-12-08 18:56:52,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:56:52,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:56:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:52,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:56:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:56:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:56:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:56:52,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:56:52,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:56:52,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:56:52,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:56:52,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:52,576 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2018-12-08 18:56:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:56:55,684 INFO L93 Difference]: Finished difference Result 503820 states and 606216 transitions. [2018-12-08 18:56:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:56:55,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-08 18:56:55,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:56:55,986 INFO L225 Difference]: With dead ends: 503820 [2018-12-08 18:56:55,986 INFO L226 Difference]: Without dead ends: 339978 [2018-12-08 18:56:56,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:56:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2018-12-08 18:57:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2018-12-08 18:57:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2018-12-08 18:57:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2018-12-08 18:57:00,552 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2018-12-08 18:57:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:57:00,553 INFO L480 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2018-12-08 18:57:00,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:57:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2018-12-08 18:57:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 18:57:00,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:57:00,670 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, 1, 1, 1] [2018-12-08 18:57:00,670 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:57:00,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:57:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2018-12-08 18:57:00,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:57:00,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:57:00,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:57:00,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:57:00,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:57:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:57:00,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-12-08 18:57:00,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:57:00,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:57:00,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:57:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:57:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:57:00,687 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2018-12-08 18:57:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:57:07,301 INFO L93 Difference]: Finished difference Result 557068 states and 667656 transitions. [2018-12-08 18:57:07,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:57:07,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-08 18:57:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:57:07,795 INFO L225 Difference]: With dead ends: 557068 [2018-12-08 18:57:07,795 INFO L226 Difference]: Without dead ends: 557066 [2018-12-08 18:57:07,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:57:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2018-12-08 18:57:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2018-12-08 18:57:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2018-12-08 18:57:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2018-12-08 18:57:14,226 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2018-12-08 18:57:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:57:14,226 INFO L480 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2018-12-08 18:57:14,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:57:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2018-12-08 18:57:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 18:57:14,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:57:14,477 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, 1, 1, 1] [2018-12-08 18:57:14,477 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:57:14,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:57:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2018-12-08 18:57:14,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:57:14,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:57:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:57:14,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:57:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:57:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:57:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:57:14,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:57:14,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:57:14,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:57:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:57:14,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:57:14,501 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2018-12-08 18:57:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:57:20,987 INFO L93 Difference]: Finished difference Result 1179660 states and 1363976 transitions. [2018-12-08 18:57:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:57:20,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-08 18:57:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:57:21,574 INFO L225 Difference]: With dead ends: 1179660 [2018-12-08 18:57:21,574 INFO L226 Difference]: Without dead ends: 663562 [2018-12-08 18:57:22,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:57:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2018-12-08 18:57:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2018-12-08 18:57:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2018-12-08 18:57:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2018-12-08 18:57:34,871 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2018-12-08 18:57:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:57:34,872 INFO L480 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2018-12-08 18:57:34,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:57:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2018-12-08 18:57:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 18:57:35,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:57:35,151 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, 1, 1, 1, 1] [2018-12-08 18:57:35,151 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:57:35,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:57:35,151 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2018-12-08 18:57:35,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:57:35,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:57:35,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:57:35,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:57:35,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:57:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:57:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:57:35,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:57:35,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:57:35,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:57:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:57:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:57:35,164 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2018-12-08 18:57:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:57:41,998 INFO L93 Difference]: Finished difference Result 995340 states and 1126408 transitions. [2018-12-08 18:57:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:57:41,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-08 18:57:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:57:42,639 INFO L225 Difference]: With dead ends: 995340 [2018-12-08 18:57:42,640 INFO L226 Difference]: Without dead ends: 671754 [2018-12-08 18:57:42,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:57:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2018-12-08 18:57:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2018-12-08 18:57:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2018-12-08 18:57:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2018-12-08 18:57:55,879 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2018-12-08 18:57:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:57:55,879 INFO L480 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2018-12-08 18:57:55,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:57:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2018-12-08 18:57:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 18:57:56,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:57:56,131 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, 1, 1, 1, 1] [2018-12-08 18:57:56,131 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:57:56,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:57:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2018-12-08 18:57:56,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:57:56,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:57:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:57:56,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:57:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:57:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:57:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:57:56,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:57:56,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:57:56,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:57:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:57:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:57:56,143 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2018-12-08 18:58:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:58:07,269 INFO L93 Difference]: Finished difference Result 1081354 states and 1204231 transitions. [2018-12-08 18:58:07,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:58:07,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-08 18:58:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:58:08,306 INFO L225 Difference]: With dead ends: 1081354 [2018-12-08 18:58:08,306 INFO L226 Difference]: Without dead ends: 1081352 [2018-12-08 18:58:08,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:58:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2018-12-08 18:58:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2018-12-08 18:58:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2018-12-08 18:58:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2018-12-08 18:58:22,008 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2018-12-08 18:58:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:58:22,008 INFO L480 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2018-12-08 18:58:22,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:58:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2018-12-08 18:58:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 18:58:27,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:58:27,086 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, 1, 1, 1, 1] [2018-12-08 18:58:27,086 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:58:27,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:58:27,086 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2018-12-08 18:58:27,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 18:58:27,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 18:58:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:58:27,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:58:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:58:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:58:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:58:27,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:58:27,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:58:27,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:58:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:58:27,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:58:27,098 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2018-12-08 18:58:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:58:40,987 INFO L93 Difference]: Finished difference Result 2342920 states and 2547718 transitions. [2018-12-08 18:58:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:58:40,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-08 18:58:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:58:40,988 INFO L225 Difference]: With dead ends: 2342920 [2018-12-08 18:58:40,988 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 18:58:41,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:58:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 18:58:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 18:58:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 18:58:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 18:58:41,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-08 18:58:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:58:41,605 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 18:58:41,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:58:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 18:58:41,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 18:58:41,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 18:58:41,661 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 18:58:41,661 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,661 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,662 INFO L451 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L444 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,663 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L451 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-08 18:58:41,664 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-12-08 18:58:41,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 06:58:41 BoogieIcfgContainer [2018-12-08 18:58:41,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 18:58:41,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 18:58:41,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 18:58:41,669 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 18:58:41,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:56:15" (3/4) ... [2018-12-08 18:58:41,672 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 18:58:41,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 18:58:41,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 18:58:41,682 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-08 18:58:41,682 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 18:58:41,682 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 18:58:41,728 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c52d9ec9-3122-418b-b59f-fe1d7a9e0674/bin-2019/uautomizer/witness.graphml [2018-12-08 18:58:41,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 18:58:41,729 INFO L168 Benchmark]: Toolchain (without parser) took 146725.35 ms. Allocated memory was 1.0 GB in the beginning and 8.4 GB in the end (delta: 7.4 GB). Free memory was 954.4 MB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2018-12-08 18:58:41,730 INFO L168 Benchmark]: CDTParser took 0.11 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-12-08 18:58:41,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-08 18:58:41,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-12-08 18:58:41,731 INFO L168 Benchmark]: Boogie Preprocessor took 16.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 18:58:41,731 INFO L168 Benchmark]: RCFGBuilder took 224.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-08 18:58:41,731 INFO L168 Benchmark]: TraceAbstraction took 146203.90 ms. Allocated memory was 1.1 GB in the beginning and 8.4 GB in the end (delta: 7.3 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2018-12-08 18:58:41,732 INFO L168 Benchmark]: Witness Printer took 59.26 ms. Allocated memory is still 8.4 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 192.9 kB). Peak memory consumption was 192.9 kB. Max. memory is 11.5 GB. [2018-12-08 18:58:41,733 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.11 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 176.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 146203.90 ms. Allocated memory was 1.1 GB in the beginning and 8.4 GB in the end (delta: 7.3 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 59.26 ms. Allocated memory is still 8.4 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 192.9 kB). Peak memory consumption was 192.9 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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: 54]: 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, 59 locations, 1 error locations. SAFE Result, 146.1s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 68.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5309 SDtfs, 2663 SDslu, 3669 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048584occurred in iteration=42, 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: 69.7s AutomataMinimizationTime, 43 MinimizatonAttempts, 131120 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 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.4s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 89720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...