./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11_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_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/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 56f043bec3037ec37b4a132611abd4a337934428 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:33:32,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 13:33:32,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 13:33:33,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 13:33:33,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 13:33:33,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 13:33:33,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 13:33:33,007 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 13:33:33,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 13:33:33,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 13:33:33,009 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 13:33:33,009 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 13:33:33,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 13:33:33,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 13:33:33,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 13:33:33,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 13:33:33,012 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 13:33:33,013 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 13:33:33,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 13:33:33,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 13:33:33,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 13:33:33,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 13:33:33,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 13:33:33,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 13:33:33,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 13:33:33,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 13:33:33,018 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 13:33:33,019 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 13:33:33,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 13:33:33,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 13:33:33,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 13:33:33,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 13:33:33,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 13:33:33,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 13:33:33,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 13:33:33,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 13:33:33,022 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 13:33:33,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 13:33:33,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 13:33:33,031 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 13:33:33,031 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 13:33:33,031 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 13:33:33,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 13:33:33,032 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 13:33:33,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 13:33:33,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 13:33:33,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 13:33:33,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 13:33:33,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 13:33:33,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 13:33:33,033 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 13:33:33,033 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 13:33:33,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 13:33:33,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 13:33:33,033 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 13:33:33,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 13:33:33,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 13:33:33,034 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 13:33:33,034 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 13:33:33,034 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 13:33:33,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 13:33:33,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 13:33:33,035 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 13:33:33,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 13:33:33,035 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 13:33:33,035 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 13:33:33,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 13:33:33,035 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_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-12-08 13:33:33,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 13:33:33,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 13:33:33,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 13:33:33,070 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 13:33:33,070 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 13:33:33,070 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 13:33:33,110 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/data/b0dbb0485/7353768bd26847b9bbf8ab2f3318aa5d/FLAG06318a73d [2018-12-08 13:33:33,432 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 13:33:33,432 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 13:33:33,436 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/data/b0dbb0485/7353768bd26847b9bbf8ab2f3318aa5d/FLAG06318a73d [2018-12-08 13:33:33,444 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/data/b0dbb0485/7353768bd26847b9bbf8ab2f3318aa5d [2018-12-08 13:33:33,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 13:33:33,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 13:33:33,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 13:33:33,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 13:33:33,449 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 13:33:33,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33, skipping insertion in model container [2018-12-08 13:33:33,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 13:33:33,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 13:33:33,555 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:33:33,558 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 13:33:33,572 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:33:33,580 INFO L195 MainTranslator]: Completed translation [2018-12-08 13:33:33,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33 WrapperNode [2018-12-08 13:33:33,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 13:33:33,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 13:33:33,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 13:33:33,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 13:33:33,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 13:33:33,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 13:33:33,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 13:33:33,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 13:33:33,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... [2018-12-08 13:33:33,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 13:33:33,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 13:33:33,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 13:33:33,639 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 13:33:33,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/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 13:33:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 13:33:33,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 13:33:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 13:33:33,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 13:33:33,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 13:33:33,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 13:33:33,830 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 13:33:33,830 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 13:33:33,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:33:33 BoogieIcfgContainer [2018-12-08 13:33:33,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 13:33:33,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 13:33:33,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 13:33:33,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 13:33:33,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 01:33:33" (1/3) ... [2018-12-08 13:33:33,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e98445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 01:33:33, skipping insertion in model container [2018-12-08 13:33:33,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:33:33" (2/3) ... [2018-12-08 13:33:33,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e98445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 01:33:33, skipping insertion in model container [2018-12-08 13:33:33,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:33:33" (3/3) ... [2018-12-08 13:33:33,835 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 13:33:33,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 13:33:33,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 13:33:33,856 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 13:33:33,874 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 13:33:33,874 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 13:33:33,874 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 13:33:33,874 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 13:33:33,874 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 13:33:33,874 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 13:33:33,874 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 13:33:33,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 13:33:33,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 13:33:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-08 13:33:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 13:33:33,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:33,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:33,891 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:33,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-12-08 13:33:33,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:33,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:33,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:33,999 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 13:33:34,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,013 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-08 13:33:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,040 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-12-08 13:33:34,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 13:33:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,047 INFO L225 Difference]: With dead ends: 93 [2018-12-08 13:33:34,047 INFO L226 Difference]: Without dead ends: 78 [2018-12-08 13:33:34,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 13:33:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-08 13:33:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-12-08 13:33:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-08 13:33:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-12-08 13:33:34,073 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-12-08 13:33:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,073 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-12-08 13:33:34,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-12-08 13:33:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 13:33:34,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:34,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-12-08 13:33:34,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:33:34,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,108 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-12-08 13:33:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,122 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-12-08 13:33:34,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 13:33:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,123 INFO L225 Difference]: With dead ends: 127 [2018-12-08 13:33:34,123 INFO L226 Difference]: Without dead ends: 78 [2018-12-08 13:33:34,124 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 13:33:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-08 13:33:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-08 13:33:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 13:33:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-12-08 13:33:34,129 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-12-08 13:33:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,130 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-12-08 13:33:34,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-12-08 13:33:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 13:33:34,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:34,130 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-12-08 13:33:34,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,159 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 13:33:34,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,160 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-12-08 13:33:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,173 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-12-08 13:33:34,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 13:33:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,174 INFO L225 Difference]: With dead ends: 117 [2018-12-08 13:33:34,174 INFO L226 Difference]: Without dead ends: 81 [2018-12-08 13:33:34,175 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 13:33:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-08 13:33:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-12-08 13:33:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-08 13:33:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-12-08 13:33:34,179 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-12-08 13:33:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,179 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-12-08 13:33:34,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-12-08 13:33:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 13:33:34,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:34,180 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-12-08 13:33:34,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,198 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 13:33:34,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,199 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-12-08 13:33:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,211 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-12-08 13:33:34,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 13:33:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,213 INFO L225 Difference]: With dead ends: 148 [2018-12-08 13:33:34,213 INFO L226 Difference]: Without dead ends: 146 [2018-12-08 13:33:34,213 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 13:33:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-08 13:33:34,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-12-08 13:33:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-08 13:33:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-12-08 13:33:34,219 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-12-08 13:33:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,220 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-12-08 13:33:34,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-12-08 13:33:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 13:33:34,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:34,221 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-12-08 13:33:34,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,242 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 13:33:34,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,244 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-12-08 13:33:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,257 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-12-08 13:33:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 13:33:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,259 INFO L225 Difference]: With dead ends: 244 [2018-12-08 13:33:34,259 INFO L226 Difference]: Without dead ends: 148 [2018-12-08 13:33:34,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-08 13:33:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-12-08 13:33:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-08 13:33:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-12-08 13:33:34,267 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-12-08 13:33:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,268 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-12-08 13:33:34,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-12-08 13:33:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 13:33:34,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:34,269 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-12-08 13:33:34,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,290 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 13:33:34,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,292 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-12-08 13:33:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,305 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-12-08 13:33:34,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 13:33:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,306 INFO L225 Difference]: With dead ends: 219 [2018-12-08 13:33:34,306 INFO L226 Difference]: Without dead ends: 150 [2018-12-08 13:33:34,307 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 13:33:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-08 13:33:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-12-08 13:33:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-08 13:33:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-12-08 13:33:34,314 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-12-08 13:33:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,314 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-12-08 13:33:34,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-12-08 13:33:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 13:33:34,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:34,316 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-12-08 13:33:34,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,342 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 13:33:34,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,343 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-12-08 13:33:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,354 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-12-08 13:33:34,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 13:33:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,356 INFO L225 Difference]: With dead ends: 276 [2018-12-08 13:33:34,356 INFO L226 Difference]: Without dead ends: 274 [2018-12-08 13:33:34,356 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 13:33:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-08 13:33:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-12-08 13:33:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-08 13:33:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-12-08 13:33:34,364 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-12-08 13:33:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,365 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-12-08 13:33:34,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-12-08 13:33:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 13:33:34,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:34,366 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-12-08 13:33:34,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,383 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 13:33:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,384 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-12-08 13:33:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,405 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-12-08 13:33:34,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 13:33:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,407 INFO L225 Difference]: With dead ends: 472 [2018-12-08 13:33:34,407 INFO L226 Difference]: Without dead ends: 282 [2018-12-08 13:33:34,407 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 13:33:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-08 13:33:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-12-08 13:33:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-08 13:33:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-12-08 13:33:34,416 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-12-08 13:33:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,417 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-12-08 13:33:34,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-12-08 13:33:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 13:33:34,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,418 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 13:33:34,418 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-12-08 13:33:34,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,441 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 13:33:34,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,442 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-12-08 13:33:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,451 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-12-08 13:33:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 13:33:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,453 INFO L225 Difference]: With dead ends: 420 [2018-12-08 13:33:34,453 INFO L226 Difference]: Without dead ends: 286 [2018-12-08 13:33:34,453 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 13:33:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-08 13:33:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-12-08 13:33:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-12-08 13:33:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-12-08 13:33:34,460 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-12-08 13:33:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,460 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-12-08 13:33:34,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-12-08 13:33:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 13:33:34,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,461 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 13:33:34,461 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-12-08 13:33:34,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,478 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 13:33:34,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,479 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-12-08 13:33:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,495 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-12-08 13:33:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 13:33:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,497 INFO L225 Difference]: With dead ends: 524 [2018-12-08 13:33:34,497 INFO L226 Difference]: Without dead ends: 522 [2018-12-08 13:33:34,497 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 13:33:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-12-08 13:33:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-12-08 13:33:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-08 13:33:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-12-08 13:33:34,506 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-12-08 13:33:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,506 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-12-08 13:33:34,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-12-08 13:33:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 13:33:34,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,507 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 13:33:34,507 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-12-08 13:33:34,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,518 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 13:33:34,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,519 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-12-08 13:33:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,534 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-12-08 13:33:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 13:33:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,536 INFO L225 Difference]: With dead ends: 924 [2018-12-08 13:33:34,536 INFO L226 Difference]: Without dead ends: 546 [2018-12-08 13:33:34,536 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 13:33:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-12-08 13:33:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-12-08 13:33:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-08 13:33:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-12-08 13:33:34,547 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-12-08 13:33:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,547 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-12-08 13:33:34,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-12-08 13:33:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 13:33:34,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,548 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 13:33:34,548 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-12-08 13:33:34,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,562 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 13:33:34,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,562 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-12-08 13:33:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,574 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-12-08 13:33:34,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 13:33:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,576 INFO L225 Difference]: With dead ends: 816 [2018-12-08 13:33:34,576 INFO L226 Difference]: Without dead ends: 554 [2018-12-08 13:33:34,576 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 13:33:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-08 13:33:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-12-08 13:33:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-08 13:33:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-12-08 13:33:34,586 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-12-08 13:33:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,586 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-12-08 13:33:34,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,586 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-12-08 13:33:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 13:33:34,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,587 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 13:33:34,587 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-12-08 13:33:34,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:33:34,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,599 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-12-08 13:33:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,619 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-12-08 13:33:34,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 13:33:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,621 INFO L225 Difference]: With dead ends: 1004 [2018-12-08 13:33:34,621 INFO L226 Difference]: Without dead ends: 1002 [2018-12-08 13:33:34,622 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 13:33:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-12-08 13:33:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-12-08 13:33:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-08 13:33:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-12-08 13:33:34,637 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-12-08 13:33:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,637 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-12-08 13:33:34,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-12-08 13:33:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 13:33:34,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,638 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 13:33:34,638 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-12-08 13:33:34,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,654 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 13:33:34,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,655 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-12-08 13:33:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,673 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-12-08 13:33:34,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 13:33:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,675 INFO L225 Difference]: With dead ends: 1820 [2018-12-08 13:33:34,676 INFO L226 Difference]: Without dead ends: 1066 [2018-12-08 13:33:34,676 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 13:33:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-12-08 13:33:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-12-08 13:33:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-12-08 13:33:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-12-08 13:33:34,696 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-12-08 13:33:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,696 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-12-08 13:33:34,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-12-08 13:33:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 13:33:34,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,697 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 13:33:34,697 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-12-08 13:33:34,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,709 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 13:33:34,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,710 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-12-08 13:33:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,728 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-12-08 13:33:34,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 13:33:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,730 INFO L225 Difference]: With dead ends: 1596 [2018-12-08 13:33:34,730 INFO L226 Difference]: Without dead ends: 1082 [2018-12-08 13:33:34,731 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 13:33:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-12-08 13:33:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-12-08 13:33:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-12-08 13:33:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-12-08 13:33:34,752 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-12-08 13:33:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,752 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-12-08 13:33:34,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-12-08 13:33:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 13:33:34,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,753 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 13:33:34,753 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-12-08 13:33:34,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,765 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 13:33:34,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,766 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-12-08 13:33:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,790 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-12-08 13:33:34,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 13:33:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,793 INFO L225 Difference]: With dead ends: 1932 [2018-12-08 13:33:34,793 INFO L226 Difference]: Without dead ends: 1930 [2018-12-08 13:33:34,794 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 13:33:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-12-08 13:33:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-12-08 13:33:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-12-08 13:33:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-12-08 13:33:34,821 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-12-08 13:33:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,822 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-12-08 13:33:34,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-12-08 13:33:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 13:33:34,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,823 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 13:33:34,823 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-12-08 13:33:34,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:33:34,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,839 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-12-08 13:33:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,867 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-12-08 13:33:34,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 13:33:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,870 INFO L225 Difference]: With dead ends: 3596 [2018-12-08 13:33:34,870 INFO L226 Difference]: Without dead ends: 2090 [2018-12-08 13:33:34,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-12-08 13:33:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-12-08 13:33:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-12-08 13:33:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-12-08 13:33:34,912 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-12-08 13:33:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:34,912 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-12-08 13:33:34,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-12-08 13:33:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 13:33:34,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:34,914 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 13:33:34,914 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:34,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-12-08 13:33:34,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:34,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:34,925 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 13:33:34,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:34,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:34,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:34,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:34,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:34,926 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-12-08 13:33:34,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:34,961 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-12-08 13:33:34,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:34,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 13:33:34,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:34,965 INFO L225 Difference]: With dead ends: 3132 [2018-12-08 13:33:34,965 INFO L226 Difference]: Without dead ends: 2122 [2018-12-08 13:33:34,967 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 13:33:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-12-08 13:33:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-12-08 13:33:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-12-08 13:33:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-12-08 13:33:35,022 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-12-08 13:33:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:35,023 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-12-08 13:33:35,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-12-08 13:33:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 13:33:35,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:35,024 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 13:33:35,024 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:35,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-12-08 13:33:35,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:35,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:35,039 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 13:33:35,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:35,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:35,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:35,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:35,040 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-12-08 13:33:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:35,090 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-12-08 13:33:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:35,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 13:33:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:35,097 INFO L225 Difference]: With dead ends: 3724 [2018-12-08 13:33:35,097 INFO L226 Difference]: Without dead ends: 3722 [2018-12-08 13:33:35,098 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 13:33:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-12-08 13:33:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-12-08 13:33:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-12-08 13:33:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-12-08 13:33:35,145 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-12-08 13:33:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:35,146 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-12-08 13:33:35,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-12-08 13:33:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 13:33:35,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:35,148 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 13:33:35,148 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:35,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:35,148 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-12-08 13:33:35,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:35,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:35,156 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 13:33:35,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:35,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:35,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:35,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:35,157 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-12-08 13:33:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:35,207 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-12-08 13:33:35,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:35,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 13:33:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:35,213 INFO L225 Difference]: With dead ends: 7116 [2018-12-08 13:33:35,213 INFO L226 Difference]: Without dead ends: 4106 [2018-12-08 13:33:35,216 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 13:33:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-08 13:33:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-12-08 13:33:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-12-08 13:33:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-12-08 13:33:35,282 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-12-08 13:33:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:35,282 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-12-08 13:33:35,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-12-08 13:33:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 13:33:35,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:35,284 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 13:33:35,284 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:35,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-12-08 13:33:35,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:35,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:35,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:35,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:33:35,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:35,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:35,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:35,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:35,299 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-12-08 13:33:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:35,369 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-12-08 13:33:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:35,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 13:33:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:35,380 INFO L225 Difference]: With dead ends: 6156 [2018-12-08 13:33:35,381 INFO L226 Difference]: Without dead ends: 4170 [2018-12-08 13:33:35,384 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 13:33:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-12-08 13:33:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-12-08 13:33:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-12-08 13:33:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-12-08 13:33:35,463 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-12-08 13:33:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:35,463 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-12-08 13:33:35,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-12-08 13:33:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 13:33:35,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:35,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:35,466 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:35,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-12-08 13:33:35,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:35,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:35,477 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 13:33:35,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:35,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:35,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:35,478 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-12-08 13:33:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:35,582 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-12-08 13:33:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:35,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 13:33:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:35,595 INFO L225 Difference]: With dead ends: 12108 [2018-12-08 13:33:35,595 INFO L226 Difference]: Without dead ends: 8074 [2018-12-08 13:33:35,601 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 13:33:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-12-08 13:33:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-12-08 13:33:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-12-08 13:33:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-12-08 13:33:35,758 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-12-08 13:33:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:35,758 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-12-08 13:33:35,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-12-08 13:33:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 13:33:35,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:35,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:33:35,763 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:35,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-12-08 13:33:35,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:35,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:35,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:35,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:35,775 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 13:33:35,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:35,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:35,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:35,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:35,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:35,776 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-12-08 13:33:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:35,912 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-12-08 13:33:35,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:35,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 13:33:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:35,923 INFO L225 Difference]: With dead ends: 9100 [2018-12-08 13:33:35,923 INFO L226 Difference]: Without dead ends: 9098 [2018-12-08 13:33:35,927 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 13:33:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-12-08 13:33:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-12-08 13:33:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-12-08 13:33:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-12-08 13:33:36,073 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-12-08 13:33:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:36,074 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-12-08 13:33:36,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-12-08 13:33:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 13:33:36,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:36,078 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 13:33:36,079 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:36,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-12-08 13:33:36,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:36,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:36,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:36,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:36,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:36,093 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 13:33:36,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:36,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:36,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:36,094 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-12-08 13:33:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:36,239 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-12-08 13:33:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:36,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 13:33:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:36,254 INFO L225 Difference]: With dead ends: 13708 [2018-12-08 13:33:36,254 INFO L226 Difference]: Without dead ends: 13706 [2018-12-08 13:33:36,257 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 13:33:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-12-08 13:33:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-12-08 13:33:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-12-08 13:33:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-12-08 13:33:36,410 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-12-08 13:33:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:36,410 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-12-08 13:33:36,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-12-08 13:33:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 13:33:36,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:36,417 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 13:33:36,418 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:36,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-12-08 13:33:36,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:36,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:36,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:36,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:36,429 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 13:33:36,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:36,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:36,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:36,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:36,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:36,430 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2018-12-08 13:33:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:36,607 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2018-12-08 13:33:36,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:36,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 13:33:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:36,623 INFO L225 Difference]: With dead ends: 27788 [2018-12-08 13:33:36,624 INFO L226 Difference]: Without dead ends: 15754 [2018-12-08 13:33:36,636 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 13:33:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2018-12-08 13:33:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2018-12-08 13:33:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-12-08 13:33:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2018-12-08 13:33:36,887 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2018-12-08 13:33:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:36,888 INFO L480 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2018-12-08 13:33:36,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2018-12-08 13:33:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 13:33:36,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:36,896 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 13:33:36,897 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:36,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2018-12-08 13:33:36,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:36,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:36,905 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 13:33:36,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:36,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:36,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:36,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:36,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:36,906 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2018-12-08 13:33:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:37,032 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2018-12-08 13:33:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:37,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 13:33:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:37,048 INFO L225 Difference]: With dead ends: 23820 [2018-12-08 13:33:37,048 INFO L226 Difference]: Without dead ends: 16138 [2018-12-08 13:33:37,057 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 13:33:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2018-12-08 13:33:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2018-12-08 13:33:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2018-12-08 13:33:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2018-12-08 13:33:37,257 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2018-12-08 13:33:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:37,258 INFO L480 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2018-12-08 13:33:37,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2018-12-08 13:33:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 13:33:37,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:37,266 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 13:33:37,266 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:37,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:37,266 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2018-12-08 13:33:37,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:37,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:37,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:37,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:37,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:37,275 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 13:33:37,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:37,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:37,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:37,276 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2018-12-08 13:33:37,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:37,496 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2018-12-08 13:33:37,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:37,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 13:33:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:37,520 INFO L225 Difference]: With dead ends: 26636 [2018-12-08 13:33:37,520 INFO L226 Difference]: Without dead ends: 26634 [2018-12-08 13:33:37,524 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 13:33:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2018-12-08 13:33:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2018-12-08 13:33:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2018-12-08 13:33:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2018-12-08 13:33:37,792 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2018-12-08 13:33:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:37,793 INFO L480 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2018-12-08 13:33:37,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2018-12-08 13:33:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 13:33:37,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:37,806 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 13:33:37,806 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:37,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:37,806 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2018-12-08 13:33:37,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:37,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:37,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:37,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:37,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:33:37,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:37,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:37,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:37,830 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2018-12-08 13:33:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:38,108 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2018-12-08 13:33:38,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:38,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 13:33:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:38,137 INFO L225 Difference]: With dead ends: 55308 [2018-12-08 13:33:38,137 INFO L226 Difference]: Without dead ends: 31242 [2018-12-08 13:33:38,162 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 13:33:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2018-12-08 13:33:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2018-12-08 13:33:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2018-12-08 13:33:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2018-12-08 13:33:38,594 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2018-12-08 13:33:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:38,594 INFO L480 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2018-12-08 13:33:38,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2018-12-08 13:33:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 13:33:38,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:38,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, 1] [2018-12-08 13:33:38,605 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:38,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:38,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2018-12-08 13:33:38,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:38,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:38,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:38,626 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 13:33:38,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:38,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:38,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:38,626 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2018-12-08 13:33:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:38,891 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2018-12-08 13:33:38,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:38,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 13:33:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:38,915 INFO L225 Difference]: With dead ends: 46860 [2018-12-08 13:33:38,916 INFO L226 Difference]: Without dead ends: 31754 [2018-12-08 13:33:38,929 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 13:33:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2018-12-08 13:33:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2018-12-08 13:33:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2018-12-08 13:33:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2018-12-08 13:33:39,391 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2018-12-08 13:33:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:39,391 INFO L480 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2018-12-08 13:33:39,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2018-12-08 13:33:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 13:33:39,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:39,401 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 13:33:39,401 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:39,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2018-12-08 13:33:39,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:39,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:39,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:39,425 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 13:33:39,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:39,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:39,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:39,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:39,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:39,426 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2018-12-08 13:33:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:39,862 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2018-12-08 13:33:39,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:39,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 13:33:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:39,896 INFO L225 Difference]: With dead ends: 51210 [2018-12-08 13:33:39,896 INFO L226 Difference]: Without dead ends: 51208 [2018-12-08 13:33:39,906 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 13:33:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2018-12-08 13:33:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2018-12-08 13:33:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2018-12-08 13:33:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2018-12-08 13:33:40,556 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2018-12-08 13:33:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:40,556 INFO L480 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2018-12-08 13:33:40,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2018-12-08 13:33:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 13:33:40,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:33:40,576 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 13:33:40,576 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:33:40,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:33:40,576 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2018-12-08 13:33:40,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:33:40,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:33:40,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:40,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:33:40,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:33:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:33:40,599 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 13:33:40,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:33:40,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:33:40,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:33:40,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:33:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:33:40,599 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2018-12-08 13:33:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:33:41,164 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2018-12-08 13:33:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:33:41,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 13:33:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:33:41,165 INFO L225 Difference]: With dead ends: 109576 [2018-12-08 13:33:41,165 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 13:33:41,215 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 13:33:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 13:33:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 13:33:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 13:33:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 13:33:41,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-08 13:33:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:33:41,216 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:33:41,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:33:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 13:33:41,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 13:33:41,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 13:33:41,238 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 13:33:41,238 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 13:33:41,238 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 13:33:41,238 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 13:33:41,238 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 13:33:41,238 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 13:33:41,238 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-08 13:33:41,239 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-08 13:33:41,240 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-12-08 13:33:41,241 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-12-08 13:33:41,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 01:33:41 BoogieIcfgContainer [2018-12-08 13:33:41,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 13:33:41,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 13:33:41,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 13:33:41,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 13:33:41,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:33:33" (3/4) ... [2018-12-08 13:33:41,251 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 13:33:41,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 13:33:41,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 13:33:41,262 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-08 13:33:41,262 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 13:33:41,262 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 13:33:41,306 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fb88c2b7-de8f-41c8-8ea3-8009921fe83c/bin-2019/uautomizer/witness.graphml [2018-12-08 13:33:41,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 13:33:41,307 INFO L168 Benchmark]: Toolchain (without parser) took 7860.16 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 811.6 MB). Free memory was 954.9 MB in the beginning and 894.2 MB in the end (delta: 60.8 MB). Peak memory consumption was 872.4 MB. Max. memory is 11.5 GB. [2018-12-08 13:33:41,308 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:33:41,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.09 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 13:33:41,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.08 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 13:33:41,308 INFO L168 Benchmark]: Boogie Preprocessor took 45.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-08 13:33:41,309 INFO L168 Benchmark]: RCFGBuilder took 191.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-08 13:33:41,309 INFO L168 Benchmark]: TraceAbstraction took 7415.99 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 684.7 MB). Free memory was 1.1 GB in the beginning and 894.2 MB in the end (delta: 202.1 MB). Peak memory consumption was 886.8 MB. Max. memory is 11.5 GB. [2018-12-08 13:33:41,309 INFO L168 Benchmark]: Witness Printer took 58.67 ms. Allocated memory is still 1.8 GB. Free memory is still 894.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:33:41,310 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.09 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 12.08 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 45.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 191.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7415.99 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 684.7 MB). Free memory was 1.1 GB in the beginning and 894.2 MB in the end (delta: 202.1 MB). Peak memory consumption was 886.8 MB. Max. memory is 11.5 GB. * Witness Printer took 58.67 ms. Allocated memory is still 1.8 GB. Free memory is still 894.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. SAFE Result, 7.3s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 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.3s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...