./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7b0b589689413087c164ce10eb80c902ee4046 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:39:02,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:39:02,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:39:02,178 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:39:02,178 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:39:02,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:39:02,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:39:02,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:39:02,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:39:02,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:39:02,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:39:02,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:39:02,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:39:02,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:39:02,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:39:02,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:39:02,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:39:02,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:39:02,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:39:02,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:39:02,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:39:02,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:39:02,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:39:02,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:39:02,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:39:02,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:39:02,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:39:02,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:39:02,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:39:02,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:39:02,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:39:02,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:39:02,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:39:02,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:39:02,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:39:02,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:39:02,199 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:39:02,208 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:39:02,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:39:02,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:39:02,209 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:39:02,209 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:39:02,209 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:39:02,209 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:39:02,209 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:39:02,209 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:39:02,209 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:39:02,209 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:39:02,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:39:02,210 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:39:02,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:39:02,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:39:02,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:39:02,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:39:02,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:39:02,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:39:02,211 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:39:02,211 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:39:02,211 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:39:02,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:39:02,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:39:02,212 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:39:02,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:39:02,212 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:39:02,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:39:02,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:39:02,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:39:02,213 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:39:02,213 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:39:02,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:39:02,213 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:39:02,213 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-11-10 12:39:02,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:39:02,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:39:02,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:39:02,244 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:39:02,244 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:39:02,244 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:39:02,279 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/data/bd5127b74/076ef5be03314d86b2b83d8bf3925895/FLAG42de45e15 [2018-11-10 12:39:02,571 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:39:02,572 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:39:02,576 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/data/bd5127b74/076ef5be03314d86b2b83d8bf3925895/FLAG42de45e15 [2018-11-10 12:39:02,584 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/data/bd5127b74/076ef5be03314d86b2b83d8bf3925895 [2018-11-10 12:39:02,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:39:02,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:39:02,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:39:02,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:39:02,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:39:02,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02, skipping insertion in model container [2018-11-10 12:39:02,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:39:02,611 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:39:02,711 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:39:02,713 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:39:02,728 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:39:02,736 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:39:02,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02 WrapperNode [2018-11-10 12:39:02,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:39:02,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:39:02,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:39:02,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:39:02,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:39:02,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:39:02,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:39:02,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:39:02,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... [2018-11-10 12:39:02,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:39:02,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:39:02,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:39:02,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:39:02,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/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-10 12:39:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:39:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:39:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:39:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:39:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:39:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:39:03,019 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:39:03,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:39:03 BoogieIcfgContainer [2018-11-10 12:39:03,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:39:03,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:39:03,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:39:03,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:39:03,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:39:02" (1/3) ... [2018-11-10 12:39:03,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f15a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:39:03, skipping insertion in model container [2018-11-10 12:39:03,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:02" (2/3) ... [2018-11-10 12:39:03,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f15a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:39:03, skipping insertion in model container [2018-11-10 12:39:03,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:39:03" (3/3) ... [2018-11-10 12:39:03,026 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:39:03,035 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:39:03,043 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:39:03,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:39:03,077 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:39:03,077 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:39:03,078 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:39:03,078 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:39:03,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:39:03,078 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:39:03,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:39:03,078 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:39:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-10 12:39:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:39:03,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,098 INFO L375 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-10 12:39:03,100 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1332805667, now seen corresponding path program 1 times [2018-11-10 12:39:03,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,235 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-10 12:39:03,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,237 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,255 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-11-10 12:39:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,296 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2018-11-10 12:39:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 12:39:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,304 INFO L225 Difference]: With dead ends: 89 [2018-11-10 12:39:03,304 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 12:39:03,307 INFO L605 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-10 12:39:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 12:39:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2018-11-10 12:39:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 12:39:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2018-11-10 12:39:03,331 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2018-11-10 12:39:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,331 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2018-11-10 12:39:03,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2018-11-10 12:39:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:39:03,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,332 INFO L375 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-10 12:39:03,332 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1919611681, now seen corresponding path program 1 times [2018-11-10 12:39:03,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,335 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,367 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-10 12:39:03,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,370 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand 3 states. [2018-11-10 12:39:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,402 INFO L93 Difference]: Finished difference Result 120 states and 215 transitions. [2018-11-10 12:39:03,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 12:39:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,404 INFO L225 Difference]: With dead ends: 120 [2018-11-10 12:39:03,404 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 12:39:03,405 INFO L605 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-10 12:39:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 12:39:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-10 12:39:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:39:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2018-11-10 12:39:03,413 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 21 [2018-11-10 12:39:03,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,413 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2018-11-10 12:39:03,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2018-11-10 12:39:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:39:03,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,415 INFO L375 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-10 12:39:03,415 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1632910664, now seen corresponding path program 1 times [2018-11-10 12:39:03,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,445 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-10 12:39:03,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,446 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,446 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 3 states. [2018-11-10 12:39:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,462 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2018-11-10 12:39:03,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:39:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,464 INFO L225 Difference]: With dead ends: 112 [2018-11-10 12:39:03,464 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 12:39:03,465 INFO L605 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-10 12:39:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 12:39:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-10 12:39:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 12:39:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2018-11-10 12:39:03,473 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 22 [2018-11-10 12:39:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,473 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2018-11-10 12:39:03,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2018-11-10 12:39:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:39:03,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,474 INFO L375 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-10 12:39:03,474 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash 621793414, now seen corresponding path program 1 times [2018-11-10 12:39:03,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,515 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-10 12:39:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,515 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,516 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 3 states. [2018-11-10 12:39:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,527 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2018-11-10 12:39:03,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:39:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,528 INFO L225 Difference]: With dead ends: 141 [2018-11-10 12:39:03,528 INFO L226 Difference]: Without dead ends: 139 [2018-11-10 12:39:03,528 INFO L605 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-10 12:39:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-10 12:39:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-11-10 12:39:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 12:39:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2018-11-10 12:39:03,534 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 22 [2018-11-10 12:39:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,535 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2018-11-10 12:39:03,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2018-11-10 12:39:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:39:03,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,536 INFO L375 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-10 12:39:03,536 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash 34987400, now seen corresponding path program 1 times [2018-11-10 12:39:03,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:39:03,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,563 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,563 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 3 states. [2018-11-10 12:39:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,585 INFO L93 Difference]: Finished difference Result 231 states and 405 transitions. [2018-11-10 12:39:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:39:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,586 INFO L225 Difference]: With dead ends: 231 [2018-11-10 12:39:03,586 INFO L226 Difference]: Without dead ends: 141 [2018-11-10 12:39:03,586 INFO L605 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-10 12:39:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-10 12:39:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-10 12:39:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 12:39:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 239 transitions. [2018-11-10 12:39:03,594 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 239 transitions. Word has length 22 [2018-11-10 12:39:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,594 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 239 transitions. [2018-11-10 12:39:03,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 239 transitions. [2018-11-10 12:39:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:39:03,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,595 INFO L375 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-10 12:39:03,595 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2095940372, now seen corresponding path program 1 times [2018-11-10 12:39:03,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:39:03,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,627 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,627 INFO L87 Difference]: Start difference. First operand 139 states and 239 transitions. Second operand 3 states. [2018-11-10 12:39:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,639 INFO L93 Difference]: Finished difference Result 208 states and 356 transitions. [2018-11-10 12:39:03,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:39:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,640 INFO L225 Difference]: With dead ends: 208 [2018-11-10 12:39:03,640 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 12:39:03,641 INFO L605 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-10 12:39:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 12:39:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-10 12:39:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 12:39:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 239 transitions. [2018-11-10 12:39:03,647 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 239 transitions. Word has length 23 [2018-11-10 12:39:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,647 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 239 transitions. [2018-11-10 12:39:03,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 239 transitions. [2018-11-10 12:39:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:39:03,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,648 INFO L375 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-10 12:39:03,649 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1084823122, now seen corresponding path program 1 times [2018-11-10 12:39:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,672 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-10 12:39:03,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,672 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,673 INFO L87 Difference]: Start difference. First operand 141 states and 239 transitions. Second operand 3 states. [2018-11-10 12:39:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,690 INFO L93 Difference]: Finished difference Result 261 states and 449 transitions. [2018-11-10 12:39:03,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:39:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,691 INFO L225 Difference]: With dead ends: 261 [2018-11-10 12:39:03,692 INFO L226 Difference]: Without dead ends: 259 [2018-11-10 12:39:03,692 INFO L605 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-10 12:39:03,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-10 12:39:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 189. [2018-11-10 12:39:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 12:39:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 319 transitions. [2018-11-10 12:39:03,703 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 319 transitions. Word has length 23 [2018-11-10 12:39:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,703 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 319 transitions. [2018-11-10 12:39:03,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 319 transitions. [2018-11-10 12:39:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:39:03,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,704 INFO L375 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-10 12:39:03,705 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash 498017108, now seen corresponding path program 1 times [2018-11-10 12:39:03,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:39:03,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,731 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,732 INFO L87 Difference]: Start difference. First operand 189 states and 319 transitions. Second operand 3 states. [2018-11-10 12:39:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,767 INFO L93 Difference]: Finished difference Result 445 states and 757 transitions. [2018-11-10 12:39:03,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:39:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,768 INFO L225 Difference]: With dead ends: 445 [2018-11-10 12:39:03,768 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 12:39:03,769 INFO L605 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-10 12:39:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 12:39:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-11-10 12:39:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 12:39:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 443 transitions. [2018-11-10 12:39:03,776 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 443 transitions. Word has length 23 [2018-11-10 12:39:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,776 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 443 transitions. [2018-11-10 12:39:03,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 443 transitions. [2018-11-10 12:39:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:39:03,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,779 INFO L375 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-10 12:39:03,779 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,779 INFO L82 PathProgramCache]: Analyzing trace with hash -730007523, now seen corresponding path program 1 times [2018-11-10 12:39:03,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,780 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:39:03,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,794 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,795 INFO L87 Difference]: Start difference. First operand 265 states and 443 transitions. Second operand 3 states. [2018-11-10 12:39:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,809 INFO L93 Difference]: Finished difference Result 397 states and 661 transitions. [2018-11-10 12:39:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:39:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,810 INFO L225 Difference]: With dead ends: 397 [2018-11-10 12:39:03,810 INFO L226 Difference]: Without dead ends: 271 [2018-11-10 12:39:03,811 INFO L605 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-10 12:39:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-10 12:39:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-11-10 12:39:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-10 12:39:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 443 transitions. [2018-11-10 12:39:03,816 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 443 transitions. Word has length 24 [2018-11-10 12:39:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,817 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 443 transitions. [2018-11-10 12:39:03,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 443 transitions. [2018-11-10 12:39:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:39:03,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,817 INFO L375 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-10 12:39:03,817 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1741124773, now seen corresponding path program 1 times [2018-11-10 12:39:03,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,819 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,839 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-10 12:39:03,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,839 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,840 INFO L87 Difference]: Start difference. First operand 269 states and 443 transitions. Second operand 3 states. [2018-11-10 12:39:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,857 INFO L93 Difference]: Finished difference Result 493 states and 825 transitions. [2018-11-10 12:39:03,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:39:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,859 INFO L225 Difference]: With dead ends: 493 [2018-11-10 12:39:03,859 INFO L226 Difference]: Without dead ends: 491 [2018-11-10 12:39:03,860 INFO L605 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-10 12:39:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-10 12:39:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2018-11-10 12:39:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-10 12:39:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 599 transitions. [2018-11-10 12:39:03,868 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 599 transitions. Word has length 24 [2018-11-10 12:39:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,869 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 599 transitions. [2018-11-10 12:39:03,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 599 transitions. [2018-11-10 12:39:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:39:03,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,871 INFO L375 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-10 12:39:03,871 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1967036509, now seen corresponding path program 1 times [2018-11-10 12:39:03,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,902 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-10 12:39:03,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,902 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,903 INFO L87 Difference]: Start difference. First operand 369 states and 599 transitions. Second operand 3 states. [2018-11-10 12:39:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,926 INFO L93 Difference]: Finished difference Result 869 states and 1417 transitions. [2018-11-10 12:39:03,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:39:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,928 INFO L225 Difference]: With dead ends: 869 [2018-11-10 12:39:03,928 INFO L226 Difference]: Without dead ends: 515 [2018-11-10 12:39:03,929 INFO L605 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-10 12:39:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-10 12:39:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2018-11-10 12:39:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-10 12:39:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 823 transitions. [2018-11-10 12:39:03,940 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 823 transitions. Word has length 24 [2018-11-10 12:39:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:03,940 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 823 transitions. [2018-11-10 12:39:03,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 823 transitions. [2018-11-10 12:39:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:39:03,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:03,942 INFO L375 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-10 12:39:03,942 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:03,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1859921289, now seen corresponding path program 1 times [2018-11-10 12:39:03,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:03,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:03,966 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-10 12:39:03,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:03,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:03,967 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:03,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:03,968 INFO L87 Difference]: Start difference. First operand 513 states and 823 transitions. Second operand 3 states. [2018-11-10 12:39:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:03,992 INFO L93 Difference]: Finished difference Result 769 states and 1229 transitions. [2018-11-10 12:39:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:03,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:39:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:03,995 INFO L225 Difference]: With dead ends: 769 [2018-11-10 12:39:03,995 INFO L226 Difference]: Without dead ends: 523 [2018-11-10 12:39:03,996 INFO L605 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-10 12:39:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-11-10 12:39:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2018-11-10 12:39:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-10 12:39:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 823 transitions. [2018-11-10 12:39:04,012 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 823 transitions. Word has length 25 [2018-11-10 12:39:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:04,013 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 823 transitions. [2018-11-10 12:39:04,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 823 transitions. [2018-11-10 12:39:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:39:04,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:04,014 INFO L375 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-10 12:39:04,014 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:04,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:04,015 INFO L82 PathProgramCache]: Analyzing trace with hash 848804039, now seen corresponding path program 1 times [2018-11-10 12:39:04,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:04,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:04,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:04,032 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-10 12:39:04,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:04,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:04,032 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:04,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:04,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:04,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:04,033 INFO L87 Difference]: Start difference. First operand 521 states and 823 transitions. Second operand 3 states. [2018-11-10 12:39:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:04,061 INFO L93 Difference]: Finished difference Result 1501 states and 2361 transitions. [2018-11-10 12:39:04,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:04,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:39:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:04,065 INFO L225 Difference]: With dead ends: 1501 [2018-11-10 12:39:04,065 INFO L226 Difference]: Without dead ends: 1003 [2018-11-10 12:39:04,066 INFO L605 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-10 12:39:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-10 12:39:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1001. [2018-11-10 12:39:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-10 12:39:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1543 transitions. [2018-11-10 12:39:04,094 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1543 transitions. Word has length 25 [2018-11-10 12:39:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:04,094 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1543 transitions. [2018-11-10 12:39:04,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1543 transitions. [2018-11-10 12:39:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:39:04,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:04,095 INFO L375 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-10 12:39:04,095 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:04,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1435610053, now seen corresponding path program 1 times [2018-11-10 12:39:04,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:04,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:04,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:04,110 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-10 12:39:04,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:04,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:04,110 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:04,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:04,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:04,111 INFO L87 Difference]: Start difference. First operand 1001 states and 1543 transitions. Second operand 3 states. [2018-11-10 12:39:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:04,164 INFO L93 Difference]: Finished difference Result 1213 states and 1913 transitions. [2018-11-10 12:39:04,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:04,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:39:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:04,168 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 12:39:04,168 INFO L226 Difference]: Without dead ends: 1211 [2018-11-10 12:39:04,169 INFO L605 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-10 12:39:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-10 12:39:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1001. [2018-11-10 12:39:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-10 12:39:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1527 transitions. [2018-11-10 12:39:04,198 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1527 transitions. Word has length 25 [2018-11-10 12:39:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:04,199 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1527 transitions. [2018-11-10 12:39:04,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1527 transitions. [2018-11-10 12:39:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:39:04,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:04,200 INFO L375 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-10 12:39:04,200 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:04,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:04,201 INFO L82 PathProgramCache]: Analyzing trace with hash 543336178, now seen corresponding path program 1 times [2018-11-10 12:39:04,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:04,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:04,226 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-10 12:39:04,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:04,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:04,226 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:04,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:04,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:04,227 INFO L87 Difference]: Start difference. First operand 1001 states and 1527 transitions. Second operand 3 states. [2018-11-10 12:39:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:04,262 INFO L93 Difference]: Finished difference Result 1789 states and 2777 transitions. [2018-11-10 12:39:04,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:04,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 12:39:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:04,267 INFO L225 Difference]: With dead ends: 1789 [2018-11-10 12:39:04,267 INFO L226 Difference]: Without dead ends: 1787 [2018-11-10 12:39:04,268 INFO L605 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-10 12:39:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-11-10 12:39:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1433. [2018-11-10 12:39:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-11-10 12:39:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2135 transitions. [2018-11-10 12:39:04,311 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2135 transitions. Word has length 26 [2018-11-10 12:39:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:04,312 INFO L481 AbstractCegarLoop]: Abstraction has 1433 states and 2135 transitions. [2018-11-10 12:39:04,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2135 transitions. [2018-11-10 12:39:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:39:04,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:04,314 INFO L375 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-10 12:39:04,314 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:04,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash -43469836, now seen corresponding path program 1 times [2018-11-10 12:39:04,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:04,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:04,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:04,340 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-10 12:39:04,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:04,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:04,340 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:04,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:04,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:04,341 INFO L87 Difference]: Start difference. First operand 1433 states and 2135 transitions. Second operand 3 states. [2018-11-10 12:39:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:04,400 INFO L93 Difference]: Finished difference Result 3357 states and 5017 transitions. [2018-11-10 12:39:04,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:04,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 12:39:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:04,406 INFO L225 Difference]: With dead ends: 3357 [2018-11-10 12:39:04,406 INFO L226 Difference]: Without dead ends: 1947 [2018-11-10 12:39:04,409 INFO L605 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-10 12:39:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2018-11-10 12:39:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1945. [2018-11-10 12:39:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-10 12:39:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2855 transitions. [2018-11-10 12:39:04,461 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2855 transitions. Word has length 26 [2018-11-10 12:39:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:04,461 INFO L481 AbstractCegarLoop]: Abstraction has 1945 states and 2855 transitions. [2018-11-10 12:39:04,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2855 transitions. [2018-11-10 12:39:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:39:04,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:04,463 INFO L375 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-10 12:39:04,463 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:04,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash -336232580, now seen corresponding path program 1 times [2018-11-10 12:39:04,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:04,486 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-10 12:39:04,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:04,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:04,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:04,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:04,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:04,488 INFO L87 Difference]: Start difference. First operand 1945 states and 2855 transitions. Second operand 3 states. [2018-11-10 12:39:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:04,541 INFO L93 Difference]: Finished difference Result 2941 states and 4313 transitions. [2018-11-10 12:39:04,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:04,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 12:39:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:04,547 INFO L225 Difference]: With dead ends: 2941 [2018-11-10 12:39:04,548 INFO L226 Difference]: Without dead ends: 1995 [2018-11-10 12:39:04,549 INFO L605 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-10 12:39:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-11-10 12:39:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2018-11-10 12:39:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-11-10 12:39:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2887 transitions. [2018-11-10 12:39:04,608 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2887 transitions. Word has length 27 [2018-11-10 12:39:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:04,608 INFO L481 AbstractCegarLoop]: Abstraction has 1993 states and 2887 transitions. [2018-11-10 12:39:04,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2887 transitions. [2018-11-10 12:39:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:39:04,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:04,611 INFO L375 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-10 12:39:04,611 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:04,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1347349830, now seen corresponding path program 1 times [2018-11-10 12:39:04,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:04,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:04,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:04,634 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-10 12:39:04,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:04,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:04,635 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:04,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:04,636 INFO L87 Difference]: Start difference. First operand 1993 states and 2887 transitions. Second operand 3 states. [2018-11-10 12:39:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:04,696 INFO L93 Difference]: Finished difference Result 3469 states and 5097 transitions. [2018-11-10 12:39:04,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:04,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 12:39:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:04,706 INFO L225 Difference]: With dead ends: 3469 [2018-11-10 12:39:04,706 INFO L226 Difference]: Without dead ends: 3467 [2018-11-10 12:39:04,707 INFO L605 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-10 12:39:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-10 12:39:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 2889. [2018-11-10 12:39:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2018-11-10 12:39:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4071 transitions. [2018-11-10 12:39:04,799 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4071 transitions. Word has length 27 [2018-11-10 12:39:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:04,799 INFO L481 AbstractCegarLoop]: Abstraction has 2889 states and 4071 transitions. [2018-11-10 12:39:04,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4071 transitions. [2018-11-10 12:39:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:39:04,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:04,803 INFO L375 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-10 12:39:04,803 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:04,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155844, now seen corresponding path program 1 times [2018-11-10 12:39:04,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:04,804 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:39:04,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:04,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:04,838 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:04,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:04,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:04,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:04,839 INFO L87 Difference]: Start difference. First operand 2889 states and 4071 transitions. Second operand 3 states. [2018-11-10 12:39:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:04,911 INFO L93 Difference]: Finished difference Result 6669 states and 9385 transitions. [2018-11-10 12:39:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:04,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 12:39:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:04,922 INFO L225 Difference]: With dead ends: 6669 [2018-11-10 12:39:04,923 INFO L226 Difference]: Without dead ends: 3851 [2018-11-10 12:39:04,926 INFO L605 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-10 12:39:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-10 12:39:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3849. [2018-11-10 12:39:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2018-11-10 12:39:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5319 transitions. [2018-11-10 12:39:05,029 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5319 transitions. Word has length 27 [2018-11-10 12:39:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:05,030 INFO L481 AbstractCegarLoop]: Abstraction has 3849 states and 5319 transitions. [2018-11-10 12:39:05,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5319 transitions. [2018-11-10 12:39:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:39:05,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:05,033 INFO L375 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-10 12:39:05,033 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:05,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:05,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1182043657, now seen corresponding path program 1 times [2018-11-10 12:39:05,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:05,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:05,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:05,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:05,046 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-10 12:39:05,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:05,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:05,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:05,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:05,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:05,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:05,047 INFO L87 Difference]: Start difference. First operand 3849 states and 5319 transitions. Second operand 3 states. [2018-11-10 12:39:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:05,111 INFO L93 Difference]: Finished difference Result 5773 states and 7945 transitions. [2018-11-10 12:39:05,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:05,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:39:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:05,121 INFO L225 Difference]: With dead ends: 5773 [2018-11-10 12:39:05,121 INFO L226 Difference]: Without dead ends: 3915 [2018-11-10 12:39:05,124 INFO L605 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-10 12:39:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-11-10 12:39:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3913. [2018-11-10 12:39:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-10 12:39:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 5319 transitions. [2018-11-10 12:39:05,215 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 5319 transitions. Word has length 28 [2018-11-10 12:39:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:05,215 INFO L481 AbstractCegarLoop]: Abstraction has 3913 states and 5319 transitions. [2018-11-10 12:39:05,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 5319 transitions. [2018-11-10 12:39:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:39:05,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:05,219 INFO L375 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-10 12:39:05,219 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:05,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:05,219 INFO L82 PathProgramCache]: Analyzing trace with hash 170926407, now seen corresponding path program 1 times [2018-11-10 12:39:05,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:05,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:05,233 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-10 12:39:05,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:05,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:05,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:05,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:05,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:05,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:05,234 INFO L87 Difference]: Start difference. First operand 3913 states and 5319 transitions. Second operand 3 states. [2018-11-10 12:39:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:05,327 INFO L93 Difference]: Finished difference Result 6669 states and 9161 transitions. [2018-11-10 12:39:05,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:05,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:39:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:05,343 INFO L225 Difference]: With dead ends: 6669 [2018-11-10 12:39:05,343 INFO L226 Difference]: Without dead ends: 6667 [2018-11-10 12:39:05,345 INFO L605 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-10 12:39:05,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2018-11-10 12:39:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5769. [2018-11-10 12:39:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-10 12:39:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7623 transitions. [2018-11-10 12:39:05,468 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7623 transitions. Word has length 28 [2018-11-10 12:39:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:05,468 INFO L481 AbstractCegarLoop]: Abstraction has 5769 states and 7623 transitions. [2018-11-10 12:39:05,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7623 transitions. [2018-11-10 12:39:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:39:05,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:05,477 INFO L375 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-10 12:39:05,477 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:05,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash -415879607, now seen corresponding path program 1 times [2018-11-10 12:39:05,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:05,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:05,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:05,502 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-10 12:39:05,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:05,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:05,502 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:05,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:05,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:05,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:05,503 INFO L87 Difference]: Start difference. First operand 5769 states and 7623 transitions. Second operand 3 states. [2018-11-10 12:39:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:05,622 INFO L93 Difference]: Finished difference Result 13197 states and 17353 transitions. [2018-11-10 12:39:05,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:05,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:39:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:05,634 INFO L225 Difference]: With dead ends: 13197 [2018-11-10 12:39:05,634 INFO L226 Difference]: Without dead ends: 7563 [2018-11-10 12:39:05,641 INFO L605 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-10 12:39:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2018-11-10 12:39:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7561. [2018-11-10 12:39:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7561 states. [2018-11-10 12:39:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 9735 transitions. [2018-11-10 12:39:05,829 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 9735 transitions. Word has length 28 [2018-11-10 12:39:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:05,829 INFO L481 AbstractCegarLoop]: Abstraction has 7561 states and 9735 transitions. [2018-11-10 12:39:05,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 9735 transitions. [2018-11-10 12:39:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:39:05,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:05,836 INFO L375 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-10 12:39:05,837 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:05,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1003967089, now seen corresponding path program 1 times [2018-11-10 12:39:05,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:05,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:05,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:05,850 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-10 12:39:05,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:05,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:05,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:05,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:05,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:05,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:05,852 INFO L87 Difference]: Start difference. First operand 7561 states and 9735 transitions. Second operand 3 states. [2018-11-10 12:39:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:05,977 INFO L93 Difference]: Finished difference Result 11341 states and 14537 transitions. [2018-11-10 12:39:05,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:05,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:39:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:05,988 INFO L225 Difference]: With dead ends: 11341 [2018-11-10 12:39:05,988 INFO L226 Difference]: Without dead ends: 7691 [2018-11-10 12:39:05,993 INFO L605 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-10 12:39:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2018-11-10 12:39:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7689. [2018-11-10 12:39:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-11-10 12:39:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 9735 transitions. [2018-11-10 12:39:06,130 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 9735 transitions. Word has length 29 [2018-11-10 12:39:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:06,130 INFO L481 AbstractCegarLoop]: Abstraction has 7689 states and 9735 transitions. [2018-11-10 12:39:06,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 9735 transitions. [2018-11-10 12:39:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:39:06,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:06,136 INFO L375 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-10 12:39:06,136 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:06,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:06,136 INFO L82 PathProgramCache]: Analyzing trace with hash -7150161, now seen corresponding path program 1 times [2018-11-10 12:39:06,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:06,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:06,170 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-10 12:39:06,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:06,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:06,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:06,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:06,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:06,171 INFO L87 Difference]: Start difference. First operand 7689 states and 9735 transitions. Second operand 3 states. [2018-11-10 12:39:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:06,338 INFO L93 Difference]: Finished difference Result 12813 states and 16265 transitions. [2018-11-10 12:39:06,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:06,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:39:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:06,350 INFO L225 Difference]: With dead ends: 12813 [2018-11-10 12:39:06,350 INFO L226 Difference]: Without dead ends: 12811 [2018-11-10 12:39:06,352 INFO L605 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-10 12:39:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12811 states. [2018-11-10 12:39:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12811 to 11529. [2018-11-10 12:39:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-11-10 12:39:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 14215 transitions. [2018-11-10 12:39:06,474 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 14215 transitions. Word has length 29 [2018-11-10 12:39:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:06,474 INFO L481 AbstractCegarLoop]: Abstraction has 11529 states and 14215 transitions. [2018-11-10 12:39:06,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 14215 transitions. [2018-11-10 12:39:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:39:06,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:06,479 INFO L375 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-10 12:39:06,480 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:06,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:06,480 INFO L82 PathProgramCache]: Analyzing trace with hash -593956175, now seen corresponding path program 1 times [2018-11-10 12:39:06,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:06,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:06,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:06,498 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-10 12:39:06,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:06,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:06,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:06,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:06,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:06,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:06,499 INFO L87 Difference]: Start difference. First operand 11529 states and 14215 transitions. Second operand 3 states. [2018-11-10 12:39:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:06,636 INFO L93 Difference]: Finished difference Result 26125 states and 31881 transitions. [2018-11-10 12:39:06,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:06,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:39:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:06,652 INFO L225 Difference]: With dead ends: 26125 [2018-11-10 12:39:06,652 INFO L226 Difference]: Without dead ends: 14859 [2018-11-10 12:39:06,662 INFO L605 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-10 12:39:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2018-11-10 12:39:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 14857. [2018-11-10 12:39:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2018-11-10 12:39:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 17671 transitions. [2018-11-10 12:39:06,886 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 17671 transitions. Word has length 29 [2018-11-10 12:39:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:06,887 INFO L481 AbstractCegarLoop]: Abstraction has 14857 states and 17671 transitions. [2018-11-10 12:39:06,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 17671 transitions. [2018-11-10 12:39:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:39:06,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:06,892 INFO L375 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-10 12:39:06,892 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:06,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash -221438882, now seen corresponding path program 1 times [2018-11-10 12:39:06,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:06,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:06,910 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-10 12:39:06,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:06,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:06,910 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:06,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:06,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:06,911 INFO L87 Difference]: Start difference. First operand 14857 states and 17671 transitions. Second operand 3 states. [2018-11-10 12:39:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:07,035 INFO L93 Difference]: Finished difference Result 22285 states and 26377 transitions. [2018-11-10 12:39:07,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:07,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 12:39:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:07,049 INFO L225 Difference]: With dead ends: 22285 [2018-11-10 12:39:07,050 INFO L226 Difference]: Without dead ends: 15115 [2018-11-10 12:39:07,059 INFO L605 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-10 12:39:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2018-11-10 12:39:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 15113. [2018-11-10 12:39:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15113 states. [2018-11-10 12:39:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15113 states to 15113 states and 17671 transitions. [2018-11-10 12:39:07,304 INFO L78 Accepts]: Start accepts. Automaton has 15113 states and 17671 transitions. Word has length 30 [2018-11-10 12:39:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:07,304 INFO L481 AbstractCegarLoop]: Abstraction has 15113 states and 17671 transitions. [2018-11-10 12:39:07,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15113 states and 17671 transitions. [2018-11-10 12:39:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:39:07,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:07,309 INFO L375 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-10 12:39:07,309 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:07,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1232556132, now seen corresponding path program 1 times [2018-11-10 12:39:07,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:07,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:07,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:07,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:07,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:39:07,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:07,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:07,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:07,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:07,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:07,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:07,343 INFO L87 Difference]: Start difference. First operand 15113 states and 17671 transitions. Second operand 3 states. [2018-11-10 12:39:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:07,628 INFO L93 Difference]: Finished difference Result 24587 states and 28424 transitions. [2018-11-10 12:39:07,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:07,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 12:39:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:07,646 INFO L225 Difference]: With dead ends: 24587 [2018-11-10 12:39:07,646 INFO L226 Difference]: Without dead ends: 24585 [2018-11-10 12:39:07,650 INFO L605 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-10 12:39:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24585 states. [2018-11-10 12:39:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24585 to 23049. [2018-11-10 12:39:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23049 states. [2018-11-10 12:39:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23049 states to 23049 states and 26375 transitions. [2018-11-10 12:39:07,914 INFO L78 Accepts]: Start accepts. Automaton has 23049 states and 26375 transitions. Word has length 30 [2018-11-10 12:39:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:07,914 INFO L481 AbstractCegarLoop]: Abstraction has 23049 states and 26375 transitions. [2018-11-10 12:39:07,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 23049 states and 26375 transitions. [2018-11-10 12:39:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:39:07,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:39:07,923 INFO L375 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-10 12:39:07,923 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:39:07,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1819362146, now seen corresponding path program 1 times [2018-11-10 12:39:07,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:39:07,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:07,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:07,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:07,925 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:39:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:07,962 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-10 12:39:07,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:07,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:07,962 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:39:07,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:39:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:07,963 INFO L87 Difference]: Start difference. First operand 23049 states and 26375 transitions. Second operand 3 states. [2018-11-10 12:39:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:08,232 INFO L93 Difference]: Finished difference Result 51721 states and 58119 transitions. [2018-11-10 12:39:08,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:39:08,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 12:39:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:39:08,233 INFO L225 Difference]: With dead ends: 51721 [2018-11-10 12:39:08,233 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:39:08,268 INFO L605 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-10 12:39:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:39:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:39:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:39:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:39:08,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-10 12:39:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:39:08,269 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:39:08,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:39:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:39:08,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:39:08,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:39:08,305 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:39:08,305 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:39:08,305 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:39:08,305 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:39:08,305 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:39:08,305 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:39:08,305 INFO L428 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-11-10 12:39:08,305 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-11-10 12:39:08,305 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,305 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L428 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-10 12:39:08,306 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L421 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,307 INFO L425 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-11-10 12:39:08,308 INFO L425 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-11-10 12:39:08,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:39:08 BoogieIcfgContainer [2018-11-10 12:39:08,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:39:08,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:39:08,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:39:08,315 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:39:08,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:39:03" (3/4) ... [2018-11-10 12:39:08,320 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:39:08,325 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:39:08,325 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:39:08,329 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 12:39:08,329 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 12:39:08,329 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:39:08,370 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b3b35d80-5a07-4822-ad6b-6dbf5881918c/bin-2019/utaipan/witness.graphml [2018-11-10 12:39:08,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:39:08,371 INFO L168 Benchmark]: Toolchain (without parser) took 5784.67 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.8 MB). Free memory was 959.2 MB in the beginning and 902.5 MB in the end (delta: 56.7 MB). Peak memory consumption was 538.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:08,373 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:39:08,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.16 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:08,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.08 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:08,373 INFO L168 Benchmark]: Boogie Preprocessor took 14.91 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:39:08,373 INFO L168 Benchmark]: RCFGBuilder took 255.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:08,374 INFO L168 Benchmark]: TraceAbstraction took 5294.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 338.2 MB). Free memory was 1.1 GB in the beginning and 916.4 MB in the end (delta: 199.2 MB). Peak memory consumption was 537.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:08,374 INFO L168 Benchmark]: Witness Printer took 55.39 ms. Allocated memory is still 1.5 GB. Free memory was 916.4 MB in the beginning and 902.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:08,375 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.16 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.08 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.91 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 255.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5294.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 338.2 MB). Free memory was 1.1 GB in the beginning and 916.4 MB in the end (delta: 199.2 MB). Peak memory consumption was 537.4 MB. Max. memory is 11.5 GB. * Witness Printer took 55.39 ms. Allocated memory is still 1.5 GB. Free memory was 916.4 MB in the beginning and 902.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2443 SDtfs, 1178 SDslu, 1649 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23049occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 5147 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 33520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...