./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_8_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_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:51:15,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:51:15,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:51:15,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:51:15,492 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:51:15,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:51:15,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:51:15,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:51:15,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:51:15,502 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:51:15,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:51:15,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:51:15,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:51:15,506 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:51:15,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:51:15,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:51:15,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:51:15,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:51:15,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:51:15,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:51:15,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:51:15,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:51:15,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:51:15,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:51:15,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:51:15,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:51:15,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:51:15,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:51:15,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:51:15,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:51:15,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:51:15,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:51:15,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:51:15,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:51:15,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:51:15,535 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:51:15,535 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:51:15,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:51:15,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:51:15,551 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:51:15,552 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:51:15,552 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:51:15,552 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:51:15,552 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:51:15,553 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:51:15,553 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:51:15,553 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:51:15,553 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:51:15,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:51:15,554 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:51:15,554 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:51:15,554 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:51:15,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:51:15,555 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:51:15,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:51:15,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:51:15,555 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:51:15,555 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:51:15,555 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:51:15,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:51:15,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:51:15,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:51:15,556 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:51:15,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:51:15,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:51:15,556 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:51:15,556 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:51:15,557 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:51:15,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:51:15,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:51:15,557 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:51:15,557 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_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-10-26 20:51:15,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:51:15,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:51:15,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:51:15,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:51:15,604 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:51:15,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:51:15,655 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/data/a053ed201/cfad93a8c1294db59e045adf5f802084/FLAG0b0cbadb8 [2018-10-26 20:51:15,988 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:51:15,988 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:51:15,994 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/data/a053ed201/cfad93a8c1294db59e045adf5f802084/FLAG0b0cbadb8 [2018-10-26 20:51:16,003 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/data/a053ed201/cfad93a8c1294db59e045adf5f802084 [2018-10-26 20:51:16,006 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:51:16,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:51:16,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:51:16,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:51:16,011 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:51:16,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d316e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16, skipping insertion in model container [2018-10-26 20:51:16,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:51:16,035 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:51:16,157 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:51:16,160 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:51:16,178 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:51:16,188 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:51:16,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16 WrapperNode [2018-10-26 20:51:16,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:51:16,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:51:16,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:51:16,189 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:51:16,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:51:16,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:51:16,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:51:16,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:51:16,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... [2018-10-26 20:51:16,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:51:16,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:51:16,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:51:16,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:51:16,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/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-10-26 20:51:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:51:16,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:51:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:51:16,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:51:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:51:16,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:51:16,922 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:51:16,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:51:16 BoogieIcfgContainer [2018-10-26 20:51:16,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:51:16,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:51:16,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:51:16,925 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:51:16,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:51:16" (1/3) ... [2018-10-26 20:51:16,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4471920f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:51:16, skipping insertion in model container [2018-10-26 20:51:16,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:16" (2/3) ... [2018-10-26 20:51:16,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4471920f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:51:16, skipping insertion in model container [2018-10-26 20:51:16,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:51:16" (3/3) ... [2018-10-26 20:51:16,928 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:51:16,936 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:51:16,942 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:51:16,953 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:51:16,979 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:51:16,979 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:51:16,979 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:51:16,979 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:51:16,979 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:51:16,980 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:51:16,980 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:51:16,980 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:51:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-26 20:51:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 20:51:16,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:17,000 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:51:17,002 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:17,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1244268193, now seen corresponding path program 1 times [2018-10-26 20:51:17,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:17,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:17,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:17,156 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:17,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:17,168 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-10-26 20:51:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:17,217 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2018-10-26 20:51:17,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:17,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-26 20:51:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:17,227 INFO L225 Difference]: With dead ends: 77 [2018-10-26 20:51:17,227 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 20:51:17,230 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-10-26 20:51:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 20:51:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-10-26 20:51:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 20:51:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-10-26 20:51:17,260 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2018-10-26 20:51:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:17,261 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2018-10-26 20:51:17,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2018-10-26 20:51:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 20:51:17,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:17,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:51:17,262 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:17,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash -543203615, now seen corresponding path program 1 times [2018-10-26 20:51:17,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,264 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:17,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:17,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:17,321 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:17,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:17,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:17,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:17,323 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand 3 states. [2018-10-26 20:51:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:17,372 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2018-10-26 20:51:17,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:17,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-26 20:51:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:17,374 INFO L225 Difference]: With dead ends: 100 [2018-10-26 20:51:17,374 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 20:51:17,375 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-10-26 20:51:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 20:51:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-10-26 20:51:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 20:51:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2018-10-26 20:51:17,381 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 19 [2018-10-26 20:51:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:17,381 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2018-10-26 20:51:17,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2018-10-26 20:51:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:51:17,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:17,382 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] [2018-10-26 20:51:17,383 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:17,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash 82605710, now seen corresponding path program 1 times [2018-10-26 20:51:17,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:17,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:17,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:17,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:17,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:17,449 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:17,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:17,450 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 3 states. [2018-10-26 20:51:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:17,513 INFO L93 Difference]: Finished difference Result 94 states and 157 transitions. [2018-10-26 20:51:17,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:17,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 20:51:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:17,515 INFO L225 Difference]: With dead ends: 94 [2018-10-26 20:51:17,515 INFO L226 Difference]: Without dead ends: 66 [2018-10-26 20:51:17,515 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-10-26 20:51:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-26 20:51:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-26 20:51:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-26 20:51:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-10-26 20:51:17,522 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 20 [2018-10-26 20:51:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:17,522 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2018-10-26 20:51:17,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-10-26 20:51:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:51:17,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:17,523 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] [2018-10-26 20:51:17,523 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:17,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:17,524 INFO L82 PathProgramCache]: Analyzing trace with hash 340771148, now seen corresponding path program 1 times [2018-10-26 20:51:17,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:17,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:17,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:17,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:17,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:17,577 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:17,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:17,578 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 3 states. [2018-10-26 20:51:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:17,614 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2018-10-26 20:51:17,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:17,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 20:51:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:17,619 INFO L225 Difference]: With dead ends: 117 [2018-10-26 20:51:17,619 INFO L226 Difference]: Without dead ends: 115 [2018-10-26 20:51:17,620 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-10-26 20:51:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-26 20:51:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-10-26 20:51:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-26 20:51:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-10-26 20:51:17,632 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 20 [2018-10-26 20:51:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:17,632 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-10-26 20:51:17,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-10-26 20:51:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:51:17,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:17,633 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] [2018-10-26 20:51:17,633 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:17,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1041835726, now seen corresponding path program 1 times [2018-10-26 20:51:17,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:17,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:17,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:17,708 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:17,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:17,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:17,709 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 3 states. [2018-10-26 20:51:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:17,762 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2018-10-26 20:51:17,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:17,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 20:51:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:17,764 INFO L225 Difference]: With dead ends: 191 [2018-10-26 20:51:17,764 INFO L226 Difference]: Without dead ends: 117 [2018-10-26 20:51:17,765 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-10-26 20:51:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-26 20:51:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-26 20:51:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-26 20:51:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2018-10-26 20:51:17,778 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 20 [2018-10-26 20:51:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:17,779 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2018-10-26 20:51:17,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2018-10-26 20:51:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:51:17,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:17,780 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-10-26 20:51:17,780 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:17,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1974185366, now seen corresponding path program 1 times [2018-10-26 20:51:17,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:17,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,782 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:17,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:17,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:17,825 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:17,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:17,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:17,826 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 3 states. [2018-10-26 20:51:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:17,918 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2018-10-26 20:51:17,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:17,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-26 20:51:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:17,919 INFO L225 Difference]: With dead ends: 172 [2018-10-26 20:51:17,919 INFO L226 Difference]: Without dead ends: 119 [2018-10-26 20:51:17,920 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-10-26 20:51:17,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-26 20:51:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-10-26 20:51:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-26 20:51:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 191 transitions. [2018-10-26 20:51:17,940 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 191 transitions. Word has length 21 [2018-10-26 20:51:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:17,940 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 191 transitions. [2018-10-26 20:51:17,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2018-10-26 20:51:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:51:17,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:17,941 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-10-26 20:51:17,941 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:17,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2062616492, now seen corresponding path program 1 times [2018-10-26 20:51:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:17,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:17,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:17,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:17,994 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:17,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:17,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:17,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:17,995 INFO L87 Difference]: Start difference. First operand 117 states and 191 transitions. Second operand 3 states. [2018-10-26 20:51:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:18,025 INFO L93 Difference]: Finished difference Result 213 states and 353 transitions. [2018-10-26 20:51:18,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:18,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-26 20:51:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:18,027 INFO L225 Difference]: With dead ends: 213 [2018-10-26 20:51:18,027 INFO L226 Difference]: Without dead ends: 211 [2018-10-26 20:51:18,027 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-10-26 20:51:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-26 20:51:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 157. [2018-10-26 20:51:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-26 20:51:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 255 transitions. [2018-10-26 20:51:18,039 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 255 transitions. Word has length 21 [2018-10-26 20:51:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:18,039 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 255 transitions. [2018-10-26 20:51:18,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 255 transitions. [2018-10-26 20:51:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:51:18,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:18,040 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-10-26 20:51:18,040 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:18,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:18,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1361551914, now seen corresponding path program 1 times [2018-10-26 20:51:18,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:18,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:18,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,042 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:18,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:18,076 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:18,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:18,076 INFO L87 Difference]: Start difference. First operand 157 states and 255 transitions. Second operand 3 states. [2018-10-26 20:51:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:18,121 INFO L93 Difference]: Finished difference Result 365 states and 597 transitions. [2018-10-26 20:51:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:18,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-26 20:51:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:18,122 INFO L225 Difference]: With dead ends: 365 [2018-10-26 20:51:18,122 INFO L226 Difference]: Without dead ends: 219 [2018-10-26 20:51:18,123 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-10-26 20:51:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-26 20:51:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-10-26 20:51:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-26 20:51:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2018-10-26 20:51:18,134 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 21 [2018-10-26 20:51:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:18,134 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2018-10-26 20:51:18,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2018-10-26 20:51:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:51:18,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:18,135 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-10-26 20:51:18,136 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:18,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:18,136 INFO L82 PathProgramCache]: Analyzing trace with hash 483612899, now seen corresponding path program 1 times [2018-10-26 20:51:18,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:18,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:18,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:18,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:18,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:18,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:18,183 INFO L87 Difference]: Start difference. First operand 217 states and 347 transitions. Second operand 3 states. [2018-10-26 20:51:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:18,202 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-10-26 20:51:18,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:18,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:51:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:18,203 INFO L225 Difference]: With dead ends: 325 [2018-10-26 20:51:18,204 INFO L226 Difference]: Without dead ends: 223 [2018-10-26 20:51:18,204 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-10-26 20:51:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-26 20:51:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-26 20:51:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-26 20:51:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2018-10-26 20:51:18,214 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 22 [2018-10-26 20:51:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:18,214 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2018-10-26 20:51:18,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2018-10-26 20:51:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:51:18,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:18,216 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-10-26 20:51:18,216 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:18,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 741778337, now seen corresponding path program 1 times [2018-10-26 20:51:18,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:18,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:18,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:18,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:18,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:18,309 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:18,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:18,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:18,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:18,310 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2018-10-26 20:51:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:18,380 INFO L93 Difference]: Finished difference Result 397 states and 633 transitions. [2018-10-26 20:51:18,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:18,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:51:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:18,383 INFO L225 Difference]: With dead ends: 397 [2018-10-26 20:51:18,383 INFO L226 Difference]: Without dead ends: 395 [2018-10-26 20:51:18,383 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-10-26 20:51:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-26 20:51:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 305. [2018-10-26 20:51:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-26 20:51:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2018-10-26 20:51:18,400 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 22 [2018-10-26 20:51:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:18,401 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2018-10-26 20:51:18,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2018-10-26 20:51:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:51:18,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:18,402 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-10-26 20:51:18,402 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:18,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842915, now seen corresponding path program 1 times [2018-10-26 20:51:18,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:18,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:18,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,403 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:18,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:18,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:18,455 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:18,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:18,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:18,456 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand 3 states. [2018-10-26 20:51:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:18,490 INFO L93 Difference]: Finished difference Result 709 states and 1097 transitions. [2018-10-26 20:51:18,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:18,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:51:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:18,492 INFO L225 Difference]: With dead ends: 709 [2018-10-26 20:51:18,492 INFO L226 Difference]: Without dead ends: 419 [2018-10-26 20:51:18,493 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-10-26 20:51:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-26 20:51:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-10-26 20:51:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-26 20:51:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2018-10-26 20:51:18,506 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 22 [2018-10-26 20:51:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:18,506 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2018-10-26 20:51:18,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2018-10-26 20:51:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:51:18,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:18,507 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-10-26 20:51:18,507 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:18,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1520507019, now seen corresponding path program 1 times [2018-10-26 20:51:18,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:18,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:18,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:18,541 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:18,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:18,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:18,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:18,542 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand 3 states. [2018-10-26 20:51:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:18,590 INFO L93 Difference]: Finished difference Result 625 states and 941 transitions. [2018-10-26 20:51:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:18,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:51:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:18,593 INFO L225 Difference]: With dead ends: 625 [2018-10-26 20:51:18,593 INFO L226 Difference]: Without dead ends: 427 [2018-10-26 20:51:18,594 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-10-26 20:51:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-26 20:51:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-10-26 20:51:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-26 20:51:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 631 transitions. [2018-10-26 20:51:18,605 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 631 transitions. Word has length 23 [2018-10-26 20:51:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:18,605 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 631 transitions. [2018-10-26 20:51:18,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 631 transitions. [2018-10-26 20:51:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:51:18,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:18,606 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-10-26 20:51:18,606 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:18,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1778672457, now seen corresponding path program 1 times [2018-10-26 20:51:18,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:18,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:18,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:18,631 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:18,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:18,631 INFO L87 Difference]: Start difference. First operand 425 states and 631 transitions. Second operand 3 states. [2018-10-26 20:51:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:18,739 INFO L93 Difference]: Finished difference Result 1213 states and 1785 transitions. [2018-10-26 20:51:18,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:18,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:51:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:18,741 INFO L225 Difference]: With dead ends: 1213 [2018-10-26 20:51:18,742 INFO L226 Difference]: Without dead ends: 811 [2018-10-26 20:51:18,743 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-10-26 20:51:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-10-26 20:51:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2018-10-26 20:51:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-10-26 20:51:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1159 transitions. [2018-10-26 20:51:18,771 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1159 transitions. Word has length 23 [2018-10-26 20:51:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:18,771 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1159 transitions. [2018-10-26 20:51:18,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1159 transitions. [2018-10-26 20:51:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:51:18,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:18,774 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-10-26 20:51:18,774 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:18,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1077607879, now seen corresponding path program 1 times [2018-10-26 20:51:18,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,775 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:18,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:18,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:18,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:18,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:18,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:18,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:18,841 INFO L87 Difference]: Start difference. First operand 809 states and 1159 transitions. Second operand 3 states. [2018-10-26 20:51:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:18,923 INFO L93 Difference]: Finished difference Result 957 states and 1401 transitions. [2018-10-26 20:51:18,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:18,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:51:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:18,927 INFO L225 Difference]: With dead ends: 957 [2018-10-26 20:51:18,927 INFO L226 Difference]: Without dead ends: 955 [2018-10-26 20:51:18,927 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-10-26 20:51:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-10-26 20:51:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 809. [2018-10-26 20:51:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-10-26 20:51:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1143 transitions. [2018-10-26 20:51:18,954 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1143 transitions. Word has length 23 [2018-10-26 20:51:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:18,954 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1143 transitions. [2018-10-26 20:51:18,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1143 transitions. [2018-10-26 20:51:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:51:18,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:18,955 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-10-26 20:51:18,955 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:18,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash -695513288, now seen corresponding path program 1 times [2018-10-26 20:51:18,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:18,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:18,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:18,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:19,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:19,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:19,026 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:19,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:19,027 INFO L87 Difference]: Start difference. First operand 809 states and 1143 transitions. Second operand 3 states. [2018-10-26 20:51:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:19,133 INFO L93 Difference]: Finished difference Result 1405 states and 2009 transitions. [2018-10-26 20:51:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:19,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 20:51:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:19,137 INFO L225 Difference]: With dead ends: 1405 [2018-10-26 20:51:19,137 INFO L226 Difference]: Without dead ends: 1403 [2018-10-26 20:51:19,138 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-10-26 20:51:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-26 20:51:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2018-10-26 20:51:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 20:51:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1623 transitions. [2018-10-26 20:51:19,174 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1623 transitions. Word has length 24 [2018-10-26 20:51:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:19,174 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1623 transitions. [2018-10-26 20:51:19,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1623 transitions. [2018-10-26 20:51:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:51:19,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:19,176 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-10-26 20:51:19,177 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:19,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash 5551290, now seen corresponding path program 1 times [2018-10-26 20:51:19,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:19,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:19,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:19,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:19,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:19,238 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:19,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:19,239 INFO L87 Difference]: Start difference. First operand 1177 states and 1623 transitions. Second operand 3 states. [2018-10-26 20:51:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:19,368 INFO L93 Difference]: Finished difference Result 2717 states and 3737 transitions. [2018-10-26 20:51:19,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:19,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 20:51:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:19,373 INFO L225 Difference]: With dead ends: 2717 [2018-10-26 20:51:19,373 INFO L226 Difference]: Without dead ends: 1563 [2018-10-26 20:51:19,375 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-10-26 20:51:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-10-26 20:51:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2018-10-26 20:51:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-10-26 20:51:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2087 transitions. [2018-10-26 20:51:19,431 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2087 transitions. Word has length 24 [2018-10-26 20:51:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:19,431 INFO L481 AbstractCegarLoop]: Abstraction has 1561 states and 2087 transitions. [2018-10-26 20:51:19,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2087 transitions. [2018-10-26 20:51:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:51:19,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:19,434 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-10-26 20:51:19,434 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:19,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:19,434 INFO L82 PathProgramCache]: Analyzing trace with hash -85859714, now seen corresponding path program 1 times [2018-10-26 20:51:19,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:19,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:19,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:19,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:19,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:19,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-10-26 20:51:19,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:19,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:19,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:19,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:19,499 INFO L87 Difference]: Start difference. First operand 1561 states and 2087 transitions. Second operand 3 states. [2018-10-26 20:51:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:19,622 INFO L93 Difference]: Finished difference Result 2365 states and 3161 transitions. [2018-10-26 20:51:19,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:19,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:51:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:19,627 INFO L225 Difference]: With dead ends: 2365 [2018-10-26 20:51:19,627 INFO L226 Difference]: Without dead ends: 1611 [2018-10-26 20:51:19,628 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-10-26 20:51:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-10-26 20:51:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2018-10-26 20:51:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-10-26 20:51:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2119 transitions. [2018-10-26 20:51:19,677 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2119 transitions. Word has length 25 [2018-10-26 20:51:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:19,678 INFO L481 AbstractCegarLoop]: Abstraction has 1609 states and 2119 transitions. [2018-10-26 20:51:19,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2119 transitions. [2018-10-26 20:51:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:51:19,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:19,681 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-10-26 20:51:19,682 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:19,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash 172305724, now seen corresponding path program 1 times [2018-10-26 20:51:19,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:19,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:19,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:19,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:19,685 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:19,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:19,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:19,750 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:19,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:19,750 INFO L87 Difference]: Start difference. First operand 1609 states and 2119 transitions. Second operand 3 states. [2018-10-26 20:51:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:19,886 INFO L93 Difference]: Finished difference Result 2701 states and 3561 transitions. [2018-10-26 20:51:19,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:19,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:51:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:19,894 INFO L225 Difference]: With dead ends: 2701 [2018-10-26 20:51:19,895 INFO L226 Difference]: Without dead ends: 2699 [2018-10-26 20:51:19,896 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-10-26 20:51:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-10-26 20:51:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2377. [2018-10-26 20:51:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-10-26 20:51:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3047 transitions. [2018-10-26 20:51:19,968 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3047 transitions. Word has length 25 [2018-10-26 20:51:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:19,968 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3047 transitions. [2018-10-26 20:51:19,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3047 transitions. [2018-10-26 20:51:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:51:19,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:19,974 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-10-26 20:51:19,974 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:19,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:19,974 INFO L82 PathProgramCache]: Analyzing trace with hash 873370302, now seen corresponding path program 1 times [2018-10-26 20:51:19,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:19,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:19,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:19,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:19,975 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:20,050 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:20,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:20,050 INFO L87 Difference]: Start difference. First operand 2377 states and 3047 transitions. Second operand 3 states. [2018-10-26 20:51:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:20,214 INFO L93 Difference]: Finished difference Result 5389 states and 6825 transitions. [2018-10-26 20:51:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:20,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:51:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:20,223 INFO L225 Difference]: With dead ends: 5389 [2018-10-26 20:51:20,224 INFO L226 Difference]: Without dead ends: 3083 [2018-10-26 20:51:20,227 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-10-26 20:51:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-10-26 20:51:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3081. [2018-10-26 20:51:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-10-26 20:51:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3783 transitions. [2018-10-26 20:51:20,315 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3783 transitions. Word has length 25 [2018-10-26 20:51:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:20,315 INFO L481 AbstractCegarLoop]: Abstraction has 3081 states and 3783 transitions. [2018-10-26 20:51:20,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3783 transitions. [2018-10-26 20:51:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:51:20,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:20,318 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-10-26 20:51:20,321 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:20,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1046726223, now seen corresponding path program 1 times [2018-10-26 20:51:20,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:20,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:20,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:20,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:20,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:20,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:20,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:20,386 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:20,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:20,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:20,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:20,386 INFO L87 Difference]: Start difference. First operand 3081 states and 3783 transitions. Second operand 3 states. [2018-10-26 20:51:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:20,510 INFO L93 Difference]: Finished difference Result 4621 states and 5641 transitions. [2018-10-26 20:51:20,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:20,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:51:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:20,519 INFO L225 Difference]: With dead ends: 4621 [2018-10-26 20:51:20,519 INFO L226 Difference]: Without dead ends: 3147 [2018-10-26 20:51:20,522 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-10-26 20:51:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-10-26 20:51:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3145. [2018-10-26 20:51:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-10-26 20:51:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3783 transitions. [2018-10-26 20:51:20,604 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3783 transitions. Word has length 26 [2018-10-26 20:51:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:20,605 INFO L481 AbstractCegarLoop]: Abstraction has 3145 states and 3783 transitions. [2018-10-26 20:51:20,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3783 transitions. [2018-10-26 20:51:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:51:20,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:20,608 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-10-26 20:51:20,608 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:20,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1304891661, now seen corresponding path program 1 times [2018-10-26 20:51:20,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:20,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:20,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:20,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:20,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:20,678 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:20,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:20,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:20,678 INFO L87 Difference]: Start difference. First operand 3145 states and 3783 transitions. Second operand 3 states. [2018-10-26 20:51:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:20,826 INFO L93 Difference]: Finished difference Result 5131 states and 6088 transitions. [2018-10-26 20:51:20,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:20,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:51:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:20,839 INFO L225 Difference]: With dead ends: 5131 [2018-10-26 20:51:20,839 INFO L226 Difference]: Without dead ends: 5129 [2018-10-26 20:51:20,842 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-10-26 20:51:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2018-10-26 20:51:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4745. [2018-10-26 20:51:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2018-10-26 20:51:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5575 transitions. [2018-10-26 20:51:20,955 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5575 transitions. Word has length 26 [2018-10-26 20:51:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:20,955 INFO L481 AbstractCegarLoop]: Abstraction has 4745 states and 5575 transitions. [2018-10-26 20:51:20,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5575 transitions. [2018-10-26 20:51:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:51:20,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:20,962 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-10-26 20:51:20,962 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:20,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2005956239, now seen corresponding path program 1 times [2018-10-26 20:51:20,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:20,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:20,965 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:21,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:21,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:51:21,026 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:21,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:51:21,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:51:21,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:51:21,026 INFO L87 Difference]: Start difference. First operand 4745 states and 5575 transitions. Second operand 3 states. [2018-10-26 20:51:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:21,224 INFO L93 Difference]: Finished difference Result 10633 states and 12231 transitions. [2018-10-26 20:51:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:51:21,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:51:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:21,226 INFO L225 Difference]: With dead ends: 10633 [2018-10-26 20:51:21,226 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 20:51:21,237 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-10-26 20:51:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 20:51:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 20:51:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 20:51:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 20:51:21,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-10-26 20:51:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:21,239 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 20:51:21,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:51:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 20:51:21,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 20:51:21,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 20:51:21,358 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 20:51:21,358 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:51:21,358 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:51:21,358 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 20:51:21,358 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 20:51:21,358 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 20:51:21,358 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-10-26 20:51:21,358 INFO L421 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-10-26 20:51:21,358 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-10-26 20:51:21,359 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,360 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-26 20:51:21,360 INFO L428 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-10-26 20:51:21,360 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,360 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L428 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-10-26 20:51:21,366 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:51:21,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:51:21 BoogieIcfgContainer [2018-10-26 20:51:21,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:51:21,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:51:21,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:51:21,377 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:51:21,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:51:16" (3/4) ... [2018-10-26 20:51:21,386 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 20:51:21,392 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 20:51:21,394 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 20:51:21,399 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-26 20:51:21,401 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 20:51:21,401 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 20:51:21,460 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ca5a7678-5ee7-4132-b0c4-dba7bd14e5e5/bin-2019/utaipan/witness.graphml [2018-10-26 20:51:21,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:51:21,463 INFO L168 Benchmark]: Toolchain (without parser) took 5456.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 955.8 MB in the beginning and 950.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 231.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:21,464 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:51:21,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.55 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:21,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.27 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 939.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:21,467 INFO L168 Benchmark]: Boogie Preprocessor took 36.24 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:51:21,467 INFO L168 Benchmark]: RCFGBuilder took 678.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:21,467 INFO L168 Benchmark]: TraceAbstraction took 4453.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 950.7 MB in the end (delta: 188.7 MB). Peak memory consumption was 254.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:21,468 INFO L168 Benchmark]: Witness Printer took 85.24 ms. Allocated memory is still 1.3 GB. Free memory is still 950.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:51:21,470 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.55 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.27 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 939.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.24 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 678.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4453.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 950.7 MB in the end (delta: 188.7 MB). Peak memory consumption was 254.3 MB. Max. memory is 11.5 GB. * Witness Printer took 85.24 ms. Allocated memory is still 1.3 GB. Free memory is still 950.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 39 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1583 SDtfs, 743 SDslu, 1056 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4745occurred in iteration=21, 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: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 1299 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...