./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:22:56,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:22:56,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:22:56,867 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:22:56,867 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:22:56,868 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:22:56,869 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:22:56,870 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:22:56,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:22:56,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:22:56,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:22:56,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:22:56,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:22:56,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:22:56,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:22:56,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:22:56,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:22:56,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:22:56,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:22:56,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:22:56,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:22:56,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:22:56,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:22:56,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:22:56,884 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:22:56,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:22:56,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:22:56,886 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:22:56,887 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:22:56,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:22:56,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:22:56,889 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:22:56,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:22:56,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:22:56,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:22:56,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:22:56,890 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:22:56,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:22:56,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:22:56,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:22:56,901 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:22:56,901 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:22:56,902 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:22:56,902 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:22:56,902 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:22:56,902 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:22:56,902 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:22:56,902 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:22:56,902 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:22:56,902 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:22:56,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:22:56,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:22:56,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:22:56,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:22:56,904 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:22:56,904 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:22:56,904 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:22:56,904 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:22:56,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:22:56,905 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_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-28 11:22:56,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:22:56,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:22:56,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:22:56,937 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:22:56,937 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:22:56,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:22:56,974 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/data/46b70a699/687c543d34804efcb635406b4140e28c/FLAG457543116 [2018-11-28 11:22:57,279 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:22:57,279 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:22:57,285 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/data/46b70a699/687c543d34804efcb635406b4140e28c/FLAG457543116 [2018-11-28 11:22:57,295 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/data/46b70a699/687c543d34804efcb635406b4140e28c [2018-11-28 11:22:57,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:22:57,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:22:57,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:22:57,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:22:57,301 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:22:57,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589a87e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57, skipping insertion in model container [2018-11-28 11:22:57,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:22:57,322 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:22:57,416 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:22:57,418 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:22:57,434 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:22:57,442 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:22:57,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57 WrapperNode [2018-11-28 11:22:57,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:22:57,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:22:57,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:22:57,443 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:22:57,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:22:57,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:22:57,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:22:57,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:22:57,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... [2018-11-28 11:22:57,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:22:57,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:22:57,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:22:57,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:22:57,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/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-28 11:22:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:22:57,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:22:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:22:57,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:22:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:22:57,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:22:57,780 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:22:57,780 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:22:57,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:57 BoogieIcfgContainer [2018-11-28 11:22:57,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:22:57,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:22:57,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:22:57,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:22:57,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:22:57" (1/3) ... [2018-11-28 11:22:57,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24385fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:22:57, skipping insertion in model container [2018-11-28 11:22:57,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:57" (2/3) ... [2018-11-28 11:22:57,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24385fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:22:57, skipping insertion in model container [2018-11-28 11:22:57,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:57" (3/3) ... [2018-11-28 11:22:57,787 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:22:57,795 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:22:57,801 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:22:57,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:22:57,841 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:22:57,841 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:22:57,842 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:22:57,842 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:22:57,842 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:22:57,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:22:57,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:22:57,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:22:57,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:22:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-28 11:22:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:22:57,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:57,861 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-28 11:22:57,863 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:57,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:57,866 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-11-28 11:22:57,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:57,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:57,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:57,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:57,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,008 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-28 11:22:58,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,022 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-11-28 11:22:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,053 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-11-28 11:22:58,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 11:22:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,061 INFO L225 Difference]: With dead ends: 93 [2018-11-28 11:22:58,061 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 11:22:58,063 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-28 11:22:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 11:22:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-11-28 11:22:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 11:22:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-11-28 11:22:58,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-11-28 11:22:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,088 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-11-28 11:22:58,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-11-28 11:22:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:22:58,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,089 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-28 11:22:58,089 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-11-28 11:22:58,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,134 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-28 11:22:58,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,136 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-11-28 11:22:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,165 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-11-28 11:22:58,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 11:22:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,166 INFO L225 Difference]: With dead ends: 127 [2018-11-28 11:22:58,166 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 11:22:58,167 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-28 11:22:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 11:22:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-28 11:22:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 11:22:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-11-28 11:22:58,173 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-11-28 11:22:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,173 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-11-28 11:22:58,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-11-28 11:22:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:22:58,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,174 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-28 11:22:58,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-11-28 11:22:58,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,211 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-28 11:22:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,212 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-11-28 11:22:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,223 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-11-28 11:22:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 11:22:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,224 INFO L225 Difference]: With dead ends: 117 [2018-11-28 11:22:58,224 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 11:22:58,224 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-28 11:22:58,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 11:22:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-28 11:22:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 11:22:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-11-28 11:22:58,229 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-11-28 11:22:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,229 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-11-28 11:22:58,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-11-28 11:22:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:22:58,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,230 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-28 11:22:58,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-11-28 11:22:58,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,265 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-28 11:22:58,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,266 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-11-28 11:22:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,282 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-11-28 11:22:58,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 11:22:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,284 INFO L225 Difference]: With dead ends: 148 [2018-11-28 11:22:58,284 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 11:22:58,284 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-28 11:22:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 11:22:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-11-28 11:22:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 11:22:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-11-28 11:22:58,294 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-11-28 11:22:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,294 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-11-28 11:22:58,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-11-28 11:22:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:22:58,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,295 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-28 11:22:58,295 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,296 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-11-28 11:22:58,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,328 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-28 11:22:58,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,329 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-11-28 11:22:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,347 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-11-28 11:22:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 11:22:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,349 INFO L225 Difference]: With dead ends: 244 [2018-11-28 11:22:58,349 INFO L226 Difference]: Without dead ends: 148 [2018-11-28 11:22:58,349 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-28 11:22:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-28 11:22:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-28 11:22:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-28 11:22:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-11-28 11:22:58,357 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-11-28 11:22:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,357 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-11-28 11:22:58,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-11-28 11:22:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 11:22:58,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,358 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-28 11:22:58,358 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-11-28 11:22:58,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,382 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-28 11:22:58,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,384 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-11-28 11:22:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,398 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-11-28 11:22:58,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 11:22:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,399 INFO L225 Difference]: With dead ends: 219 [2018-11-28 11:22:58,399 INFO L226 Difference]: Without dead ends: 150 [2018-11-28 11:22:58,399 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-28 11:22:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-28 11:22:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-28 11:22:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-28 11:22:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-11-28 11:22:58,408 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-11-28 11:22:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,409 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-11-28 11:22:58,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-11-28 11:22:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 11:22:58,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,410 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-28 11:22:58,410 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-11-28 11:22:58,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,439 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-28 11:22:58,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,440 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-11-28 11:22:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,461 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-11-28 11:22:58,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 11:22:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,463 INFO L225 Difference]: With dead ends: 276 [2018-11-28 11:22:58,463 INFO L226 Difference]: Without dead ends: 274 [2018-11-28 11:22:58,463 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-28 11:22:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-28 11:22:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-11-28 11:22:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-28 11:22:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-11-28 11:22:58,471 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-11-28 11:22:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,472 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-11-28 11:22:58,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-11-28 11:22:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 11:22:58,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,473 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-28 11:22:58,473 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-11-28 11:22:58,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,494 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-28 11:22:58,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,495 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-11-28 11:22:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,517 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-11-28 11:22:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 11:22:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,519 INFO L225 Difference]: With dead ends: 472 [2018-11-28 11:22:58,519 INFO L226 Difference]: Without dead ends: 282 [2018-11-28 11:22:58,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-28 11:22:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-11-28 11:22:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-28 11:22:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-11-28 11:22:58,529 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-11-28 11:22:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,529 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-11-28 11:22:58,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-11-28 11:22:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:22:58,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,530 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-28 11:22:58,530 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-11-28 11:22:58,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,561 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-28 11:22:58,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,562 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-11-28 11:22:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,577 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-11-28 11:22:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 11:22:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,578 INFO L225 Difference]: With dead ends: 420 [2018-11-28 11:22:58,578 INFO L226 Difference]: Without dead ends: 286 [2018-11-28 11:22:58,578 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-28 11:22:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-28 11:22:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-11-28 11:22:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-28 11:22:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-11-28 11:22:58,588 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-11-28 11:22:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,588 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-11-28 11:22:58,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-11-28 11:22:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:22:58,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,589 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-28 11:22:58,590 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-11-28 11:22:58,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,613 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-28 11:22:58,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,614 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-11-28 11:22:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,646 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-11-28 11:22:58,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 11:22:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,648 INFO L225 Difference]: With dead ends: 524 [2018-11-28 11:22:58,649 INFO L226 Difference]: Without dead ends: 522 [2018-11-28 11:22:58,649 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-28 11:22:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-28 11:22:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-11-28 11:22:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-28 11:22:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-11-28 11:22:58,662 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-11-28 11:22:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,662 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-11-28 11:22:58,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-11-28 11:22:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:22:58,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,664 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-28 11:22:58,664 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-11-28 11:22:58,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,693 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-28 11:22:58,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,694 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-11-28 11:22:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,730 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-11-28 11:22:58,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 11:22:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,732 INFO L225 Difference]: With dead ends: 924 [2018-11-28 11:22:58,732 INFO L226 Difference]: Without dead ends: 546 [2018-11-28 11:22:58,734 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-28 11:22:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-28 11:22:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-11-28 11:22:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-28 11:22:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-11-28 11:22:58,751 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-11-28 11:22:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,751 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-11-28 11:22:58,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-11-28 11:22:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:22:58,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,752 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-28 11:22:58,753 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-11-28 11:22:58,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,773 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-28 11:22:58,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,775 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-11-28 11:22:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,792 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-11-28 11:22:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:22:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,794 INFO L225 Difference]: With dead ends: 816 [2018-11-28 11:22:58,794 INFO L226 Difference]: Without dead ends: 554 [2018-11-28 11:22:58,795 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-28 11:22:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-28 11:22:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-11-28 11:22:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-28 11:22:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-11-28 11:22:58,806 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-11-28 11:22:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,806 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-11-28 11:22:58,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-11-28 11:22:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:22:58,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,807 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-28 11:22:58,807 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-11-28 11:22:58,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,825 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-28 11:22:58,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,826 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-11-28 11:22:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,854 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-11-28 11:22:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:22:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,857 INFO L225 Difference]: With dead ends: 1004 [2018-11-28 11:22:58,857 INFO L226 Difference]: Without dead ends: 1002 [2018-11-28 11:22:58,857 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-28 11:22:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-11-28 11:22:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-11-28 11:22:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-28 11:22:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-11-28 11:22:58,872 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-11-28 11:22:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,872 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-11-28 11:22:58,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-11-28 11:22:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:22:58,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:22:58,873 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-11-28 11:22:58,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,897 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-28 11:22:58,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,898 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-11-28 11:22:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,923 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-11-28 11:22:58,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:22:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,925 INFO L225 Difference]: With dead ends: 1820 [2018-11-28 11:22:58,925 INFO L226 Difference]: Without dead ends: 1066 [2018-11-28 11:22:58,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-11-28 11:22:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-11-28 11:22:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-11-28 11:22:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-11-28 11:22:58,948 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-11-28 11:22:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:58,949 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-11-28 11:22:58,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-11-28 11:22:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:22:58,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:58,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:22:58,950 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:58,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-11-28 11:22:58,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:58,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:58,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:58,963 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-28 11:22:58,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:58,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:58,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:58,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:58,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:58,964 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-11-28 11:22:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:58,986 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-11-28 11:22:58,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:58,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 11:22:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:58,988 INFO L225 Difference]: With dead ends: 1596 [2018-11-28 11:22:58,989 INFO L226 Difference]: Without dead ends: 1082 [2018-11-28 11:22:58,989 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-28 11:22:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-11-28 11:22:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-11-28 11:22:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-11-28 11:22:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-11-28 11:22:59,011 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-11-28 11:22:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:59,011 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-11-28 11:22:59,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-11-28 11:22:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:22:59,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:59,013 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-28 11:22:59,013 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:59,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-11-28 11:22:59,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:59,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:59,037 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-28 11:22:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:59,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:59,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:59,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:59,038 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-11-28 11:22:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:59,067 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-11-28 11:22:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:59,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 11:22:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:59,071 INFO L225 Difference]: With dead ends: 1932 [2018-11-28 11:22:59,071 INFO L226 Difference]: Without dead ends: 1930 [2018-11-28 11:22:59,072 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-28 11:22:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-28 11:22:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-11-28 11:22:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-28 11:22:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-11-28 11:22:59,102 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-11-28 11:22:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:59,102 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-11-28 11:22:59,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-11-28 11:22:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:22:59,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:59,104 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-28 11:22:59,104 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:59,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-11-28 11:22:59,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:59,129 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-28 11:22:59,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:59,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:59,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:59,130 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-11-28 11:22:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:59,161 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-11-28 11:22:59,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:59,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 11:22:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:59,165 INFO L225 Difference]: With dead ends: 3596 [2018-11-28 11:22:59,165 INFO L226 Difference]: Without dead ends: 2090 [2018-11-28 11:22:59,167 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-28 11:22:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-11-28 11:22:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-11-28 11:22:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-11-28 11:22:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-11-28 11:22:59,209 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-11-28 11:22:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:59,209 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-11-28 11:22:59,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-11-28 11:22:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:22:59,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:59,211 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-28 11:22:59,211 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:59,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-11-28 11:22:59,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:59,229 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-28 11:22:59,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:59,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:59,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:59,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:59,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:59,230 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-11-28 11:22:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:59,263 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-11-28 11:22:59,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:59,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 11:22:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:59,267 INFO L225 Difference]: With dead ends: 3132 [2018-11-28 11:22:59,267 INFO L226 Difference]: Without dead ends: 2122 [2018-11-28 11:22:59,269 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-28 11:22:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-28 11:22:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-11-28 11:22:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-11-28 11:22:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-11-28 11:22:59,331 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-11-28 11:22:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:59,331 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-11-28 11:22:59,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-11-28 11:22:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:22:59,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:59,333 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-28 11:22:59,334 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:59,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:59,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-11-28 11:22:59,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:59,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:59,357 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-28 11:22:59,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:59,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:59,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:59,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:59,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:59,358 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-11-28 11:22:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:59,403 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-11-28 11:22:59,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:59,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 11:22:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:59,410 INFO L225 Difference]: With dead ends: 3724 [2018-11-28 11:22:59,410 INFO L226 Difference]: Without dead ends: 3722 [2018-11-28 11:22:59,411 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-28 11:22:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-28 11:22:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-11-28 11:22:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-11-28 11:22:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-11-28 11:22:59,461 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-11-28 11:22:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:59,462 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-11-28 11:22:59,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-11-28 11:22:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:22:59,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:59,464 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-28 11:22:59,465 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:59,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-11-28 11:22:59,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:59,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:59,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:59,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:59,485 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-28 11:22:59,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:59,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:59,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:59,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:59,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:59,486 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-11-28 11:22:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:59,543 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-11-28 11:22:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:59,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 11:22:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:59,551 INFO L225 Difference]: With dead ends: 7116 [2018-11-28 11:22:59,551 INFO L226 Difference]: Without dead ends: 4106 [2018-11-28 11:22:59,554 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-28 11:22:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-28 11:22:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-11-28 11:22:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-28 11:22:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-11-28 11:22:59,625 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-11-28 11:22:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:59,625 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-11-28 11:22:59,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-11-28 11:22:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:22:59,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:59,628 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-28 11:22:59,628 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:59,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-11-28 11:22:59,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:59,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:59,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:59,649 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-28 11:22:59,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:59,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:59,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:59,650 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-11-28 11:22:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:59,703 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-11-28 11:22:59,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:59,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 11:22:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:59,712 INFO L225 Difference]: With dead ends: 6156 [2018-11-28 11:22:59,713 INFO L226 Difference]: Without dead ends: 4170 [2018-11-28 11:22:59,716 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-28 11:22:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-11-28 11:22:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-11-28 11:22:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-11-28 11:22:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-11-28 11:22:59,787 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-11-28 11:22:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:59,787 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-11-28 11:22:59,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-11-28 11:22:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:22:59,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:59,790 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-28 11:22:59,790 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:59,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:59,790 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-11-28 11:22:59,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:59,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:59,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:59,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:59,810 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-28 11:22:59,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:59,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:59,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:59,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:59,810 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-11-28 11:22:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:59,897 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-11-28 11:22:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:59,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 11:22:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:59,910 INFO L225 Difference]: With dead ends: 12108 [2018-11-28 11:22:59,910 INFO L226 Difference]: Without dead ends: 8074 [2018-11-28 11:22:59,914 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-28 11:22:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-28 11:23:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-11-28 11:23:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-28 11:23:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-11-28 11:23:00,057 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-11-28 11:23:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:00,057 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-11-28 11:23:00,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-11-28 11:23:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:23:00,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:00,062 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-28 11:23:00,063 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:00,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-11-28 11:23:00,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:00,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:00,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:00,085 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-28 11:23:00,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:00,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:00,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:00,086 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-11-28 11:23:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:00,201 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-11-28 11:23:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:00,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 11:23:00,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:00,213 INFO L225 Difference]: With dead ends: 9100 [2018-11-28 11:23:00,213 INFO L226 Difference]: Without dead ends: 9098 [2018-11-28 11:23:00,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-11-28 11:23:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-11-28 11:23:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-28 11:23:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-11-28 11:23:00,391 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-11-28 11:23:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:00,391 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-11-28 11:23:00,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-11-28 11:23:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:23:00,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:00,396 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-28 11:23:00,396 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:00,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-11-28 11:23:00,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:00,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:00,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:00,413 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-28 11:23:00,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:00,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:00,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:00,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:00,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:00,414 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-11-28 11:23:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:00,538 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-11-28 11:23:00,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:00,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 11:23:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:00,553 INFO L225 Difference]: With dead ends: 13708 [2018-11-28 11:23:00,553 INFO L226 Difference]: Without dead ends: 13706 [2018-11-28 11:23:00,557 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-28 11:23:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-11-28 11:23:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-11-28 11:23:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-11-28 11:23:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-11-28 11:23:00,714 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-11-28 11:23:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:00,715 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-11-28 11:23:00,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-11-28 11:23:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:23:00,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:00,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:00,723 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:00,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:00,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-11-28 11:23:00,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:00,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:00,745 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-28 11:23:00,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:00,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:00,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:00,746 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2018-11-28 11:23:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:00,909 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2018-11-28 11:23:00,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:00,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 11:23:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:00,925 INFO L225 Difference]: With dead ends: 27788 [2018-11-28 11:23:00,925 INFO L226 Difference]: Without dead ends: 15754 [2018-11-28 11:23:00,937 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-28 11:23:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2018-11-28 11:23:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2018-11-28 11:23:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-11-28 11:23:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2018-11-28 11:23:01,314 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2018-11-28 11:23:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:01,314 INFO L480 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2018-11-28 11:23:01,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2018-11-28 11:23:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:23:01,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:01,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, 1, 1] [2018-11-28 11:23:01,327 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:01,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:01,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2018-11-28 11:23:01,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:01,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:01,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:01,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:01,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:01,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:01,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:01,354 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2018-11-28 11:23:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:01,582 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2018-11-28 11:23:01,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:01,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 11:23:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:01,606 INFO L225 Difference]: With dead ends: 23820 [2018-11-28 11:23:01,607 INFO L226 Difference]: Without dead ends: 16138 [2018-11-28 11:23:01,619 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-28 11:23:01,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2018-11-28 11:23:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2018-11-28 11:23:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2018-11-28 11:23:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2018-11-28 11:23:01,941 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2018-11-28 11:23:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:01,941 INFO L480 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2018-11-28 11:23:01,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2018-11-28 11:23:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:23:01,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:01,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:01,955 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:01,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2018-11-28 11:23:01,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:01,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:01,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:01,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:01,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:01,980 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2018-11-28 11:23:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:02,255 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2018-11-28 11:23:02,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:02,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 11:23:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:02,283 INFO L225 Difference]: With dead ends: 26636 [2018-11-28 11:23:02,283 INFO L226 Difference]: Without dead ends: 26634 [2018-11-28 11:23:02,288 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-28 11:23:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2018-11-28 11:23:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2018-11-28 11:23:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2018-11-28 11:23:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2018-11-28 11:23:02,605 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2018-11-28 11:23:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:02,606 INFO L480 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2018-11-28 11:23:02,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2018-11-28 11:23:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:23:02,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:02,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:02,618 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:02,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:02,619 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2018-11-28 11:23:02,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:02,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:02,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:02,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:02,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:02,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:02,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:02,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:02,655 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2018-11-28 11:23:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:02,970 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2018-11-28 11:23:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:02,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 11:23:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:02,994 INFO L225 Difference]: With dead ends: 55308 [2018-11-28 11:23:02,995 INFO L226 Difference]: Without dead ends: 31242 [2018-11-28 11:23:03,018 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-28 11:23:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2018-11-28 11:23:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2018-11-28 11:23:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2018-11-28 11:23:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2018-11-28 11:23:03,478 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2018-11-28 11:23:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:03,478 INFO L480 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2018-11-28 11:23:03,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2018-11-28 11:23:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 11:23:03,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:03,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:03,489 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:03,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2018-11-28 11:23:03,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:03,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:03,513 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-28 11:23:03,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:03,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:03,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:03,514 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2018-11-28 11:23:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:03,777 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2018-11-28 11:23:03,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:03,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 11:23:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:03,799 INFO L225 Difference]: With dead ends: 46860 [2018-11-28 11:23:03,799 INFO L226 Difference]: Without dead ends: 31754 [2018-11-28 11:23:03,811 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-28 11:23:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2018-11-28 11:23:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2018-11-28 11:23:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2018-11-28 11:23:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2018-11-28 11:23:04,318 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2018-11-28 11:23:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:04,318 INFO L480 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2018-11-28 11:23:04,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2018-11-28 11:23:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 11:23:04,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:04,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, 1, 1, 1] [2018-11-28 11:23:04,328 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:04,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:04,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2018-11-28 11:23:04,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:04,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:04,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:04,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:04,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:04,365 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-28 11:23:04,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:04,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:04,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:04,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:04,366 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2018-11-28 11:23:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:04,822 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2018-11-28 11:23:04,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:04,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 11:23:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:04,856 INFO L225 Difference]: With dead ends: 51210 [2018-11-28 11:23:04,856 INFO L226 Difference]: Without dead ends: 51208 [2018-11-28 11:23:04,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2018-11-28 11:23:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2018-11-28 11:23:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2018-11-28 11:23:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2018-11-28 11:23:05,483 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2018-11-28 11:23:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:05,483 INFO L480 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2018-11-28 11:23:05,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2018-11-28 11:23:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 11:23:05,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:05,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:05,651 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:23:05,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2018-11-28 11:23:05,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:05,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:05,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:05,665 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-28 11:23:05,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:05,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:05,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:05,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:05,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:05,666 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2018-11-28 11:23:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:06,227 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2018-11-28 11:23:06,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:06,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 11:23:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:06,228 INFO L225 Difference]: With dead ends: 109576 [2018-11-28 11:23:06,228 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:23:06,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:23:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:23:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:23:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:23:06,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-28 11:23:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:06,285 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:06,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:23:06,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:23:06,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:23:06,328 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 11:23:06,328 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:23:06,328 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:23:06,328 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 11:23:06,329 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-28 11:23:06,329 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,329 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,330 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,331 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,332 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-28 11:23:06,332 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-28 11:23:06,332 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,332 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 11:23:06,332 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-11-28 11:23:06,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:23:06 BoogieIcfgContainer [2018-11-28 11:23:06,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:23:06,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:23:06,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:23:06,346 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:23:06,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:57" (3/4) ... [2018-11-28 11:23:06,352 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:23:06,357 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:23:06,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:23:06,362 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 11:23:06,362 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 11:23:06,362 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:23:06,411 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a8441916-3736-4e91-abd1-ee4816c39670/bin-2019/uautomizer/witness.graphml [2018-11-28 11:23:06,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:23:06,412 INFO L168 Benchmark]: Toolchain (without parser) took 9115.22 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 933.8 MB). Free memory was 953.3 MB in the beginning and 1.2 GB in the end (delta: -211.4 MB). Peak memory consumption was 722.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:06,414 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:06,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.14 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:06,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.94 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:06,414 INFO L168 Benchmark]: Boogie Preprocessor took 58.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:06,415 INFO L168 Benchmark]: RCFGBuilder took 265.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:06,415 INFO L168 Benchmark]: TraceAbstraction took 8564.92 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 784.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -42.3 MB). Peak memory consumption was 742.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:06,415 INFO L168 Benchmark]: Witness Printer took 65.16 ms. Allocated memory is still 2.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:06,420 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.14 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.94 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 265.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8564.92 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 784.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -42.3 MB). Peak memory consumption was 742.1 MB. Max. memory is 11.5 GB. * Witness Printer took 65.16 ms. Allocated memory is still 2.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. SAFE Result, 8.4s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...