./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/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_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/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-aa41828 [2018-11-23 09:58:57,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:57,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:57,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:57,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:57,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:57,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:57,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:57,326 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:57,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:57,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:57,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:57,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:57,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:57,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:57,330 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:57,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:57,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:57,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:57,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:57,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:57,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:57,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:57,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:57,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:57,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:57,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:57,339 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:57,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:57,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:57,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:57,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:57,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:57,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:57,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:57,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:57,343 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 09:58:57,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:57,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:57,353 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:57,353 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:57,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:57,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:57,354 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:57,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:57,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:57,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:58:57,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:57,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:57,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:57,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:57,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:57,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:57,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:57,356 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:57,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:57,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:57,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:57,356 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:57,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:57,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:57,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:57,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:57,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:57,357 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:58:57,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:57,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:58:57,358 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_e9706470-4e0f-4ac7-8df8-a05edc991552/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-11-23 09:58:57,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:57,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:57,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:57,391 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:57,391 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:57,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 09:58:57,425 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/data/2820b010e/160b6463cedd4859b8507d0a3198f27e/FLAGc92f0e2c1 [2018-11-23 09:58:57,822 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:57,822 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 09:58:57,827 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/data/2820b010e/160b6463cedd4859b8507d0a3198f27e/FLAGc92f0e2c1 [2018-11-23 09:58:57,838 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/data/2820b010e/160b6463cedd4859b8507d0a3198f27e [2018-11-23 09:58:57,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:57,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:57,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:57,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:57,844 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:57,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:57" (1/1) ... [2018-11-23 09:58:57,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13248fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:57, skipping insertion in model container [2018-11-23 09:58:57,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:57" (1/1) ... [2018-11-23 09:58:57,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:57,867 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:57,978 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:57,980 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:58,002 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:58,013 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:58,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58 WrapperNode [2018-11-23 09:58:58,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:58,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:58,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:58,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:58,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:58,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:58,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:58,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:58,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... [2018-11-23 09:58:58,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:58,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:58,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:58,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:58,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:58,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:58,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:58,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:58,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:58,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:58,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:58,349 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:58,349 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 09:58:58,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:58 BoogieIcfgContainer [2018-11-23 09:58:58,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:58,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:58,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:58,352 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:58,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:57" (1/3) ... [2018-11-23 09:58:58,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dae0baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:58, skipping insertion in model container [2018-11-23 09:58:58,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:58" (2/3) ... [2018-11-23 09:58:58,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dae0baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:58, skipping insertion in model container [2018-11-23 09:58:58,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:58" (3/3) ... [2018-11-23 09:58:58,359 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 09:58:58,367 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:58,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:58,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:58,413 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:58,413 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:58,414 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:58,414 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:58,414 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:58,414 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:58,414 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:58,414 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:58,414 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 09:58:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 09:58:58,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:58,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:58,436 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:58,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:58,440 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2018-11-23 09:58:58,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:58,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:58,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:58,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:58,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:58,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:58,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,600 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-11-23 09:58:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:58,665 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2018-11-23 09:58:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:58,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 09:58:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:58,675 INFO L225 Difference]: With dead ends: 117 [2018-11-23 09:58:58,675 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 09:58:58,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 09:58:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-11-23 09:58:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 09:58:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2018-11-23 09:58:58,706 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2018-11-23 09:58:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:58,707 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2018-11-23 09:58:58,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2018-11-23 09:58:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 09:58:58,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:58,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:58,708 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:58,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2018-11-23 09:58:58,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:58,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:58,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:58,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:58,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:58,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,768 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2018-11-23 09:58:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:58,784 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2018-11-23 09:58:58,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:58,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 09:58:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:58,785 INFO L225 Difference]: With dead ends: 167 [2018-11-23 09:58:58,785 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 09:58:58,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 09:58:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-23 09:58:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 09:58:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2018-11-23 09:58:58,794 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2018-11-23 09:58:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:58,795 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2018-11-23 09:58:58,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2018-11-23 09:58:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 09:58:58,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:58,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:58,796 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:58,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:58,796 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2018-11-23 09:58:58,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:58,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:58,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:58,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:58,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:58,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,835 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2018-11-23 09:58:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:58,849 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2018-11-23 09:58:58,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:58,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 09:58:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:58,850 INFO L225 Difference]: With dead ends: 153 [2018-11-23 09:58:58,850 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 09:58:58,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 09:58:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 09:58:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 09:58:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2018-11-23 09:58:58,857 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2018-11-23 09:58:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:58,857 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2018-11-23 09:58:58,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2018-11-23 09:58:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 09:58:58,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:58,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:58,858 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:58,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:58,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2018-11-23 09:58:58,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:58,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:58,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:58,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:58,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:58,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:58,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,893 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2018-11-23 09:58:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:58,921 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2018-11-23 09:58:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:58,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 09:58:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:58,923 INFO L225 Difference]: With dead ends: 196 [2018-11-23 09:58:58,923 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 09:58:58,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 09:58:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-11-23 09:58:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 09:58:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2018-11-23 09:58:58,932 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2018-11-23 09:58:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:58,933 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2018-11-23 09:58:58,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2018-11-23 09:58:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 09:58:58,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:58,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:58,934 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:58,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2018-11-23 09:58:58,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:58,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:58,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:58,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:58,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:58,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:58,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,972 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2018-11-23 09:58:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:58,994 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2018-11-23 09:58:58,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:58,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 09:58:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:58,996 INFO L225 Difference]: With dead ends: 324 [2018-11-23 09:58:58,996 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 09:58:58,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 09:58:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-11-23 09:58:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-23 09:58:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2018-11-23 09:58:59,006 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2018-11-23 09:58:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,006 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2018-11-23 09:58:59,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2018-11-23 09:58:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:58:59,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,007 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2018-11-23 09:58:59,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,031 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2018-11-23 09:58:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,054 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2018-11-23 09:58:59,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 09:58:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,055 INFO L225 Difference]: With dead ends: 291 [2018-11-23 09:58:59,055 INFO L226 Difference]: Without dead ends: 198 [2018-11-23 09:58:59,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-23 09:58:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-23 09:58:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-23 09:58:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2018-11-23 09:58:59,065 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2018-11-23 09:58:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,065 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2018-11-23 09:58:59,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2018-11-23 09:58:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:58:59,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,066 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2018-11-23 09:58:59,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,101 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2018-11-23 09:58:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,123 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2018-11-23 09:58:59,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 09:58:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,125 INFO L225 Difference]: With dead ends: 372 [2018-11-23 09:58:59,125 INFO L226 Difference]: Without dead ends: 370 [2018-11-23 09:58:59,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-11-23 09:58:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-11-23 09:58:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 09:58:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2018-11-23 09:58:59,134 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2018-11-23 09:58:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,134 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2018-11-23 09:58:59,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2018-11-23 09:58:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:58:59,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,136 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2018-11-23 09:58:59,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,159 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2018-11-23 09:58:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,191 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2018-11-23 09:58:59,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 09:58:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,193 INFO L225 Difference]: With dead ends: 632 [2018-11-23 09:58:59,193 INFO L226 Difference]: Without dead ends: 378 [2018-11-23 09:58:59,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-23 09:58:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-11-23 09:58:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-23 09:58:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2018-11-23 09:58:59,205 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2018-11-23 09:58:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,206 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2018-11-23 09:58:59,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2018-11-23 09:58:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:58:59,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,207 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2018-11-23 09:58:59,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,228 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2018-11-23 09:58:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,256 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2018-11-23 09:58:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 09:58:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,258 INFO L225 Difference]: With dead ends: 564 [2018-11-23 09:58:59,258 INFO L226 Difference]: Without dead ends: 382 [2018-11-23 09:58:59,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-23 09:58:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-11-23 09:58:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-23 09:58:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2018-11-23 09:58:59,268 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2018-11-23 09:58:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,268 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2018-11-23 09:58:59,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2018-11-23 09:58:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:58:59,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,270 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2018-11-23 09:58:59,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,295 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2018-11-23 09:58:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,321 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2018-11-23 09:58:59,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 09:58:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,324 INFO L225 Difference]: With dead ends: 716 [2018-11-23 09:58:59,324 INFO L226 Difference]: Without dead ends: 714 [2018-11-23 09:58:59,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-23 09:58:59,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2018-11-23 09:58:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-23 09:58:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2018-11-23 09:58:59,341 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2018-11-23 09:58:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,341 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2018-11-23 09:58:59,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2018-11-23 09:58:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:58:59,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,343 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2018-11-23 09:58:59,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,364 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2018-11-23 09:58:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,388 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2018-11-23 09:58:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 09:58:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,392 INFO L225 Difference]: With dead ends: 1244 [2018-11-23 09:58:59,392 INFO L226 Difference]: Without dead ends: 738 [2018-11-23 09:58:59,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-23 09:58:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-11-23 09:58:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-23 09:58:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2018-11-23 09:58:59,414 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2018-11-23 09:58:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,415 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2018-11-23 09:58:59,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2018-11-23 09:58:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:58:59,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,416 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2018-11-23 09:58:59,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,448 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2018-11-23 09:58:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,469 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2018-11-23 09:58:59,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 09:58:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,471 INFO L225 Difference]: With dead ends: 1104 [2018-11-23 09:58:59,472 INFO L226 Difference]: Without dead ends: 746 [2018-11-23 09:58:59,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-23 09:58:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-11-23 09:58:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-23 09:58:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2018-11-23 09:58:59,493 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2018-11-23 09:58:59,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,494 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2018-11-23 09:58:59,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2018-11-23 09:58:59,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:58:59,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,495 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,496 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2018-11-23 09:58:59,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,515 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2018-11-23 09:58:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,541 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2018-11-23 09:58:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 09:58:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,545 INFO L225 Difference]: With dead ends: 1388 [2018-11-23 09:58:59,545 INFO L226 Difference]: Without dead ends: 1386 [2018-11-23 09:58:59,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-11-23 09:58:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2018-11-23 09:58:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-23 09:58:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2018-11-23 09:58:59,576 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2018-11-23 09:58:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,577 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2018-11-23 09:58:59,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2018-11-23 09:58:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:58:59,578 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,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] [2018-11-23 09:58:59,579 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2018-11-23 09:58:59,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,603 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2018-11-23 09:58:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,646 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2018-11-23 09:58:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 09:58:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,651 INFO L225 Difference]: With dead ends: 2460 [2018-11-23 09:58:59,651 INFO L226 Difference]: Without dead ends: 1450 [2018-11-23 09:58:59,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-11-23 09:58:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2018-11-23 09:58:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-11-23 09:58:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2018-11-23 09:58:59,693 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2018-11-23 09:58:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,693 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2018-11-23 09:58:59,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2018-11-23 09:58:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 09:58:59,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,695 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2018-11-23 09:58:59,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,716 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2018-11-23 09:58:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,745 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2018-11-23 09:58:59,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 09:58:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,750 INFO L225 Difference]: With dead ends: 2172 [2018-11-23 09:58:59,750 INFO L226 Difference]: Without dead ends: 1466 [2018-11-23 09:58:59,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-11-23 09:58:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2018-11-23 09:58:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-11-23 09:58:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2018-11-23 09:58:59,787 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2018-11-23 09:58:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,787 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2018-11-23 09:58:59,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2018-11-23 09:58:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 09:58:59,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,789 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2018-11-23 09:58:59,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,805 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2018-11-23 09:58:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,855 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2018-11-23 09:58:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 09:58:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:59,864 INFO L225 Difference]: With dead ends: 2700 [2018-11-23 09:58:59,864 INFO L226 Difference]: Without dead ends: 2698 [2018-11-23 09:58:59,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-23 09:58:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2018-11-23 09:58:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-11-23 09:58:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2018-11-23 09:58:59,921 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2018-11-23 09:58:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:59,922 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2018-11-23 09:58:59,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2018-11-23 09:58:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 09:58:59,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:59,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:59,925 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:59,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2018-11-23 09:58:59,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:59,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:59,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:59,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:59,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:59,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:59,944 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2018-11-23 09:58:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:59,996 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2018-11-23 09:58:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:59,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 09:58:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:00,004 INFO L225 Difference]: With dead ends: 4876 [2018-11-23 09:59:00,005 INFO L226 Difference]: Without dead ends: 2858 [2018-11-23 09:59:00,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-11-23 09:59:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2018-11-23 09:59:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-11-23 09:59:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2018-11-23 09:59:00,090 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2018-11-23 09:59:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:00,090 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2018-11-23 09:59:00,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2018-11-23 09:59:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 09:59:00,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:00,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:00,093 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:00,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2018-11-23 09:59:00,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:00,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:00,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:00,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:00,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,119 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2018-11-23 09:59:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:00,157 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2018-11-23 09:59:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:00,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 09:59:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:00,165 INFO L225 Difference]: With dead ends: 4284 [2018-11-23 09:59:00,165 INFO L226 Difference]: Without dead ends: 2890 [2018-11-23 09:59:00,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-11-23 09:59:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2018-11-23 09:59:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-11-23 09:59:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2018-11-23 09:59:00,234 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2018-11-23 09:59:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:00,234 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2018-11-23 09:59:00,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2018-11-23 09:59:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 09:59:00,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:00,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:00,237 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:00,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2018-11-23 09:59:00,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:00,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:00,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:00,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:00,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,261 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2018-11-23 09:59:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:00,322 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2018-11-23 09:59:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:00,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 09:59:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:00,336 INFO L225 Difference]: With dead ends: 5260 [2018-11-23 09:59:00,336 INFO L226 Difference]: Without dead ends: 5258 [2018-11-23 09:59:00,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-23 09:59:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2018-11-23 09:59:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-23 09:59:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2018-11-23 09:59:00,428 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2018-11-23 09:59:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:00,428 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2018-11-23 09:59:00,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2018-11-23 09:59:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 09:59:00,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:00,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:00,433 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:00,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:00,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2018-11-23 09:59:00,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:00,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:00,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:00,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:00,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:00,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:00,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,451 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2018-11-23 09:59:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:00,520 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2018-11-23 09:59:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:00,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 09:59:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:00,535 INFO L225 Difference]: With dead ends: 9676 [2018-11-23 09:59:00,535 INFO L226 Difference]: Without dead ends: 5642 [2018-11-23 09:59:00,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-11-23 09:59:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2018-11-23 09:59:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2018-11-23 09:59:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2018-11-23 09:59:00,660 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2018-11-23 09:59:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:00,660 INFO L480 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2018-11-23 09:59:00,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2018-11-23 09:59:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 09:59:00,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:00,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:00,665 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:00,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2018-11-23 09:59:00,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:00,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:00,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:00,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:00,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:00,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:00,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:00,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,681 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2018-11-23 09:59:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:00,750 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2018-11-23 09:59:00,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:00,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 09:59:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:00,760 INFO L225 Difference]: With dead ends: 8460 [2018-11-23 09:59:00,760 INFO L226 Difference]: Without dead ends: 5706 [2018-11-23 09:59:00,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2018-11-23 09:59:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2018-11-23 09:59:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-11-23 09:59:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2018-11-23 09:59:00,869 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2018-11-23 09:59:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:00,869 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2018-11-23 09:59:00,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2018-11-23 09:59:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 09:59:00,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:00,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:00,874 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:00,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2018-11-23 09:59:00,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:00,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:00,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:00,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:00,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:00,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:00,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:00,896 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2018-11-23 09:59:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:01,045 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2018-11-23 09:59:01,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:01,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 09:59:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:01,064 INFO L225 Difference]: With dead ends: 16716 [2018-11-23 09:59:01,064 INFO L226 Difference]: Without dead ends: 11146 [2018-11-23 09:59:01,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-23 09:59:01,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2018-11-23 09:59:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 09:59:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2018-11-23 09:59:01,288 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2018-11-23 09:59:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:01,288 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2018-11-23 09:59:01,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2018-11-23 09:59:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 09:59:01,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:01,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:01,296 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:01,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2018-11-23 09:59:01,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:01,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:01,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:01,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:01,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:01,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:01,312 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2018-11-23 09:59:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:01,430 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2018-11-23 09:59:01,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:01,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 09:59:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:01,444 INFO L225 Difference]: With dead ends: 13196 [2018-11-23 09:59:01,444 INFO L226 Difference]: Without dead ends: 13194 [2018-11-23 09:59:01,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2018-11-23 09:59:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2018-11-23 09:59:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 09:59:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2018-11-23 09:59:01,569 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2018-11-23 09:59:01,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:01,570 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2018-11-23 09:59:01,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2018-11-23 09:59:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 09:59:01,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:01,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:01,574 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:01,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2018-11-23 09:59:01,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:01,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:01,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:01,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:01,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:01,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:01,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:01,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:01,595 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2018-11-23 09:59:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:01,711 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2018-11-23 09:59:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:01,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 09:59:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:01,726 INFO L225 Difference]: With dead ends: 19852 [2018-11-23 09:59:01,726 INFO L226 Difference]: Without dead ends: 19850 [2018-11-23 09:59:01,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2018-11-23 09:59:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2018-11-23 09:59:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2018-11-23 09:59:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2018-11-23 09:59:02,000 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2018-11-23 09:59:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:02,000 INFO L480 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2018-11-23 09:59:02,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2018-11-23 09:59:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 09:59:02,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:02,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:02,010 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:02,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2018-11-23 09:59:02,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:02,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:02,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:02,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:02,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:02,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:02,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:02,041 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2018-11-23 09:59:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:02,246 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2018-11-23 09:59:02,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:02,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 09:59:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:02,261 INFO L225 Difference]: With dead ends: 38028 [2018-11-23 09:59:02,261 INFO L226 Difference]: Without dead ends: 21898 [2018-11-23 09:59:02,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2018-11-23 09:59:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2018-11-23 09:59:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2018-11-23 09:59:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2018-11-23 09:59:02,495 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2018-11-23 09:59:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:02,496 INFO L480 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2018-11-23 09:59:02,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2018-11-23 09:59:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 09:59:02,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:02,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:02,503 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2018-11-23 09:59:02,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:02,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:02,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:02,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:02,527 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2018-11-23 09:59:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:02,712 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2018-11-23 09:59:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:02,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 09:59:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:02,726 INFO L225 Difference]: With dead ends: 33036 [2018-11-23 09:59:02,726 INFO L226 Difference]: Without dead ends: 22282 [2018-11-23 09:59:02,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2018-11-23 09:59:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2018-11-23 09:59:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2018-11-23 09:59:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2018-11-23 09:59:02,956 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2018-11-23 09:59:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:02,956 INFO L480 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2018-11-23 09:59:02,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2018-11-23 09:59:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 09:59:02,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:02,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:02,963 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:02,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:02,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2018-11-23 09:59:02,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:02,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:02,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:02,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:02,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:02,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:02,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:02,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:02,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:02,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:02,986 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2018-11-23 09:59:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:03,219 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2018-11-23 09:59:03,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:03,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 09:59:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:03,244 INFO L225 Difference]: With dead ends: 38924 [2018-11-23 09:59:03,244 INFO L226 Difference]: Without dead ends: 38922 [2018-11-23 09:59:03,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2018-11-23 09:59:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2018-11-23 09:59:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2018-11-23 09:59:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2018-11-23 09:59:03,657 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2018-11-23 09:59:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:03,657 INFO L480 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2018-11-23 09:59:03,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2018-11-23 09:59:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 09:59:03,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:03,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:03,669 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:03,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:03,670 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2018-11-23 09:59:03,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:03,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:03,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:03,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:03,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:03,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:03,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:03,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:03,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:03,695 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2018-11-23 09:59:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:04,013 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2018-11-23 09:59:04,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:04,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 09:59:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:04,042 INFO L225 Difference]: With dead ends: 75788 [2018-11-23 09:59:04,042 INFO L226 Difference]: Without dead ends: 43530 [2018-11-23 09:59:04,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2018-11-23 09:59:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2018-11-23 09:59:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2018-11-23 09:59:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2018-11-23 09:59:04,717 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2018-11-23 09:59:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:04,717 INFO L480 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2018-11-23 09:59:04,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2018-11-23 09:59:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:59:04,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:04,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:04,729 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:04,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2018-11-23 09:59:04,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:04,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:04,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:04,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:04,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:04,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:04,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:04,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:04,751 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2018-11-23 09:59:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:05,060 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2018-11-23 09:59:05,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:05,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 09:59:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:05,092 INFO L225 Difference]: With dead ends: 65292 [2018-11-23 09:59:05,092 INFO L226 Difference]: Without dead ends: 44042 [2018-11-23 09:59:05,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-11-23 09:59:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2018-11-23 09:59:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2018-11-23 09:59:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2018-11-23 09:59:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2018-11-23 09:59:05,593 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2018-11-23 09:59:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:05,593 INFO L480 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2018-11-23 09:59:05,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2018-11-23 09:59:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:59:05,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:05,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:05,614 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:05,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2018-11-23 09:59:05,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:05,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:05,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:05,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:05,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:05,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:05,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:05,639 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2018-11-23 09:59:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:06,413 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2018-11-23 09:59:06,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:06,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 09:59:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:06,458 INFO L225 Difference]: With dead ends: 75788 [2018-11-23 09:59:06,458 INFO L226 Difference]: Without dead ends: 75786 [2018-11-23 09:59:06,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2018-11-23 09:59:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2018-11-23 09:59:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2018-11-23 09:59:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2018-11-23 09:59:07,099 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2018-11-23 09:59:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:07,100 INFO L480 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2018-11-23 09:59:07,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2018-11-23 09:59:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:59:07,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:07,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:07,125 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:07,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2018-11-23 09:59:07,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:07,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:07,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:07,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:07,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:07,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:07,152 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2018-11-23 09:59:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:08,024 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2018-11-23 09:59:08,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:08,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 09:59:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:08,080 INFO L225 Difference]: With dead ends: 150540 [2018-11-23 09:59:08,081 INFO L226 Difference]: Without dead ends: 86026 [2018-11-23 09:59:08,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2018-11-23 09:59:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2018-11-23 09:59:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2018-11-23 09:59:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2018-11-23 09:59:09,080 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2018-11-23 09:59:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:09,080 INFO L480 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2018-11-23 09:59:09,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2018-11-23 09:59:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 09:59:09,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:09,111 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-11-23 09:59:09,112 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:09,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:09,112 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2018-11-23 09:59:09,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:09,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:09,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:09,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:09,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:09,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:09,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:09,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:09,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:09,136 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2018-11-23 09:59:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:10,045 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2018-11-23 09:59:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:10,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 09:59:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:10,104 INFO L225 Difference]: With dead ends: 129036 [2018-11-23 09:59:10,104 INFO L226 Difference]: Without dead ends: 87050 [2018-11-23 09:59:10,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2018-11-23 09:59:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2018-11-23 09:59:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2018-11-23 09:59:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2018-11-23 09:59:11,138 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2018-11-23 09:59:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:11,139 INFO L480 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2018-11-23 09:59:11,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2018-11-23 09:59:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 09:59:11,165 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:11,165 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-11-23 09:59:11,165 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:11,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2018-11-23 09:59:11,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:11,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:11,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:11,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:11,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:11,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:11,405 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2018-11-23 09:59:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:12,459 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2018-11-23 09:59:12,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:12,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 09:59:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:12,581 INFO L225 Difference]: With dead ends: 147468 [2018-11-23 09:59:12,581 INFO L226 Difference]: Without dead ends: 147466 [2018-11-23 09:59:12,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-11-23 09:59:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2018-11-23 09:59:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2018-11-23 09:59:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2018-11-23 09:59:14,372 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2018-11-23 09:59:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:14,373 INFO L480 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2018-11-23 09:59:14,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2018-11-23 09:59:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 09:59:14,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:14,421 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-11-23 09:59:14,421 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:14,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:14,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2018-11-23 09:59:14,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:14,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:14,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:14,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:14,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:14,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:14,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:14,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:14,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:14,459 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2018-11-23 09:59:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:15,891 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2018-11-23 09:59:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:15,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 09:59:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:16,026 INFO L225 Difference]: With dead ends: 299020 [2018-11-23 09:59:16,026 INFO L226 Difference]: Without dead ends: 169994 [2018-11-23 09:59:16,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2018-11-23 09:59:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2018-11-23 09:59:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2018-11-23 09:59:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2018-11-23 09:59:19,901 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2018-11-23 09:59:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:19,901 INFO L480 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2018-11-23 09:59:19,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2018-11-23 09:59:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 09:59:19,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:19,955 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-11-23 09:59:19,956 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2018-11-23 09:59:19,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:19,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:19,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:19,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:19,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:19,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:19,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:19,980 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2018-11-23 09:59:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:21,337 INFO L93 Difference]: Finished difference Result 254988 states and 324616 transitions. [2018-11-23 09:59:21,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:21,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 09:59:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:21,484 INFO L225 Difference]: With dead ends: 254988 [2018-11-23 09:59:21,484 INFO L226 Difference]: Without dead ends: 172042 [2018-11-23 09:59:21,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2018-11-23 09:59:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2018-11-23 09:59:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2018-11-23 09:59:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2018-11-23 09:59:23,955 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2018-11-23 09:59:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:23,955 INFO L480 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2018-11-23 09:59:23,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2018-11-23 09:59:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 09:59:24,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:24,010 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-11-23 09:59:24,010 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:24,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:24,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2018-11-23 09:59:24,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:24,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:24,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:24,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:24,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:24,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:24,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:24,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:24,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:24,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:24,050 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2018-11-23 09:59:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:26,683 INFO L93 Difference]: Finished difference Result 286732 states and 366600 transitions. [2018-11-23 09:59:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:26,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 09:59:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:26,893 INFO L225 Difference]: With dead ends: 286732 [2018-11-23 09:59:26,893 INFO L226 Difference]: Without dead ends: 286730 [2018-11-23 09:59:26,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2018-11-23 09:59:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2018-11-23 09:59:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2018-11-23 09:59:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2018-11-23 09:59:29,646 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2018-11-23 09:59:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:29,647 INFO L480 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2018-11-23 09:59:29,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2018-11-23 09:59:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 09:59:29,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:29,763 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-11-23 09:59:29,763 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:29,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:29,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2018-11-23 09:59:29,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:29,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:29,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:29,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:29,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:29,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:29,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:29,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:29,795 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2018-11-23 09:59:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:32,921 INFO L93 Difference]: Finished difference Result 593932 states and 727048 transitions. [2018-11-23 09:59:32,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:32,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 09:59:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:33,174 INFO L225 Difference]: With dead ends: 593932 [2018-11-23 09:59:33,174 INFO L226 Difference]: Without dead ends: 335882 [2018-11-23 09:59:33,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2018-11-23 09:59:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2018-11-23 09:59:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2018-11-23 09:59:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2018-11-23 09:59:40,417 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2018-11-23 09:59:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:40,417 INFO L480 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2018-11-23 09:59:40,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2018-11-23 09:59:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 09:59:40,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:40,532 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-11-23 09:59:40,533 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:40,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2018-11-23 09:59:40,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:40,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:40,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:40,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:40,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:40,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:40,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:40,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:40,554 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2018-11-23 09:59:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:43,735 INFO L93 Difference]: Finished difference Result 503820 states and 606216 transitions. [2018-11-23 09:59:43,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:43,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-23 09:59:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:44,041 INFO L225 Difference]: With dead ends: 503820 [2018-11-23 09:59:44,041 INFO L226 Difference]: Without dead ends: 339978 [2018-11-23 09:59:44,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2018-11-23 09:59:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2018-11-23 09:59:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2018-11-23 09:59:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2018-11-23 09:59:49,397 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2018-11-23 09:59:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:49,398 INFO L480 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2018-11-23 09:59:49,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:59:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2018-11-23 09:59:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 09:59:49,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:49,516 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-11-23 09:59:49,516 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:49,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2018-11-23 09:59:49,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:59:49,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:59:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:49,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:59:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:59:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:59:49,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:59:49,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:59:49,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:59:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:59:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:49,542 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2018-11-23 09:59:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:57,004 INFO L93 Difference]: Finished difference Result 557068 states and 667656 transitions. [2018-11-23 09:59:57,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:59:57,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-23 09:59:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:57,437 INFO L225 Difference]: With dead ends: 557068 [2018-11-23 09:59:57,438 INFO L226 Difference]: Without dead ends: 557066 [2018-11-23 09:59:57,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:59:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2018-11-23 10:00:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2018-11-23 10:00:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2018-11-23 10:00:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2018-11-23 10:00:03,524 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2018-11-23 10:00:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:00:03,524 INFO L480 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2018-11-23 10:00:03,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:00:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2018-11-23 10:00:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 10:00:03,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:00:03,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, 1, 1, 1] [2018-11-23 10:00:03,758 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:00:03,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:00:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2018-11-23 10:00:03,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 10:00:03,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 10:00:03,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 10:00:03,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:00:03,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 10:00:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:00:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:00:03,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:00:03,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:00:03,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:00:03,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:00:03,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:00:03,789 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2018-11-23 10:00:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:00:15,205 INFO L93 Difference]: Finished difference Result 1179660 states and 1363976 transitions. [2018-11-23 10:00:15,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:00:15,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-23 10:00:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:00:15,700 INFO L225 Difference]: With dead ends: 1179660 [2018-11-23 10:00:15,700 INFO L226 Difference]: Without dead ends: 663562 [2018-11-23 10:00:15,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:00:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2018-11-23 10:00:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2018-11-23 10:00:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2018-11-23 10:00:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2018-11-23 10:00:26,398 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2018-11-23 10:00:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:00:26,398 INFO L480 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2018-11-23 10:00:26,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:00:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2018-11-23 10:00:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 10:00:26,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:00:26,717 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-11-23 10:00:26,717 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:00:26,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:00:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2018-11-23 10:00:26,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 10:00:26,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 10:00:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 10:00:26,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:00:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 10:00:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:00:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:00:26,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:00:26,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:00:26,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:00:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:00:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:00:26,743 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2018-11-23 10:00:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:00:34,134 INFO L93 Difference]: Finished difference Result 995340 states and 1126408 transitions. [2018-11-23 10:00:34,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:00:34,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 10:00:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:00:34,665 INFO L225 Difference]: With dead ends: 995340 [2018-11-23 10:00:34,665 INFO L226 Difference]: Without dead ends: 671754 [2018-11-23 10:00:34,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:00:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2018-11-23 10:00:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2018-11-23 10:00:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2018-11-23 10:00:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2018-11-23 10:00:49,979 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2018-11-23 10:00:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:00:49,979 INFO L480 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2018-11-23 10:00:49,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:00:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2018-11-23 10:00:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 10:00:50,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:00:50,243 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-11-23 10:00:50,244 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:00:50,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:00:50,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2018-11-23 10:00:50,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 10:00:50,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 10:00:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 10:00:50,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:00:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 10:00:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:00:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:00:50,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:00:50,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:00:50,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:00:50,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:00:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:00:50,283 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2018-11-23 10:01:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:02,613 INFO L93 Difference]: Finished difference Result 1081354 states and 1204231 transitions. [2018-11-23 10:01:02,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:01:02,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 10:01:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:01:03,514 INFO L225 Difference]: With dead ends: 1081354 [2018-11-23 10:01:03,514 INFO L226 Difference]: Without dead ends: 1081352 [2018-11-23 10:01:03,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:01:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2018-11-23 10:01:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2018-11-23 10:01:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2018-11-23 10:01:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2018-11-23 10:01:28,226 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2018-11-23 10:01:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:01:28,227 INFO L480 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2018-11-23 10:01:28,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:01:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2018-11-23 10:01:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 10:01:28,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:01:28,784 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-11-23 10:01:28,784 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:01:28,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:01:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2018-11-23 10:01:28,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 10:01:28,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 10:01:28,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 10:01:28,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:01:28,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 10:01:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:01:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:01:28,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:01:28,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:01:28,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:01:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:01:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:01:28,807 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2018-11-23 10:01:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:43,046 INFO L93 Difference]: Finished difference Result 2342920 states and 2547718 transitions. [2018-11-23 10:01:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:01:43,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 10:01:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:01:43,046 INFO L225 Difference]: With dead ends: 2342920 [2018-11-23 10:01:43,047 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:01:43,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-11-23 10:01:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:01:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:01:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:01:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:01:43,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-23 10:01:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:01:43,605 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:01:43,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:01:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:01:43,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:43,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:01:43,688 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:01:43,688 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,688 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,689 INFO L451 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-11-23 10:01:43,689 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L444 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-11-23 10:01:43,690 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-11-23 10:01:43,690 INFO L451 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-23 10:01:43,691 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-11-23 10:01:43,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:01:43 BoogieIcfgContainer [2018-11-23 10:01:43,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:01:43,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:01:43,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:01:43,697 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:01:43,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:58" (3/4) ... [2018-11-23 10:01:43,700 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:01:43,704 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:01:43,705 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:01:43,709 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 10:01:43,709 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 10:01:43,709 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:01:43,761 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e9706470-4e0f-4ac7-8df8-a05edc991552/bin-2019/uautomizer/witness.graphml [2018-11-23 10:01:43,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:01:43,763 INFO L168 Benchmark]: Toolchain (without parser) took 165921.83 ms. Allocated memory was 1.0 GB in the beginning and 9.0 GB in the end (delta: 8.0 GB). Free memory was 961.8 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. [2018-11-23 10:01:43,765 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 10:01:43,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.67 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 947.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 10:01:43,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.30 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 10:01:43,765 INFO L168 Benchmark]: Boogie Preprocessor took 58.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -204.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-23 10:01:43,766 INFO L168 Benchmark]: RCFGBuilder took 262.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-23 10:01:43,766 INFO L168 Benchmark]: TraceAbstraction took 165346.00 ms. Allocated memory was 1.2 GB in the beginning and 9.0 GB in the end (delta: 7.8 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. [2018-11-23 10:01:43,766 INFO L168 Benchmark]: Witness Printer took 65.28 ms. Allocated memory is still 9.0 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 77.2 kB). Peak memory consumption was 77.2 kB. Max. memory is 11.5 GB. [2018-11-23 10:01:43,768 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.67 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 947.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.30 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -204.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 262.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 165346.00 ms. Allocated memory was 1.2 GB in the beginning and 9.0 GB in the end (delta: 7.8 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. * Witness Printer took 65.28 ms. Allocated memory is still 9.0 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 77.2 kB). Peak memory consumption was 77.2 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, 165.2s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 76.1s 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s 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: 85.3s 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, 1.0s 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...