./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/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 0f7b0b589689413087c164ce10eb80c902ee4046 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:00:53,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:00:53,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:00:53,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:00:53,088 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:00:53,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:00:53,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:00:53,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:00:53,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:00:53,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:00:53,093 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:00:53,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:00:53,094 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:00:53,095 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:00:53,096 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:00:53,096 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:00:53,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:00:53,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:00:53,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:00:53,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:00:53,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:00:53,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:00:53,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:00:53,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:00:53,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:00:53,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:00:53,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:00:53,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:00:53,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:00:53,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:00:53,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:00:53,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:00:53,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:00:53,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:00:53,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:00:53,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:00:53,111 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 07:00:53,122 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:00:53,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:00:53,123 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:00:53,123 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:00:53,123 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:00:53,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:00:53,123 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:00:53,124 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:00:53,124 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:00:53,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:00:53,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:00:53,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:00:53,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:00:53,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:00:53,124 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:00:53,124 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:00:53,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:00:53,125 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:00:53,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:00:53,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:00:53,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:00:53,125 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:00:53,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:00:53,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:00:53,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:00:53,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:00:53,126 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:00:53,126 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:00:53,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:00:53,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:00:53,126 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_a0ea1b89-ec1b-4940-a053-015e98c0835f/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-11-23 07:00:53,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:00:53,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:00:53,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:00:53,162 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:00:53,162 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:00:53,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 07:00:53,205 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/data/fb2fc946b/1ce287ac7854471b86f8fde3787dfa0b/FLAG159ab384f [2018-11-23 07:00:53,561 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:00:53,561 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 07:00:53,568 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/data/fb2fc946b/1ce287ac7854471b86f8fde3787dfa0b/FLAG159ab384f [2018-11-23 07:00:53,987 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/data/fb2fc946b/1ce287ac7854471b86f8fde3787dfa0b [2018-11-23 07:00:53,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:00:53,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:00:53,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:00:53,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:00:53,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:00:53,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:00:53" (1/1) ... [2018-11-23 07:00:53,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:53, skipping insertion in model container [2018-11-23 07:00:53,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:00:53" (1/1) ... [2018-11-23 07:00:54,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:00:54,027 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:00:54,156 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:00:54,158 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:00:54,177 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:00:54,187 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:00:54,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54 WrapperNode [2018-11-23 07:00:54,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:00:54,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:00:54,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:00:54,189 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:00:54,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:00:54,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:00:54,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:00:54,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:00:54,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... [2018-11-23 07:00:54,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:00:54,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:00:54,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:00:54,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:00:54,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:00:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:00:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:00:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:00:54,510 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:00:54,510 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 07:00:54,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:00:54 BoogieIcfgContainer [2018-11-23 07:00:54,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:00:54,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:00:54,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:00:54,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:00:54,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:00:53" (1/3) ... [2018-11-23 07:00:54,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287919b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:00:54, skipping insertion in model container [2018-11-23 07:00:54,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:54" (2/3) ... [2018-11-23 07:00:54,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287919b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:00:54, skipping insertion in model container [2018-11-23 07:00:54,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:00:54" (3/3) ... [2018-11-23 07:00:54,517 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 07:00:54,524 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:00:54,529 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 07:00:54,539 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 07:00:54,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:00:54,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:00:54,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:00:54,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:00:54,560 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:00:54,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:00:54,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:00:54,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:00:54,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:00:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 07:00:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:00:54,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:54,580 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] [2018-11-23 07:00:54,581 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:54,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:54,585 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-11-23 07:00:54,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:54,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:54,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:54,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:54,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:54,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:54,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:54,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:54,742 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-11-23 07:00:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:54,781 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-11-23 07:00:54,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:54,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 07:00:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:54,791 INFO L225 Difference]: With dead ends: 87 [2018-11-23 07:00:54,791 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 07:00:54,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 07:00:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-11-23 07:00:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 07:00:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-11-23 07:00:54,823 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-11-23 07:00:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:54,823 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-11-23 07:00:54,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-11-23 07:00:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:00:54,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:54,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:54,825 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:54,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:54,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-11-23 07:00:54,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:54,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:54,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:54,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:54,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:54,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:54,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:54,872 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-11-23 07:00:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:54,903 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-11-23 07:00:54,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:54,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 07:00:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:54,905 INFO L225 Difference]: With dead ends: 117 [2018-11-23 07:00:54,906 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 07:00:54,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-11-23 07:00:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 07:00:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-23 07:00:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 07:00:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-11-23 07:00:54,914 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-11-23 07:00:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:54,915 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-11-23 07:00:54,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-11-23 07:00:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 07:00:54,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:54,916 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-11-23 07:00:54,916 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:54,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-11-23 07:00:54,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:54,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:54,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:54,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:54,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:54,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:54,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:54,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:54,959 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-11-23 07:00:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:54,975 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-11-23 07:00:54,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:54,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 07:00:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:54,977 INFO L225 Difference]: With dead ends: 108 [2018-11-23 07:00:54,977 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 07:00:54,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 07:00:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-23 07:00:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 07:00:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-11-23 07:00:54,982 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-11-23 07:00:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:54,983 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-11-23 07:00:54,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-11-23 07:00:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 07:00:54,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:54,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:54,984 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:54,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-11-23 07:00:54,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:54,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:54,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:54,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,030 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-11-23 07:00:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,043 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-11-23 07:00:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 07:00:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,045 INFO L225 Difference]: With dead ends: 136 [2018-11-23 07:00:55,045 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 07:00:55,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 07:00:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-11-23 07:00:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 07:00:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-11-23 07:00:55,053 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-11-23 07:00:55,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,053 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-11-23 07:00:55,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-11-23 07:00:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 07:00:55,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,055 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,055 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-11-23 07:00:55,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,084 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-11-23 07:00:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,105 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-11-23 07:00:55,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 07:00:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,106 INFO L225 Difference]: With dead ends: 224 [2018-11-23 07:00:55,107 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 07:00:55,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 07:00:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-23 07:00:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 07:00:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-11-23 07:00:55,117 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-11-23 07:00:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,117 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-11-23 07:00:55,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-11-23 07:00:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 07:00:55,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,119 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-11-23 07:00:55,119 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-11-23 07:00:55,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,155 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-11-23 07:00:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,170 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-11-23 07:00:55,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 07:00:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,172 INFO L225 Difference]: With dead ends: 201 [2018-11-23 07:00:55,172 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 07:00:55,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 07:00:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-23 07:00:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 07:00:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-11-23 07:00:55,181 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-11-23 07:00:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,182 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-11-23 07:00:55,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-11-23 07:00:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 07:00:55,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,183 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-11-23 07:00:55,183 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-11-23 07:00:55,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,223 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-11-23 07:00:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,248 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-11-23 07:00:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 07:00:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,255 INFO L225 Difference]: With dead ends: 252 [2018-11-23 07:00:55,255 INFO L226 Difference]: Without dead ends: 250 [2018-11-23 07:00:55,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-23 07:00:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-11-23 07:00:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 07:00:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-11-23 07:00:55,267 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-11-23 07:00:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,268 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-11-23 07:00:55,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-11-23 07:00:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 07:00:55,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,271 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-11-23 07:00:55,271 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-11-23 07:00:55,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,297 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-11-23 07:00:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,326 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-11-23 07:00:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 07:00:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,328 INFO L225 Difference]: With dead ends: 432 [2018-11-23 07:00:55,328 INFO L226 Difference]: Without dead ends: 258 [2018-11-23 07:00:55,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-23 07:00:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-23 07:00:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 07:00:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-11-23 07:00:55,342 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-11-23 07:00:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,342 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-11-23 07:00:55,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-11-23 07:00:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 07:00:55,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,343 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-11-23 07:00:55,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,363 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-11-23 07:00:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,381 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-11-23 07:00:55,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 07:00:55,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,384 INFO L225 Difference]: With dead ends: 384 [2018-11-23 07:00:55,385 INFO L226 Difference]: Without dead ends: 262 [2018-11-23 07:00:55,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-23 07:00:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-23 07:00:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-23 07:00:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-11-23 07:00:55,399 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-11-23 07:00:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,399 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-11-23 07:00:55,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-11-23 07:00:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 07:00:55,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,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] [2018-11-23 07:00:55,401 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-11-23 07:00:55,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,434 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-11-23 07:00:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,454 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-11-23 07:00:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 07:00:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,457 INFO L225 Difference]: With dead ends: 476 [2018-11-23 07:00:55,457 INFO L226 Difference]: Without dead ends: 474 [2018-11-23 07:00:55,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-11-23 07:00:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-11-23 07:00:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-23 07:00:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-11-23 07:00:55,470 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-11-23 07:00:55,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,470 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-11-23 07:00:55,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-11-23 07:00:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 07:00:55,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,472 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-11-23 07:00:55,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,504 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-11-23 07:00:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,527 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-11-23 07:00:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 07:00:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,529 INFO L225 Difference]: With dead ends: 844 [2018-11-23 07:00:55,529 INFO L226 Difference]: Without dead ends: 498 [2018-11-23 07:00:55,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-23 07:00:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-11-23 07:00:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-11-23 07:00:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-11-23 07:00:55,547 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-11-23 07:00:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,547 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-11-23 07:00:55,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-11-23 07:00:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:00:55,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,549 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-11-23 07:00:55,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,587 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-11-23 07:00:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,601 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-11-23 07:00:55,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 07:00:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,603 INFO L225 Difference]: With dead ends: 744 [2018-11-23 07:00:55,603 INFO L226 Difference]: Without dead ends: 506 [2018-11-23 07:00:55,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-11-23 07:00:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-11-23 07:00:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-23 07:00:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-11-23 07:00:55,617 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-11-23 07:00:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,618 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-11-23 07:00:55,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-11-23 07:00:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:00:55,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,619 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-11-23 07:00:55,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,643 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-11-23 07:00:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,662 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-11-23 07:00:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 07:00:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,665 INFO L225 Difference]: With dead ends: 908 [2018-11-23 07:00:55,665 INFO L226 Difference]: Without dead ends: 906 [2018-11-23 07:00:55,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-23 07:00:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-11-23 07:00:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-11-23 07:00:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-11-23 07:00:55,682 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-11-23 07:00:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,682 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-11-23 07:00:55,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-11-23 07:00:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:00:55,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,684 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-11-23 07:00:55,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,707 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-11-23 07:00:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,736 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-11-23 07:00:55,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 07:00:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,739 INFO L225 Difference]: With dead ends: 1660 [2018-11-23 07:00:55,739 INFO L226 Difference]: Without dead ends: 970 [2018-11-23 07:00:55,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-11-23 07:00:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-11-23 07:00:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-23 07:00:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-11-23 07:00:55,764 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-11-23 07:00:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,764 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-11-23 07:00:55,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-11-23 07:00:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:00:55,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,766 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-11-23 07:00:55,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,791 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-11-23 07:00:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,814 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-11-23 07:00:55,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 07:00:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,817 INFO L225 Difference]: With dead ends: 1452 [2018-11-23 07:00:55,817 INFO L226 Difference]: Without dead ends: 986 [2018-11-23 07:00:55,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-23 07:00:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-11-23 07:00:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-23 07:00:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-11-23 07:00:55,842 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-11-23 07:00:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,842 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-11-23 07:00:55,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-11-23 07:00:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:00:55,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,844 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-11-23 07:00:55,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,867 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-11-23 07:00:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:55,899 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-11-23 07:00:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:55,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 07:00:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:55,903 INFO L225 Difference]: With dead ends: 1740 [2018-11-23 07:00:55,903 INFO L226 Difference]: Without dead ends: 1738 [2018-11-23 07:00:55,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-23 07:00:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-11-23 07:00:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-11-23 07:00:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-11-23 07:00:55,937 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-11-23 07:00:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:55,938 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-11-23 07:00:55,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-11-23 07:00:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:00:55,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:55,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:55,940 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:55,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:55,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-11-23 07:00:55,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:55,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:55,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:55,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:55,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:55,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:55,975 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-11-23 07:00:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:56,017 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-11-23 07:00:56,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:56,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 07:00:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:56,022 INFO L225 Difference]: With dead ends: 3276 [2018-11-23 07:00:56,022 INFO L226 Difference]: Without dead ends: 1898 [2018-11-23 07:00:56,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-11-23 07:00:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-11-23 07:00:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-11-23 07:00:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-11-23 07:00:56,080 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-11-23 07:00:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:56,081 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-11-23 07:00:56,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-11-23 07:00:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:00:56,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:56,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:56,083 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:56,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:56,083 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-11-23 07:00:56,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:56,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:56,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:56,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:56,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:56,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:56,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:56,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:56,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,104 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-11-23 07:00:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:56,142 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-11-23 07:00:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:56,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 07:00:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:56,147 INFO L225 Difference]: With dead ends: 2844 [2018-11-23 07:00:56,147 INFO L226 Difference]: Without dead ends: 1930 [2018-11-23 07:00:56,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-23 07:00:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-11-23 07:00:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-23 07:00:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-11-23 07:00:56,187 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-11-23 07:00:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:56,187 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-11-23 07:00:56,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-11-23 07:00:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:00:56,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:56,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:56,190 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:56,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-11-23 07:00:56,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:56,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:56,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:56,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:56,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,206 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-11-23 07:00:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:56,253 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-11-23 07:00:56,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:56,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 07:00:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:56,259 INFO L225 Difference]: With dead ends: 3340 [2018-11-23 07:00:56,260 INFO L226 Difference]: Without dead ends: 3338 [2018-11-23 07:00:56,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-23 07:00:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-11-23 07:00:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-11-23 07:00:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-11-23 07:00:56,320 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-11-23 07:00:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:56,320 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-11-23 07:00:56,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-11-23 07:00:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:00:56,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:56,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:56,324 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:56,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-11-23 07:00:56,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:56,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:56,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:56,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,350 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-11-23 07:00:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:56,417 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-11-23 07:00:56,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:56,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 07:00:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:56,425 INFO L225 Difference]: With dead ends: 6476 [2018-11-23 07:00:56,425 INFO L226 Difference]: Without dead ends: 3722 [2018-11-23 07:00:56,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-23 07:00:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-11-23 07:00:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-11-23 07:00:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-11-23 07:00:56,515 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-11-23 07:00:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:56,516 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-11-23 07:00:56,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-11-23 07:00:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 07:00:56,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:56,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:56,519 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:56,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-11-23 07:00:56,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:56,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:56,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:56,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:56,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:56,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:56,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:56,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:56,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,543 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-11-23 07:00:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:56,603 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-11-23 07:00:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:56,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 07:00:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:56,611 INFO L225 Difference]: With dead ends: 5580 [2018-11-23 07:00:56,611 INFO L226 Difference]: Without dead ends: 3786 [2018-11-23 07:00:56,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-11-23 07:00:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-11-23 07:00:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-11-23 07:00:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-11-23 07:00:56,702 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-11-23 07:00:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:56,702 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-11-23 07:00:56,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-11-23 07:00:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 07:00:56,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:56,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:56,706 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:56,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-11-23 07:00:56,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:56,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:56,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:56,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:56,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,727 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-11-23 07:00:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:56,831 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-11-23 07:00:56,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:56,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 07:00:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:56,853 INFO L225 Difference]: With dead ends: 10956 [2018-11-23 07:00:56,853 INFO L226 Difference]: Without dead ends: 7306 [2018-11-23 07:00:56,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-11-23 07:00:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-11-23 07:00:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-23 07:00:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-11-23 07:00:57,026 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-11-23 07:00:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:57,026 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-11-23 07:00:57,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-11-23 07:00:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 07:00:57,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:57,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:57,031 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:57,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-11-23 07:00:57,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:57,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:57,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:57,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:57,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:57,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:57,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:57,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:57,055 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-11-23 07:00:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:57,161 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-11-23 07:00:57,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:57,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 07:00:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:57,174 INFO L225 Difference]: With dead ends: 8076 [2018-11-23 07:00:57,174 INFO L226 Difference]: Without dead ends: 8074 [2018-11-23 07:00:57,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-23 07:00:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-11-23 07:00:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-23 07:00:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-11-23 07:00:57,322 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-11-23 07:00:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:57,322 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-11-23 07:00:57,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-11-23 07:00:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 07:00:57,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:57,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:57,327 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:57,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-11-23 07:00:57,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:57,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:57,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:57,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:57,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:57,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:57,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:57,351 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-11-23 07:00:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:57,521 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-11-23 07:00:57,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:57,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 07:00:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:57,534 INFO L225 Difference]: With dead ends: 12172 [2018-11-23 07:00:57,534 INFO L226 Difference]: Without dead ends: 12170 [2018-11-23 07:00:57,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-11-23 07:00:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-23 07:00:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-11-23 07:00:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 07:00:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-11-23 07:00:57,721 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-11-23 07:00:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:57,722 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-11-23 07:00:57,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-11-23 07:00:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 07:00:57,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:57,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:57,731 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:57,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:57,732 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-11-23 07:00:57,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:57,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:57,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:57,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:57,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:57,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:57,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:57,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:57,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:57,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:57,754 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-11-23 07:00:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:57,933 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-11-23 07:00:57,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:57,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 07:00:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:57,951 INFO L225 Difference]: With dead ends: 25228 [2018-11-23 07:00:57,951 INFO L226 Difference]: Without dead ends: 14218 [2018-11-23 07:00:57,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-11-23 07:00:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-11-23 07:00:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-23 07:00:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2018-11-23 07:00:58,399 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2018-11-23 07:00:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:58,399 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2018-11-23 07:00:58,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2018-11-23 07:00:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 07:00:58,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:58,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:58,414 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:58,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2018-11-23 07:00:58,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:58,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:58,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:58,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:58,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:58,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:58,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:58,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:58,438 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2018-11-23 07:00:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:58,666 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2018-11-23 07:00:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:58,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 07:00:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:58,689 INFO L225 Difference]: With dead ends: 21516 [2018-11-23 07:00:58,689 INFO L226 Difference]: Without dead ends: 14602 [2018-11-23 07:00:58,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-11-23 07:00:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2018-11-23 07:00:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2018-11-23 07:00:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2018-11-23 07:00:59,079 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2018-11-23 07:00:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:59,080 INFO L480 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2018-11-23 07:00:59,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2018-11-23 07:00:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 07:00:59,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:59,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:59,098 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:59,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2018-11-23 07:00:59,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:59,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:59,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:59,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:59,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:59,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:59,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:59,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:59,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:59,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:59,123 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2018-11-23 07:00:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:59,493 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2018-11-23 07:00:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:59,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 07:00:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:59,529 INFO L225 Difference]: With dead ends: 23562 [2018-11-23 07:00:59,529 INFO L226 Difference]: Without dead ends: 23560 [2018-11-23 07:00:59,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2018-11-23 07:00:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2018-11-23 07:00:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2018-11-23 07:00:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2018-11-23 07:00:59,873 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2018-11-23 07:00:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:59,873 INFO L480 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2018-11-23 07:00:59,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2018-11-23 07:00:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 07:00:59,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:59,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] [2018-11-23 07:00:59,897 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:00:59,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:59,897 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2018-11-23 07:00:59,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:00:59,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:00:59,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:59,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:59,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:59,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:59,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:00:59,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:59,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:59,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:59,927 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2018-11-23 07:01:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:00,296 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2018-11-23 07:01:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:01:00,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 07:01:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:00,297 INFO L225 Difference]: With dead ends: 50184 [2018-11-23 07:01:00,298 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 07:01:00,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:01:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 07:01:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 07:01:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 07:01:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 07:01:00,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-23 07:01:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:00,342 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:01:00,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:01:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:01:00,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 07:01:00,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 07:01:00,363 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 07:01:00,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:01:00,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:01:00,363 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 07:01:00,363 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-23 07:01:00,364 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,365 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,366 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,366 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-11-23 07:01:00,366 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-11-23 07:01:00,366 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-23 07:01:00,366 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-11-23 07:01:00,366 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-23 07:01:00,366 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-11-23 07:01:00,366 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,367 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-23 07:01:00,368 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-23 07:01:00,368 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,368 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-11-23 07:01:00,368 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-11-23 07:01:00,368 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-23 07:01:00,368 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-11-23 07:01:00,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:01:00 BoogieIcfgContainer [2018-11-23 07:01:00,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:01:00,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:01:00,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:01:00,375 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:01:00,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:00:54" (3/4) ... [2018-11-23 07:01:00,379 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 07:01:00,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 07:01:00,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 07:01:00,392 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 07:01:00,392 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 07:01:00,392 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 07:01:00,449 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0ea1b89-ec1b-4940-a053-015e98c0835f/bin-2019/uautomizer/witness.graphml [2018-11-23 07:01:00,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:01:00,450 INFO L168 Benchmark]: Toolchain (without parser) took 6460.89 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 561.5 MB). Free memory was 959.3 MB in the beginning and 1.3 GB in the end (delta: -336.0 MB). Peak memory consumption was 225.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:00,453 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:01:00,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.36 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:00,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.51 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:01:00,454 INFO L168 Benchmark]: Boogie Preprocessor took 18.56 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:01:00,454 INFO L168 Benchmark]: RCFGBuilder took 287.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:00,454 INFO L168 Benchmark]: TraceAbstraction took 5863.41 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 428.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -202.6 MB). Peak memory consumption was 226.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:00,454 INFO L168 Benchmark]: Witness Printer took 74.81 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:00,456 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.36 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.51 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.56 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 287.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5863.41 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 428.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -202.6 MB). Peak memory consumption was 226.3 MB. Max. memory is 11.5 GB. * Witness Printer took 74.81 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. SAFE Result, 5.8s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, 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: 2.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 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.5s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...