./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/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 c5a3d22d49117f02662b197492bc1b16616a2878 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 16:30:29,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:30:29,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:30:29,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:30:29,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:30:29,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:30:29,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:30:29,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:30:29,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:30:29,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:30:29,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:30:29,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:30:29,150 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:30:29,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:30:29,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:30:29,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:30:29,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:30:29,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:30:29,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:30:29,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:30:29,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:30:29,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:30:29,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:30:29,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:30:29,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:30:29,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:30:29,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:30:29,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:30:29,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:30:29,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:30:29,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:30:29,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:30:29,160 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:30:29,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:30:29,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:30:29,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:30:29,161 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 16:30:29,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:30:29,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:30:29,169 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 16:30:29,169 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 16:30:29,169 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 16:30:29,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 16:30:29,169 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 16:30:29,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 16:30:29,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 16:30:29,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:30:29,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 16:30:29,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 16:30:29,172 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_96f191c9-db75-49f5-b198-93d82c2783ea/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-12-08 16:30:29,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:30:29,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:30:29,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:30:29,198 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:30:29,198 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:30:29,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 16:30:29,232 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/data/09477cdd7/65d7f24efbf943ddb04a9c8521b477c8/FLAG7d3612cec [2018-12-08 16:30:29,532 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:30:29,533 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 16:30:29,537 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/data/09477cdd7/65d7f24efbf943ddb04a9c8521b477c8/FLAG7d3612cec [2018-12-08 16:30:29,960 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/data/09477cdd7/65d7f24efbf943ddb04a9c8521b477c8 [2018-12-08 16:30:29,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:30:29,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:30:29,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:30:29,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:30:29,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:30:29,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:30:29" (1/1) ... [2018-12-08 16:30:29,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdfc843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:29, skipping insertion in model container [2018-12-08 16:30:29,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:30:29" (1/1) ... [2018-12-08 16:30:29,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:30:29,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:30:30,078 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:30:30,081 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:30:30,098 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:30:30,105 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:30:30,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30 WrapperNode [2018-12-08 16:30:30,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:30:30,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:30:30,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:30:30,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:30:30,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:30:30,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:30:30,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:30:30,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:30:30,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... [2018-12-08 16:30:30,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:30:30,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:30:30,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:30:30,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:30:30,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 16:30:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 16:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:30:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 16:30:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 16:30:30,358 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:30:30,358 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 16:30:30,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:30:30 BoogieIcfgContainer [2018-12-08 16:30:30,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:30:30,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 16:30:30,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 16:30:30,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 16:30:30,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:30:29" (1/3) ... [2018-12-08 16:30:30,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243971ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:30:30, skipping insertion in model container [2018-12-08 16:30:30,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:30:30" (2/3) ... [2018-12-08 16:30:30,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243971ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:30:30, skipping insertion in model container [2018-12-08 16:30:30,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:30:30" (3/3) ... [2018-12-08 16:30:30,363 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 16:30:30,368 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 16:30:30,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 16:30:30,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 16:30:30,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 16:30:30,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 16:30:30,400 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 16:30:30,400 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 16:30:30,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:30:30,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:30:30,400 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 16:30:30,400 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:30:30,400 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 16:30:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-12-08 16:30:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 16:30:30,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,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] [2018-12-08 16:30:30,418 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-12-08 16:30:30,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,537 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-12-08 16:30:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,565 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-12-08 16:30:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 16:30:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,573 INFO L225 Difference]: With dead ends: 111 [2018-12-08 16:30:30,573 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 16:30:30,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 16:30:30,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-12-08 16:30:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-08 16:30:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-12-08 16:30:30,599 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-12-08 16:30:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,599 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-12-08 16:30:30,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-12-08 16:30:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 16:30:30,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:30,600 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-12-08 16:30:30,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,636 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-12-08 16:30:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,651 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-12-08 16:30:30,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 16:30:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,652 INFO L225 Difference]: With dead ends: 157 [2018-12-08 16:30:30,652 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 16:30:30,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-12-08 16:30:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 16:30:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-12-08 16:30:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-08 16:30:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-12-08 16:30:30,658 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-12-08 16:30:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,659 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-12-08 16:30:30,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-12-08 16:30:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 16:30:30,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:30,660 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,660 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-12-08 16:30:30,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,686 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-12-08 16:30:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,702 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-12-08 16:30:30,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 16:30:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,703 INFO L225 Difference]: With dead ends: 144 [2018-12-08 16:30:30,703 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 16:30:30,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 16:30:30,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-12-08 16:30:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 16:30:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-12-08 16:30:30,708 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-12-08 16:30:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,709 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-12-08 16:30:30,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-12-08 16:30:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 16:30:30,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:30,709 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-12-08 16:30:30,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,732 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-12-08 16:30:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,749 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-12-08 16:30:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 16:30:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,751 INFO L225 Difference]: With dead ends: 184 [2018-12-08 16:30:30,751 INFO L226 Difference]: Without dead ends: 182 [2018-12-08 16:30:30,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-12-08 16:30:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-08 16:30:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-12-08 16:30:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-08 16:30:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-12-08 16:30:30,761 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-12-08 16:30:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,762 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-12-08 16:30:30,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-12-08 16:30:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 16:30:30,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,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] [2018-12-08 16:30:30,763 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-12-08 16:30:30,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,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-12-08 16:30:30,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,789 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-12-08 16:30:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,800 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-12-08 16:30:30,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 16:30:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,801 INFO L225 Difference]: With dead ends: 304 [2018-12-08 16:30:30,801 INFO L226 Difference]: Without dead ends: 184 [2018-12-08 16:30:30,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-08 16:30:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-12-08 16:30:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-08 16:30:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-12-08 16:30:30,807 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-12-08 16:30:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,807 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-12-08 16:30:30,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-12-08 16:30:30,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 16:30:30,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:30,808 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-12-08 16:30:30,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,824 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-12-08 16:30:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,833 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-12-08 16:30:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 16:30:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,834 INFO L225 Difference]: With dead ends: 273 [2018-12-08 16:30:30,834 INFO L226 Difference]: Without dead ends: 186 [2018-12-08 16:30:30,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-08 16:30:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-12-08 16:30:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-08 16:30:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-12-08 16:30:30,840 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-12-08 16:30:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,840 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-12-08 16:30:30,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-12-08 16:30:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 16:30:30,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:30,841 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-12-08 16:30:30,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,857 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-12-08 16:30:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,867 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-12-08 16:30:30,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 16:30:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,868 INFO L225 Difference]: With dead ends: 348 [2018-12-08 16:30:30,868 INFO L226 Difference]: Without dead ends: 346 [2018-12-08 16:30:30,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-08 16:30:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-12-08 16:30:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-08 16:30:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-12-08 16:30:30,875 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-12-08 16:30:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,875 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-12-08 16:30:30,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-12-08 16:30:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 16:30:30,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:30,876 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,876 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-12-08 16:30:30,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,890 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-12-08 16:30:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,902 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-12-08 16:30:30,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 16:30:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,903 INFO L225 Difference]: With dead ends: 592 [2018-12-08 16:30:30,903 INFO L226 Difference]: Without dead ends: 354 [2018-12-08 16:30:30,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-08 16:30:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-12-08 16:30:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-08 16:30:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-12-08 16:30:30,915 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-12-08 16:30:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,916 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-12-08 16:30:30,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-12-08 16:30:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 16:30:30,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:30,917 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-12-08 16:30:30,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,942 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-12-08 16:30:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,955 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-12-08 16:30:30,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 16:30:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,957 INFO L225 Difference]: With dead ends: 528 [2018-12-08 16:30:30,957 INFO L226 Difference]: Without dead ends: 358 [2018-12-08 16:30:30,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-08 16:30:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-12-08 16:30:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-08 16:30:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-12-08 16:30:30,963 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-12-08 16:30:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:30,963 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-12-08 16:30:30,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-12-08 16:30:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 16:30:30,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:30,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:30,964 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:30,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-12-08 16:30:30,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:30,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:30,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:30,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:30,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:30,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:30,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:30,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:30,982 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-12-08 16:30:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:30,996 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-12-08 16:30:30,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:30,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 16:30:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:30,999 INFO L225 Difference]: With dead ends: 668 [2018-12-08 16:30:30,999 INFO L226 Difference]: Without dead ends: 666 [2018-12-08 16:30:30,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-12-08 16:30:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-12-08 16:30:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-12-08 16:30:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-12-08 16:30:31,010 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-12-08 16:30:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,011 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-12-08 16:30:31,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-12-08 16:30:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 16:30:31,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,012 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-12-08 16:30:31,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,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-12-08 16:30:31,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,031 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-12-08 16:30:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,046 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-12-08 16:30:31,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 16:30:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,048 INFO L225 Difference]: With dead ends: 1164 [2018-12-08 16:30:31,049 INFO L226 Difference]: Without dead ends: 690 [2018-12-08 16:30:31,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-12-08 16:30:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-12-08 16:30:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-12-08 16:30:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-12-08 16:30:31,063 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-12-08 16:30:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,063 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-12-08 16:30:31,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-12-08 16:30:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 16:30:31,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,064 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-12-08 16:30:31,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,083 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-12-08 16:30:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,098 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-12-08 16:30:31,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 16:30:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,099 INFO L225 Difference]: With dead ends: 1032 [2018-12-08 16:30:31,099 INFO L226 Difference]: Without dead ends: 698 [2018-12-08 16:30:31,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-08 16:30:31,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-12-08 16:30:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-08 16:30:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-12-08 16:30:31,112 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-12-08 16:30:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,112 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-12-08 16:30:31,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-12-08 16:30:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 16:30:31,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,113 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-12-08 16:30:31,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,131 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-12-08 16:30:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,147 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-12-08 16:30:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 16:30:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,149 INFO L225 Difference]: With dead ends: 1292 [2018-12-08 16:30:31,150 INFO L226 Difference]: Without dead ends: 1290 [2018-12-08 16:30:31,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-12-08 16:30:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-12-08 16:30:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-12-08 16:30:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-12-08 16:30:31,167 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-12-08 16:30:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,167 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-12-08 16:30:31,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-12-08 16:30:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 16:30:31,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,168 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-12-08 16:30:31,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,186 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-12-08 16:30:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,206 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-12-08 16:30:31,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 16:30:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,209 INFO L225 Difference]: With dead ends: 2300 [2018-12-08 16:30:31,209 INFO L226 Difference]: Without dead ends: 1354 [2018-12-08 16:30:31,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-08 16:30:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-12-08 16:30:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-08 16:30:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-12-08 16:30:31,234 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-12-08 16:30:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,234 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-12-08 16:30:31,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-12-08 16:30:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 16:30:31,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,235 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-12-08 16:30:31,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,254 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-12-08 16:30:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,279 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-12-08 16:30:31,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 16:30:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,284 INFO L225 Difference]: With dead ends: 2028 [2018-12-08 16:30:31,284 INFO L226 Difference]: Without dead ends: 1370 [2018-12-08 16:30:31,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-12-08 16:30:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-12-08 16:30:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-12-08 16:30:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-12-08 16:30:31,321 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-12-08 16:30:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,321 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-12-08 16:30:31,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-12-08 16:30:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 16:30:31,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,322 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-12-08 16:30:31,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,354 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-12-08 16:30:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,392 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-12-08 16:30:31,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 16:30:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,399 INFO L225 Difference]: With dead ends: 2508 [2018-12-08 16:30:31,399 INFO L226 Difference]: Without dead ends: 2506 [2018-12-08 16:30:31,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-08 16:30:31,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-12-08 16:30:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-12-08 16:30:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-12-08 16:30:31,440 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-12-08 16:30:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,441 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-12-08 16:30:31,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-12-08 16:30:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 16:30:31,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,442 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-12-08 16:30:31,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,452 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-12-08 16:30:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,480 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-12-08 16:30:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 16:30:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,484 INFO L225 Difference]: With dead ends: 4556 [2018-12-08 16:30:31,484 INFO L226 Difference]: Without dead ends: 2666 [2018-12-08 16:30:31,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-12-08 16:30:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-12-08 16:30:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-12-08 16:30:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-12-08 16:30:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-12-08 16:30:31,524 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-12-08 16:30:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,524 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-12-08 16:30:31,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-12-08 16:30:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 16:30:31,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,526 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-12-08 16:30:31,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,535 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-12-08 16:30:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,560 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-12-08 16:30:31,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 16:30:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,564 INFO L225 Difference]: With dead ends: 3996 [2018-12-08 16:30:31,564 INFO L226 Difference]: Without dead ends: 2698 [2018-12-08 16:30:31,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-12-08 16:30:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-12-08 16:30:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-12-08 16:30:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-12-08 16:30:31,603 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-12-08 16:30:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,603 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-12-08 16:30:31,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-12-08 16:30:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 16:30:31,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,605 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-12-08 16:30:31,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,618 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-12-08 16:30:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,653 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-12-08 16:30:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 16:30:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,662 INFO L225 Difference]: With dead ends: 4876 [2018-12-08 16:30:31,662 INFO L226 Difference]: Without dead ends: 4874 [2018-12-08 16:30:31,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-12-08 16:30:31,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-12-08 16:30:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-12-08 16:30:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-12-08 16:30:31,719 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-12-08 16:30:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,719 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-12-08 16:30:31,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-12-08 16:30:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 16:30:31,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,722 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-12-08 16:30:31,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,738 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-12-08 16:30:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,802 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-12-08 16:30:31,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 16:30:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,811 INFO L225 Difference]: With dead ends: 9036 [2018-12-08 16:30:31,811 INFO L226 Difference]: Without dead ends: 5258 [2018-12-08 16:30:31,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-08 16:30:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-12-08 16:30:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-12-08 16:30:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-12-08 16:30:31,899 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-12-08 16:30:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:31,900 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-12-08 16:30:31,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-12-08 16:30:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 16:30:31,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:31,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:31,902 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:31,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-12-08 16:30:31,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:31,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:31,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:31,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:31,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:31,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,919 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-12-08 16:30:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:31,965 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-12-08 16:30:31,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:31,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 16:30:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:31,975 INFO L225 Difference]: With dead ends: 7884 [2018-12-08 16:30:31,975 INFO L226 Difference]: Without dead ends: 5322 [2018-12-08 16:30:31,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-12-08 16:30:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-12-08 16:30:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-12-08 16:30:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-12-08 16:30:32,047 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-12-08 16:30:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:32,047 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-12-08 16:30:32,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-12-08 16:30:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 16:30:32,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:32,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:32,050 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:32,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-12-08 16:30:32,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:32,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:32,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:32,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:32,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:32,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:32,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:32,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:32,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:32,061 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-12-08 16:30:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:32,158 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-12-08 16:30:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:32,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 16:30:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:32,176 INFO L225 Difference]: With dead ends: 15564 [2018-12-08 16:30:32,177 INFO L226 Difference]: Without dead ends: 10378 [2018-12-08 16:30:32,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-12-08 16:30:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-12-08 16:30:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-08 16:30:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-12-08 16:30:32,305 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-12-08 16:30:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:32,305 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-12-08 16:30:32,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-12-08 16:30:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 16:30:32,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:32,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:32,311 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:32,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:32,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-12-08 16:30:32,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:32,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:32,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:32,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:32,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:32,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:32,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:32,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:32,322 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-12-08 16:30:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:32,434 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-12-08 16:30:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:32,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 16:30:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:32,445 INFO L225 Difference]: With dead ends: 12172 [2018-12-08 16:30:32,445 INFO L226 Difference]: Without dead ends: 12170 [2018-12-08 16:30:32,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-12-08 16:30:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-12-08 16:30:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-12-08 16:30:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-08 16:30:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-12-08 16:30:32,562 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-12-08 16:30:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:32,563 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-12-08 16:30:32,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-12-08 16:30:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 16:30:32,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:32,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:32,568 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:32,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-12-08 16:30:32,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:32,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:32,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:32,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:32,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:32,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:32,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:32,579 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-12-08 16:30:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:32,678 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-12-08 16:30:32,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:32,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-08 16:30:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:32,694 INFO L225 Difference]: With dead ends: 18316 [2018-12-08 16:30:32,694 INFO L226 Difference]: Without dead ends: 18314 [2018-12-08 16:30:32,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-12-08 16:30:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-12-08 16:30:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2018-12-08 16:30:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2018-12-08 16:30:32,867 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2018-12-08 16:30:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:32,867 INFO L480 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2018-12-08 16:30:32,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2018-12-08 16:30:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 16:30:32,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:32,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:32,874 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:32,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2018-12-08 16:30:32,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:32,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:32,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:32,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:32,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:32,891 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2018-12-08 16:30:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:33,044 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2018-12-08 16:30:33,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:33,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-08 16:30:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:33,061 INFO L225 Difference]: With dead ends: 35468 [2018-12-08 16:30:33,061 INFO L226 Difference]: Without dead ends: 20362 [2018-12-08 16:30:33,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2018-12-08 16:30:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2018-12-08 16:30:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2018-12-08 16:30:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2018-12-08 16:30:33,283 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2018-12-08 16:30:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:33,283 INFO L480 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2018-12-08 16:30:33,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2018-12-08 16:30:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 16:30:33,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:33,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:33,291 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:33,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2018-12-08 16:30:33,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:33,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:33,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:33,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:33,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:33,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:33,304 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2018-12-08 16:30:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:33,487 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2018-12-08 16:30:33,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:33,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 16:30:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:33,499 INFO L225 Difference]: With dead ends: 30732 [2018-12-08 16:30:33,499 INFO L226 Difference]: Without dead ends: 20746 [2018-12-08 16:30:33,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2018-12-08 16:30:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2018-12-08 16:30:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2018-12-08 16:30:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2018-12-08 16:30:33,717 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2018-12-08 16:30:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:33,717 INFO L480 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2018-12-08 16:30:33,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2018-12-08 16:30:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 16:30:33,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:33,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:33,723 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:33,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2018-12-08 16:30:33,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:33,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:33,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:33,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:33,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:33,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:33,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:33,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:33,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:33,733 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2018-12-08 16:30:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:33,940 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2018-12-08 16:30:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:33,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 16:30:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:33,962 INFO L225 Difference]: With dead ends: 35852 [2018-12-08 16:30:33,962 INFO L226 Difference]: Without dead ends: 35850 [2018-12-08 16:30:33,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2018-12-08 16:30:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2018-12-08 16:30:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2018-12-08 16:30:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2018-12-08 16:30:34,292 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2018-12-08 16:30:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:34,292 INFO L480 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2018-12-08 16:30:34,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2018-12-08 16:30:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 16:30:34,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:34,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:34,304 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:34,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:34,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2018-12-08 16:30:34,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:34,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:34,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:34,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:34,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:34,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:34,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:34,313 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2018-12-08 16:30:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:34,591 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2018-12-08 16:30:34,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:34,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 16:30:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:34,622 INFO L225 Difference]: With dead ends: 70668 [2018-12-08 16:30:34,622 INFO L226 Difference]: Without dead ends: 40458 [2018-12-08 16:30:34,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2018-12-08 16:30:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2018-12-08 16:30:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2018-12-08 16:30:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2018-12-08 16:30:35,150 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2018-12-08 16:30:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:35,150 INFO L480 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2018-12-08 16:30:35,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2018-12-08 16:30:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 16:30:35,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:35,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:35,160 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:35,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:35,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2018-12-08 16:30:35,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:35,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:35,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:35,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:35,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:35,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:35,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:35,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:35,170 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2018-12-08 16:30:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:35,442 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2018-12-08 16:30:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:35,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 16:30:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:35,470 INFO L225 Difference]: With dead ends: 60684 [2018-12-08 16:30:35,470 INFO L226 Difference]: Without dead ends: 40970 [2018-12-08 16:30:35,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2018-12-08 16:30:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2018-12-08 16:30:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2018-12-08 16:30:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2018-12-08 16:30:35,976 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2018-12-08 16:30:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:35,976 INFO L480 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2018-12-08 16:30:35,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2018-12-08 16:30:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 16:30:35,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:35,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:35,987 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:35,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2018-12-08 16:30:35,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:35,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:35,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:35,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:35,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:36,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:36,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:36,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:36,011 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2018-12-08 16:30:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:36,461 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2018-12-08 16:30:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:36,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 16:30:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:36,508 INFO L225 Difference]: With dead ends: 69644 [2018-12-08 16:30:36,509 INFO L226 Difference]: Without dead ends: 69642 [2018-12-08 16:30:36,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2018-12-08 16:30:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2018-12-08 16:30:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2018-12-08 16:30:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2018-12-08 16:30:37,261 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2018-12-08 16:30:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:37,261 INFO L480 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2018-12-08 16:30:37,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2018-12-08 16:30:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 16:30:37,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:37,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:37,285 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:37,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2018-12-08 16:30:37,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:37,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:37,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:37,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:37,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:37,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:37,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:37,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:37,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:37,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:37,298 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2018-12-08 16:30:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:37,909 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2018-12-08 16:30:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:37,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 16:30:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:37,965 INFO L225 Difference]: With dead ends: 140300 [2018-12-08 16:30:37,965 INFO L226 Difference]: Without dead ends: 79882 [2018-12-08 16:30:38,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2018-12-08 16:30:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2018-12-08 16:30:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2018-12-08 16:30:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2018-12-08 16:30:39,007 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2018-12-08 16:30:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:39,007 INFO L480 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2018-12-08 16:30:39,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2018-12-08 16:30:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 16:30:39,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:39,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:39,031 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:39,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:39,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2018-12-08 16:30:39,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:39,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:39,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:39,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-12-08 16:30:39,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:39,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:39,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:39,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:39,041 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2018-12-08 16:30:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:39,649 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2018-12-08 16:30:39,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:39,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 16:30:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:39,714 INFO L225 Difference]: With dead ends: 119820 [2018-12-08 16:30:39,715 INFO L226 Difference]: Without dead ends: 80906 [2018-12-08 16:30:39,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:39,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2018-12-08 16:30:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2018-12-08 16:30:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2018-12-08 16:30:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2018-12-08 16:30:40,734 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2018-12-08 16:30:40,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:40,734 INFO L480 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2018-12-08 16:30:40,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2018-12-08 16:30:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 16:30:40,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:40,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:40,759 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:40,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2018-12-08 16:30:40,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:40,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:40,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:40,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:40,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:40,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:40,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:40,768 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2018-12-08 16:30:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:41,819 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2018-12-08 16:30:41,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:41,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 16:30:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:41,907 INFO L225 Difference]: With dead ends: 135180 [2018-12-08 16:30:41,907 INFO L226 Difference]: Without dead ends: 135178 [2018-12-08 16:30:41,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2018-12-08 16:30:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2018-12-08 16:30:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2018-12-08 16:30:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2018-12-08 16:30:43,225 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2018-12-08 16:30:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:43,225 INFO L480 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2018-12-08 16:30:43,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2018-12-08 16:30:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 16:30:43,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:43,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:43,276 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:43,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2018-12-08 16:30:43,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:43,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:43,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:43,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:43,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:43,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:43,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:43,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:43,286 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2018-12-08 16:30:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:44,690 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2018-12-08 16:30:44,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:44,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 16:30:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:44,796 INFO L225 Difference]: With dead ends: 278540 [2018-12-08 16:30:44,797 INFO L226 Difference]: Without dead ends: 157706 [2018-12-08 16:30:44,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2018-12-08 16:30:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2018-12-08 16:30:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2018-12-08 16:30:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2018-12-08 16:30:46,843 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2018-12-08 16:30:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:46,843 INFO L480 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2018-12-08 16:30:46,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2018-12-08 16:30:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 16:30:46,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:46,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:46,898 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:46,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2018-12-08 16:30:46,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:46,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:46,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:46,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:46,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:46,908 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2018-12-08 16:30:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:48,175 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2018-12-08 16:30:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:48,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 16:30:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:48,301 INFO L225 Difference]: With dead ends: 236556 [2018-12-08 16:30:48,301 INFO L226 Difference]: Without dead ends: 159754 [2018-12-08 16:30:48,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2018-12-08 16:30:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2018-12-08 16:30:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2018-12-08 16:30:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2018-12-08 16:30:51,495 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2018-12-08 16:30:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:51,496 INFO L480 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2018-12-08 16:30:51,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2018-12-08 16:30:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 16:30:51,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:51,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:51,550 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:51,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2018-12-08 16:30:51,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:51,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:51,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:51,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:51,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:51,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:51,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:51,560 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2018-12-08 16:30:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:53,684 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2018-12-08 16:30:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:53,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 16:30:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:54,027 INFO L225 Difference]: With dead ends: 262156 [2018-12-08 16:30:54,027 INFO L226 Difference]: Without dead ends: 262154 [2018-12-08 16:30:54,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2018-12-08 16:30:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2018-12-08 16:30:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2018-12-08 16:30:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2018-12-08 16:30:56,580 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2018-12-08 16:30:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:56,581 INFO L480 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2018-12-08 16:30:56,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:30:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2018-12-08 16:30:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 16:30:56,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:56,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:56,693 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:30:56,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2018-12-08 16:30:56,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:30:56,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:30:56,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:56,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:56,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:30:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:56,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:30:56,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:30:56,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:30:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:30:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:30:56,704 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2018-12-08 16:30:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:59,640 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2018-12-08 16:30:59,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:30:59,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 16:30:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:59,909 INFO L225 Difference]: With dead ends: 552972 [2018-12-08 16:30:59,909 INFO L226 Difference]: Without dead ends: 311306 [2018-12-08 16:31:00,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:31:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2018-12-08 16:31:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2018-12-08 16:31:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2018-12-08 16:31:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2018-12-08 16:31:04,202 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2018-12-08 16:31:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:31:04,202 INFO L480 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2018-12-08 16:31:04,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:31:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2018-12-08 16:31:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 16:31:04,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:31:04,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:31:04,319 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:31:04,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:31:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2018-12-08 16:31:04,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:31:04,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:31:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:31:04,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:31:04,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:31:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:31:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:31:04,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:31:04,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:31:04,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:31:04,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:31:04,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:31:04,330 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2018-12-08 16:31:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:31:08,196 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2018-12-08 16:31:08,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:31:08,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-08 16:31:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:31:08,442 INFO L225 Difference]: With dead ends: 466956 [2018-12-08 16:31:08,443 INFO L226 Difference]: Without dead ends: 315402 [2018-12-08 16:31:08,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:31:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2018-12-08 16:31:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2018-12-08 16:31:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2018-12-08 16:31:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2018-12-08 16:31:12,583 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2018-12-08 16:31:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:31:12,583 INFO L480 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2018-12-08 16:31:12,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:31:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2018-12-08 16:31:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 16:31:12,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:31:12,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:31:12,702 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:31:12,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:31:12,703 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2018-12-08 16:31:12,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:31:12,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:31:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:31:12,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:31:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:31:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:31:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:31:12,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:31:12,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:31:12,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:31:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:31:12,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:31:12,714 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2018-12-08 16:31:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:31:17,466 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2018-12-08 16:31:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:31:17,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-08 16:31:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:31:18,104 INFO L225 Difference]: With dead ends: 507914 [2018-12-08 16:31:18,104 INFO L226 Difference]: Without dead ends: 507912 [2018-12-08 16:31:18,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:31:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2018-12-08 16:31:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2018-12-08 16:31:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2018-12-08 16:31:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2018-12-08 16:31:23,355 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2018-12-08 16:31:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:31:23,355 INFO L480 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2018-12-08 16:31:23,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:31:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2018-12-08 16:31:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 16:31:23,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:31:23,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:31:23,588 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:31:23,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:31:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2018-12-08 16:31:23,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:31:23,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:31:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:31:23,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:31:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:31:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:31:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:31:23,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:31:23,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:31:23,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:31:23,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:31:23,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:31:23,612 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2018-12-08 16:31:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:31:31,120 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2018-12-08 16:31:31,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:31:31,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-08 16:31:31,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:31:31,121 INFO L225 Difference]: With dead ends: 1097736 [2018-12-08 16:31:31,121 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 16:31:31,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:31:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 16:31:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 16:31:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 16:31:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 16:31:31,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-12-08 16:31:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:31:31,472 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:31:31,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:31:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 16:31:31,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 16:31:31,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 16:31:31,524 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 16:31:31,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 16:31:31,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 16:31:31,524 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 16:31:31,525 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,525 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,526 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-12-08 16:31:31,527 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-12-08 16:31:31,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:31:31 BoogieIcfgContainer [2018-12-08 16:31:31,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 16:31:31,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:31:31,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:31:31,532 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:31:31,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:30:30" (3/4) ... [2018-12-08 16:31:31,534 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 16:31:31,539 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 16:31:31,539 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 16:31:31,542 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-08 16:31:31,543 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 16:31:31,543 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 16:31:31,579 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_96f191c9-db75-49f5-b198-93d82c2783ea/bin-2019/uautomizer/witness.graphml [2018-12-08 16:31:31,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:31:31,580 INFO L168 Benchmark]: Toolchain (without parser) took 61617.97 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.2 GB). Free memory was 954.9 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-08 16:31:31,581 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:31:31,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.15 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:31:31,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.89 ms. Allocated memory is still 1.0 GB. Free memory was 944.2 MB in the beginning and 938.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 16:31:31,581 INFO L168 Benchmark]: Boogie Preprocessor took 43.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-08 16:31:31,582 INFO L168 Benchmark]: RCFGBuilder took 196.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-12-08 16:31:31,582 INFO L168 Benchmark]: TraceAbstraction took 61172.17 ms. Allocated memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-08 16:31:31,582 INFO L168 Benchmark]: Witness Printer took 47.68 ms. Allocated memory is still 6.2 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 833.5 kB). Peak memory consumption was 833.5 kB. Max. memory is 11.5 GB. [2018-12-08 16:31:31,584 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.15 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.89 ms. Allocated memory is still 1.0 GB. Free memory was 944.2 MB in the beginning and 938.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 196.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61172.17 ms. Allocated memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 47.68 ms. Allocated memory is still 6.2 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 833.5 kB). Peak memory consumption was 833.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 61.1s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 31.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, 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: 27.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...