./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.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_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/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 75f71671f83387eb35a445031d63abe79f5c0c7c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:38:37,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:38:37,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:38:37,338 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:38:37,339 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:38:37,339 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:38:37,340 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:38:37,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:38:37,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:38:37,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:38:37,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:38:37,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:38:37,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:38:37,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:38:37,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:38:37,347 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:38:37,348 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:38:37,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:38:37,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:38:37,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:38:37,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:38:37,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:38:37,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:38:37,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:38:37,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:38:37,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:38:37,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:38:37,359 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:38:37,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:38:37,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:38:37,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:38:37,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:38:37,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:38:37,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:38:37,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:38:37,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:38:37,362 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 08:38:37,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:38:37,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:38:37,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:38:37,374 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 08:38:37,374 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 08:38:37,374 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 08:38:37,374 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 08:38:37,375 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 08:38:37,375 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 08:38:37,375 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 08:38:37,375 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 08:38:37,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:38:37,376 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:38:37,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:38:37,376 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:38:37,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:38:37,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:38:37,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:38:37,377 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:38:37,377 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:38:37,377 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:38:37,377 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:38:37,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:38:37,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:38:37,377 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:38:37,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:38:37,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:38:37,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:38:37,378 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:38:37,378 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:38:37,378 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 08:38:37,378 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:38:37,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:38:37,379 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 08:38:37,379 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_29097328-13da-4faa-a094-0b1f4a39c58e/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 -> 75f71671f83387eb35a445031d63abe79f5c0c7c [2018-11-10 08:38:37,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:38:37,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:38:37,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:38:37,420 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:38:37,420 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:38:37,421 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-10 08:38:37,471 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/data/b3134b18d/02d838dfb8c444b69b0ab85640e2e089/FLAG872841d2d [2018-11-10 08:38:37,826 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:38:37,827 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-10 08:38:37,832 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/data/b3134b18d/02d838dfb8c444b69b0ab85640e2e089/FLAG872841d2d [2018-11-10 08:38:37,841 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/data/b3134b18d/02d838dfb8c444b69b0ab85640e2e089 [2018-11-10 08:38:37,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:38:37,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:38:37,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:38:37,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:38:37,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:38:37,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:38:37" (1/1) ... [2018-11-10 08:38:37,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680a2912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:37, skipping insertion in model container [2018-11-10 08:38:37,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:38:37" (1/1) ... [2018-11-10 08:38:37,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:38:37,881 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:38:38,028 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:38:38,031 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:38:38,056 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:38:38,067 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:38:38,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38 WrapperNode [2018-11-10 08:38:38,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:38:38,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:38:38,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:38:38,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:38:38,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:38:38,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:38:38,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:38:38,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:38:38,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... [2018-11-10 08:38:38,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:38:38,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:38:38,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:38:38,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:38:38,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:38:38,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:38:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:38:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:38:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:38:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:38:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:38:38,483 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:38:38,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:38:38 BoogieIcfgContainer [2018-11-10 08:38:38,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:38:38,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:38:38,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:38:38,487 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:38:38,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:38:37" (1/3) ... [2018-11-10 08:38:38,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:38:38, skipping insertion in model container [2018-11-10 08:38:38,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:38:38" (2/3) ... [2018-11-10 08:38:38,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:38:38, skipping insertion in model container [2018-11-10 08:38:38,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:38:38" (3/3) ... [2018-11-10 08:38:38,490 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-10 08:38:38,496 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:38:38,501 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-10 08:38:38,511 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-10 08:38:38,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:38:38,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:38:38,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:38:38,533 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:38:38,533 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:38:38,533 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:38:38,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:38:38,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:38:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-10 08:38:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 08:38:38,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:38,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:38,553 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:38,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2018-11-10 08:38:38,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:38,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:38,597 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:38,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:38,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:38:38,732 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:38,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:38:38,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:38:38,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:38:38,745 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2018-11-10 08:38:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:38,893 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2018-11-10 08:38:38,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:38:38,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-10 08:38:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:38,902 INFO L225 Difference]: With dead ends: 127 [2018-11-10 08:38:38,902 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 08:38:38,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:38:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 08:38:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2018-11-10 08:38:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 08:38:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-10 08:38:38,930 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-11-10 08:38:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:38,930 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-10 08:38:38,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:38:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-10 08:38:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 08:38:38,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:38,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:38,931 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:38,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2018-11-10 08:38:38,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:38,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:38,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:38,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:38,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:38,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:38,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:38:38,984 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:38,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:38:38,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:38:38,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:38:38,986 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-11-10 08:38:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:39,080 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-10 08:38:39,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:38:39,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-10 08:38:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:39,081 INFO L225 Difference]: With dead ends: 111 [2018-11-10 08:38:39,081 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 08:38:39,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:38:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 08:38:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2018-11-10 08:38:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 08:38:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-10 08:38:39,086 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2018-11-10 08:38:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:39,086 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-10 08:38:39,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:38:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-10 08:38:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:38:39,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:39,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:39,088 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:39,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2018-11-10 08:38:39,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,089 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:39,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:39,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:39,141 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:39,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:39,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:39,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:39,142 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-11-10 08:38:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:39,269 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-10 08:38:39,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:38:39,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 08:38:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:39,271 INFO L225 Difference]: With dead ends: 109 [2018-11-10 08:38:39,271 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 08:38:39,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:38:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 08:38:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2018-11-10 08:38:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 08:38:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-10 08:38:39,279 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2018-11-10 08:38:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:39,280 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-10 08:38:39,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-10 08:38:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:38:39,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:39,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:39,281 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:39,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2018-11-10 08:38:39,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:39,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:39,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:39,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:39,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:39,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:39,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:39,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:39,340 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-11-10 08:38:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:39,457 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-11-10 08:38:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:38:39,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 08:38:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:39,458 INFO L225 Difference]: With dead ends: 105 [2018-11-10 08:38:39,458 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 08:38:39,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 08:38:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 67. [2018-11-10 08:38:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 08:38:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-10 08:38:39,464 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2018-11-10 08:38:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:39,465 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-10 08:38:39,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-10 08:38:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 08:38:39,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:39,465 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:39,466 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:39,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2018-11-10 08:38:39,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:39,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:39,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:39,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:39,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:39,531 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:39,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:39,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:39,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:39,532 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-11-10 08:38:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:39,660 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-11-10 08:38:39,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:38:39,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 08:38:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:39,662 INFO L225 Difference]: With dead ends: 150 [2018-11-10 08:38:39,662 INFO L226 Difference]: Without dead ends: 148 [2018-11-10 08:38:39,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:38:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-10 08:38:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 65. [2018-11-10 08:38:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 08:38:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-10 08:38:39,669 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2018-11-10 08:38:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:39,669 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-10 08:38:39,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-10 08:38:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 08:38:39,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:39,670 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:39,671 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:39,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:39,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2018-11-10 08:38:39,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:39,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:39,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:39,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:39,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:39,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:39,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:39,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:39,713 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-11-10 08:38:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:39,783 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-10 08:38:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:38:39,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 08:38:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:39,784 INFO L225 Difference]: With dead ends: 101 [2018-11-10 08:38:39,784 INFO L226 Difference]: Without dead ends: 99 [2018-11-10 08:38:39,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:38:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-10 08:38:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2018-11-10 08:38:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 08:38:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-10 08:38:39,789 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2018-11-10 08:38:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:39,789 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-10 08:38:39,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-10 08:38:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 08:38:39,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:39,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:39,791 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:39,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:39,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2018-11-10 08:38:39,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,792 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:39,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:39,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:39,836 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:39,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:39,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:39,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:39,837 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-11-10 08:38:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:39,969 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-10 08:38:39,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:38:39,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 08:38:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:39,971 INFO L225 Difference]: With dead ends: 99 [2018-11-10 08:38:39,971 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 08:38:39,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:38:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 08:38:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2018-11-10 08:38:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 08:38:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-10 08:38:39,976 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2018-11-10 08:38:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:39,976 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-10 08:38:39,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-10 08:38:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 08:38:39,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:39,977 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:39,977 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:39,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:39,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2018-11-10 08:38:39,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:39,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:40,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:40,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:40,010 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:40,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:40,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:40,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:40,011 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-11-10 08:38:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:40,099 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-10 08:38:40,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:38:40,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 08:38:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:40,100 INFO L225 Difference]: With dead ends: 93 [2018-11-10 08:38:40,100 INFO L226 Difference]: Without dead ends: 87 [2018-11-10 08:38:40,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:38:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-10 08:38:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2018-11-10 08:38:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 08:38:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-10 08:38:40,106 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2018-11-10 08:38:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:40,106 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-10 08:38:40,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-10 08:38:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:38:40,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:40,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:40,113 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:40,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2018-11-10 08:38:40,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:40,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:40,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,115 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:40,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:40,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 08:38:40,214 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:40,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:38:40,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:38:40,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:40,215 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 9 states. [2018-11-10 08:38:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:40,307 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-10 08:38:40,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:38:40,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-10 08:38:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:40,308 INFO L225 Difference]: With dead ends: 94 [2018-11-10 08:38:40,308 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 08:38:40,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:38:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 08:38:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2018-11-10 08:38:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 08:38:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-10 08:38:40,311 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-11-10 08:38:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:40,312 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-10 08:38:40,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:38:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-10 08:38:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:38:40,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:40,312 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:40,313 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:40,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:40,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2018-11-10 08:38:40,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:40,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:40,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:40,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:40,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 08:38:40,388 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:40,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:38:40,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:38:40,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:40,388 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2018-11-10 08:38:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:40,551 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-10 08:38:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:38:40,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-10 08:38:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:40,552 INFO L225 Difference]: With dead ends: 85 [2018-11-10 08:38:40,552 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 08:38:40,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:38:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 08:38:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2018-11-10 08:38:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 08:38:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-10 08:38:40,556 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-11-10 08:38:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:40,556 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-10 08:38:40,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:38:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-10 08:38:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:38:40,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:40,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:40,558 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:40,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2018-11-10 08:38:40,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:40,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:40,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:40,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:40,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:40,595 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:40,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:40,595 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-11-10 08:38:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:40,695 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-10 08:38:40,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:38:40,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-10 08:38:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:40,696 INFO L225 Difference]: With dead ends: 115 [2018-11-10 08:38:40,696 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 08:38:40,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 08:38:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 49. [2018-11-10 08:38:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 08:38:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-10 08:38:40,705 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2018-11-10 08:38:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:40,705 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-10 08:38:40,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-10 08:38:40,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:38:40,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:40,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:40,707 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:40,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:40,707 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2018-11-10 08:38:40,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:40,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:40,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:40,739 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:40,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:40,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:40,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:40,740 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-11-10 08:38:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:40,818 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-10 08:38:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:38:40,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-10 08:38:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:40,819 INFO L225 Difference]: With dead ends: 77 [2018-11-10 08:38:40,819 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 08:38:40,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 08:38:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 47. [2018-11-10 08:38:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 08:38:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-10 08:38:40,822 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-11-10 08:38:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:40,823 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-10 08:38:40,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-10 08:38:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 08:38:40,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:40,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:40,824 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:40,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:40,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2018-11-10 08:38:40,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:40,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:40,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:40,853 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:40,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:40,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:40,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:40,854 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-11-10 08:38:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:40,938 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-11-10 08:38:40,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:38:40,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-10 08:38:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:40,939 INFO L225 Difference]: With dead ends: 113 [2018-11-10 08:38:40,939 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 08:38:40,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 08:38:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 45. [2018-11-10 08:38:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 08:38:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-10 08:38:40,942 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-10 08:38:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:40,942 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-10 08:38:40,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-10 08:38:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 08:38:40,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:40,943 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:40,944 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:40,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2018-11-10 08:38:40,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:40,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:40,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:41,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:41,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 08:38:41,003 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:41,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:38:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:38:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:41,004 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2018-11-10 08:38:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:41,106 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-10 08:38:41,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:38:41,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-10 08:38:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:41,108 INFO L225 Difference]: With dead ends: 60 [2018-11-10 08:38:41,108 INFO L226 Difference]: Without dead ends: 58 [2018-11-10 08:38:41,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:38:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-10 08:38:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-11-10 08:38:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 08:38:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-10 08:38:41,114 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-10 08:38:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:41,116 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-10 08:38:41,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:38:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-10 08:38:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 08:38:41,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:41,117 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:41,117 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:41,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2018-11-10 08:38:41,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:41,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:41,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:41,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:41,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:41,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 08:38:41,193 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:41,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:38:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:38:41,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:41,194 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-11-10 08:38:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:41,291 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-10 08:38:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:38:41,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-10 08:38:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:41,292 INFO L225 Difference]: With dead ends: 44 [2018-11-10 08:38:41,292 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 08:38:41,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:38:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 08:38:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-10 08:38:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 08:38:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-10 08:38:41,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-10 08:38:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:41,298 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-10 08:38:41,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:38:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-10 08:38:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 08:38:41,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:41,298 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-11-10 08:38:41,299 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:41,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2018-11-10 08:38:41,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:41,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:41,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:41,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:41,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 08:38:41,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:41,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:38:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:38:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:38:41,368 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-11-10 08:38:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:41,502 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-10 08:38:41,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:38:41,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-10 08:38:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:41,503 INFO L225 Difference]: With dead ends: 55 [2018-11-10 08:38:41,503 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 08:38:41,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:38:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 08:38:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-11-10 08:38:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 08:38:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 08:38:41,507 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-11-10 08:38:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:41,507 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 08:38:41,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:38:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 08:38:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 08:38:41,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:41,508 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-11-10 08:38:41,508 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:41,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2018-11-10 08:38:41,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:41,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:41,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:41,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:41,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 08:38:41,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:41,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 08:38:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:38:41,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:38:41,538 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2018-11-10 08:38:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:41,612 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-10 08:38:41,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:38:41,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-10 08:38:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:41,614 INFO L225 Difference]: With dead ends: 53 [2018-11-10 08:38:41,614 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 08:38:41,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:38:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 08:38:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-10 08:38:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 08:38:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-10 08:38:41,618 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2018-11-10 08:38:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:41,618 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 08:38:41,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 08:38:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-10 08:38:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 08:38:41,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:38:41,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:38:41,619 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:38:41,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:38:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2018-11-10 08:38:41,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:38:41,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:41,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:38:41,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:38:41,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:38:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:38:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:38:41,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:38:41,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:38:41,641 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:38:41,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:38:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:38:41,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:38:41,642 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-11-10 08:38:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:38:41,713 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-10 08:38:41,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:38:41,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-10 08:38:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:38:41,713 INFO L225 Difference]: With dead ends: 49 [2018-11-10 08:38:41,713 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 08:38:41,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:38:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 08:38:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 08:38:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 08:38:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 08:38:41,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-10 08:38:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:38:41,715 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:38:41,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:38:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:38:41,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 08:38:41,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 08:38:41,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:38:41,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:38:41,980 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 13 [2018-11-10 08:38:41,983 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:38:41,983 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 08:38:41,983 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:38:41,983 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:38:41,983 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 08:38:41,983 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 08:38:41,983 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:38:41,983 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2018-11-10 08:38:41,983 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L428 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2018-11-10 08:38:41,984 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L421 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2018-11-10 08:38:41,985 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2018-11-10 08:38:41,986 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2018-11-10 08:38:41,986 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2018-11-10 08:38:41,987 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2018-11-10 08:38:41,987 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 08:38:41,987 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-10 08:38:41,987 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-10 08:38:41,987 INFO L425 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2018-11-10 08:38:41,987 INFO L425 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L421 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~13)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0)) [2018-11-10 08:38:41,988 INFO L421 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (or (<= 1 main_~main__t~0) (= main_~__VERIFIER_assert__cond~0 1)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2018-11-10 08:38:41,988 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L421 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 08:38:41,989 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2018-11-10 08:38:41,990 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2018-11-10 08:38:41,990 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-10 08:38:41,990 INFO L425 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2018-11-10 08:38:41,990 INFO L425 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2018-11-10 08:38:41,990 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 08:38:41,990 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2018-11-10 08:38:41,990 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2018-11-10 08:38:42,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:38:42 BoogieIcfgContainer [2018-11-10 08:38:42,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:38:42,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:38:42,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:38:42,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:38:42,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:38:38" (3/4) ... [2018-11-10 08:38:42,010 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 08:38:42,015 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 08:38:42,015 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 08:38:42,020 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 08:38:42,020 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 08:38:42,074 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_29097328-13da-4faa-a094-0b1f4a39c58e/bin-2019/utaipan/witness.graphml [2018-11-10 08:38:42,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:38:42,075 INFO L168 Benchmark]: Toolchain (without parser) took 4230.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 960.3 MB in the beginning and 1.0 GB in the end (delta: -58.0 MB). Peak memory consumption was 121.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:42,075 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:38:42,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.08 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:42,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.84 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:42,076 INFO L168 Benchmark]: Boogie Preprocessor took 20.77 ms. Allocated memory is still 1.0 GB. Free memory is still 944.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:38:42,076 INFO L168 Benchmark]: RCFGBuilder took 376.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:42,076 INFO L168 Benchmark]: TraceAbstraction took 3520.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.1 MB). Peak memory consumption was 125.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:42,077 INFO L168 Benchmark]: Witness Printer took 68.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:42,078 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 222.08 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.84 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.77 ms. Allocated memory is still 1.0 GB. Free memory is still 944.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 376.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3520.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.1 MB). Peak memory consumption was 125.1 MB. Max. memory is 11.5 GB. * Witness Printer took 68.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((1 <= main__t || __VERIFIER_assert__cond == 1) && main__t + 1 <= main__tagbuf_len) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 3.4s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 872 SDtfs, 2467 SDslu, 1673 SDs, 0 SdLazy, 1819 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, 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.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 614 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 54 HoareAnnotationTreeSize, 9 FomulaSimplifications, 9989709 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 16618 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 11454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...