./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/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 e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:52:53,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:52:53,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:52:53,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:52:53,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:52:53,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:52:53,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:52:53,940 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:52:53,941 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:52:53,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:52:53,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:52:53,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:52:53,943 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:52:53,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:52:53,944 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:52:53,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:52:53,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:52:53,946 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:52:53,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:52:53,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:52:53,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:52:53,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:52:53,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:52:53,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:52:53,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:52:53,951 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:52:53,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:52:53,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:52:53,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:52:53,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:52:53,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:52:53,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:52:53,954 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:52:53,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:52:53,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:52:53,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:52:53,955 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 09:52:53,962 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:52:53,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:52:53,963 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:52:53,963 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:52:53,963 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:52:53,963 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:52:53,963 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:52:53,964 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 09:52:53,964 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:52:53,964 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:52:53,964 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 09:52:53,964 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 09:52:53,964 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:52:53,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:52:53,965 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:52:53,965 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:52:53,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:52:53,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:52:53,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:52:53,965 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:52:53,966 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:52:53,966 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:52:53,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:52:53,966 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:52:53,966 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:52:53,966 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:52:53,966 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:52:53,966 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:52:53,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:52:53,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:52:53,967 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:52:53,967 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:52:53,967 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 09:52:53,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:52:53,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:52:53,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 09:52:53,967 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_26f25364-816d-457f-9541-c6624c847944/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 -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2018-12-02 09:52:53,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:52:53,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:52:53,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:52:53,998 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:52:53,998 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:52:53,999 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-02 09:52:54,038 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/data/ee3aab85f/89fb8101637f453386e29d53868a41e2/FLAGf3a35d709 [2018-12-02 09:52:54,441 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:52:54,442 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-02 09:52:54,446 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/data/ee3aab85f/89fb8101637f453386e29d53868a41e2/FLAGf3a35d709 [2018-12-02 09:52:54,454 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/data/ee3aab85f/89fb8101637f453386e29d53868a41e2 [2018-12-02 09:52:54,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:52:54,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:52:54,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:52:54,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:52:54,459 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:52:54,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b368404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54, skipping insertion in model container [2018-12-02 09:52:54,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:52:54,479 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:52:54,578 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:52:54,580 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:52:54,601 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:52:54,609 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:52:54,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54 WrapperNode [2018-12-02 09:52:54,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:52:54,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:52:54,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:52:54,611 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:52:54,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:52:54,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:52:54,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:52:54,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:52:54,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... [2018-12-02 09:52:54,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:52:54,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:52:54,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:52:54,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:52:54,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/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-12-02 09:52:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:52:54,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:52:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:52:54,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:52:54,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:52:54,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:52:54,911 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:52:54,911 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 09:52:54,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:52:54 BoogieIcfgContainer [2018-12-02 09:52:54,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:52:54,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:52:54,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:52:54,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:52:54,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:52:54" (1/3) ... [2018-12-02 09:52:54,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3142aa49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:52:54, skipping insertion in model container [2018-12-02 09:52:54,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:54" (2/3) ... [2018-12-02 09:52:54,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3142aa49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:52:54, skipping insertion in model container [2018-12-02 09:52:54,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:52:54" (3/3) ... [2018-12-02 09:52:54,916 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-02 09:52:54,922 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:52:54,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-12-02 09:52:54,936 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-12-02 09:52:54,955 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:52:54,955 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:52:54,955 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:52:54,956 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:52:54,956 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:52:54,956 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:52:54,956 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:52:54,956 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:52:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-12-02 09:52:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 09:52:54,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:54,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:54,973 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:54,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-12-02 09:52:54,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:55,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:55,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:55,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:55,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:52:55,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:55,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:52:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:52:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:52:55,112 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-12-02 09:52:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:55,130 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-12-02 09:52:55,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:52:55,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 09:52:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:55,137 INFO L225 Difference]: With dead ends: 93 [2018-12-02 09:52:55,137 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 09:52:55,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:52:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 09:52:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-02 09:52:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 09:52:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-12-02 09:52:55,162 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-12-02 09:52:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:55,162 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-12-02 09:52:55,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:52:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-12-02 09:52:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 09:52:55,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:55,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:55,163 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:55,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:55,164 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-12-02 09:52:55,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:55,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:55,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:55,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:55,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 09:52:55,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:55,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:52:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:52:55,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:52:55,223 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2018-12-02 09:52:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:55,290 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-12-02 09:52:55,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:55,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 09:52:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:55,292 INFO L225 Difference]: With dead ends: 80 [2018-12-02 09:52:55,292 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 09:52:55,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:52:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 09:52:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-02 09:52:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 09:52:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-12-02 09:52:55,298 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-12-02 09:52:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:55,298 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-12-02 09:52:55,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:52:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-12-02 09:52:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 09:52:55,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:55,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:55,299 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:55,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-12-02 09:52:55,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:55,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:55,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:55,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:55,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:55,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:55,350 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2018-12-02 09:52:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:55,425 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-12-02 09:52:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:55,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 09:52:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:55,426 INFO L225 Difference]: With dead ends: 116 [2018-12-02 09:52:55,426 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 09:52:55,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:52:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 09:52:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 76. [2018-12-02 09:52:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 09:52:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-12-02 09:52:55,431 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-12-02 09:52:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:55,431 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-12-02 09:52:55,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-12-02 09:52:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 09:52:55,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:55,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:55,432 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:55,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-12-02 09:52:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:55,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 09:52:55,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:55,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:52:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:52:55,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:52:55,463 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-12-02 09:52:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:55,529 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-02 09:52:55,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:55,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-02 09:52:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:55,529 INFO L225 Difference]: With dead ends: 76 [2018-12-02 09:52:55,529 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 09:52:55,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-02 09:52:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 09:52:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-02 09:52:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 09:52:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-02 09:52:55,533 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-12-02 09:52:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:55,533 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-02 09:52:55,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:52:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-02 09:52:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 09:52:55,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:55,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:55,534 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-12-02 09:52:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:55,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:55,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:55,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:55,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:55,575 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-12-02 09:52:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:55,677 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-12-02 09:52:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:55,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-02 09:52:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:55,678 INFO L225 Difference]: With dead ends: 141 [2018-12-02 09:52:55,679 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 09:52:55,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:52:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 09:52:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2018-12-02 09:52:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 09:52:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-02 09:52:55,684 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-12-02 09:52:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:55,685 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-02 09:52:55,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-02 09:52:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 09:52:55,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:55,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:55,686 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:55,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-12-02 09:52:55,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:55,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-12-02 09:52:55,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:55,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:55,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:55,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:55,714 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-12-02 09:52:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:55,785 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-12-02 09:52:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:55,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-02 09:52:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:55,786 INFO L225 Difference]: With dead ends: 108 [2018-12-02 09:52:55,786 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 09:52:55,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:52:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 09:52:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-12-02 09:52:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 09:52:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-12-02 09:52:55,791 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-12-02 09:52:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:55,792 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-12-02 09:52:55,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-12-02 09:52:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 09:52:55,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:55,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:55,793 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:55,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:55,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-12-02 09:52:55,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:55,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:55,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:55,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:55,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:55,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:55,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:55,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:55,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:55,827 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-12-02 09:52:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:55,893 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-12-02 09:52:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:52:55,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-02 09:52:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:55,894 INFO L225 Difference]: With dead ends: 121 [2018-12-02 09:52:55,894 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 09:52:55,894 INFO L631 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-12-02 09:52:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 09:52:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2018-12-02 09:52:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 09:52:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-02 09:52:55,901 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2018-12-02 09:52:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:55,901 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-02 09:52:55,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-02 09:52:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 09:52:55,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:55,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:55,902 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:55,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-12-02 09:52:55,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:55,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:55,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:55,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:55,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:55,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:55,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:55,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:55,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:55,945 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-12-02 09:52:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:55,997 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-02 09:52:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:52:55,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-02 09:52:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:55,998 INFO L225 Difference]: With dead ends: 77 [2018-12-02 09:52:55,998 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 09:52:55,999 INFO L631 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-12-02 09:52:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 09:52:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-02 09:52:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 09:52:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-02 09:52:56,003 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2018-12-02 09:52:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:56,003 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-02 09:52:56,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-02 09:52:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 09:52:56,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:56,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:56,004 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:56,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-12-02 09:52:56,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:56,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:56,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:52:56,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:56,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:52:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:52:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:52:56,020 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-12-02 09:52:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:56,041 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-02 09:52:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:52:56,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 09:52:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:56,041 INFO L225 Difference]: With dead ends: 115 [2018-12-02 09:52:56,042 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 09:52:56,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:52:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 09:52:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-02 09:52:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 09:52:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-12-02 09:52:56,047 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2018-12-02 09:52:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-12-02 09:52:56,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:52:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-12-02 09:52:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:52:56,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:56,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:56,049 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:56,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-12-02 09:52:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:56,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:56,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 09:52:56,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:56,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 09:52:56,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 09:52:56,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:52:56,099 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 7 states. [2018-12-02 09:52:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:56,163 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-02 09:52:56,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:56,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-02 09:52:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:56,164 INFO L225 Difference]: With dead ends: 76 [2018-12-02 09:52:56,164 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 09:52:56,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-02 09:52:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 09:52:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-12-02 09:52:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 09:52:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-02 09:52:56,169 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2018-12-02 09:52:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:56,170 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-02 09:52:56,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 09:52:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-02 09:52:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:52:56,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:56,171 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:56,171 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:56,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:56,171 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-12-02 09:52:56,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:56,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:56,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:52:56,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:52:56,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:52:56,217 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-02 09:52:56,218 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [192], [195], [196], [198], [204], [214], [215], [216] [2018-12-02 09:52:56,238 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:52:56,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:52:56,350 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:52:56,351 INFO L272 AbstractInterpreter]: Visited 28 different actions 34 times. Merged at 6 different actions 6 times. Never widened. Performed 164 root evaluator evaluations with a maximum evaluation depth of 6. Performed 164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-02 09:52:56,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:56,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:52:56,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:52:56,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:52:56,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:56,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:52:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:56,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:52:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:52:56,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:52:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:52:56,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:52:56,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-12-02 09:52:56,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:52:56,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:52:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:52:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:52:56,499 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2018-12-02 09:52:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:56,581 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-12-02 09:52:56,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:56,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-02 09:52:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:56,582 INFO L225 Difference]: With dead ends: 111 [2018-12-02 09:52:56,582 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 09:52:56,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:52:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 09:52:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2018-12-02 09:52:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 09:52:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-12-02 09:52:56,588 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2018-12-02 09:52:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:56,588 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-12-02 09:52:56,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:52:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-12-02 09:52:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 09:52:56,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:56,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:56,590 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:56,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-12-02 09:52:56,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:56,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:56,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 09:52:56,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:56,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:52:56,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:52:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:52:56,653 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-12-02 09:52:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:56,691 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-02 09:52:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:56,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-02 09:52:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:56,692 INFO L225 Difference]: With dead ends: 70 [2018-12-02 09:52:56,692 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 09:52:56,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-02 09:52:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 09:52:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 09:52:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 09:52:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-12-02 09:52:56,695 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2018-12-02 09:52:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:56,695 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-12-02 09:52:56,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:52:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-12-02 09:52:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 09:52:56,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:56,696 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:56,696 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:56,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-12-02 09:52:56,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:56,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:56,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:52:56,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:52:56,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:52:56,737 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-02 09:52:56,737 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [85], [86], [192], [198], [204], [214], [215], [216] [2018-12-02 09:52:56,739 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:52:56,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:52:56,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:52:56,789 INFO L272 AbstractInterpreter]: Visited 30 different actions 38 times. Merged at 8 different actions 8 times. Never widened. Performed 182 root evaluator evaluations with a maximum evaluation depth of 6. Performed 182 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-02 09:52:56,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:56,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:52:56,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:52:56,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:52:56,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:56,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:52:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:56,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:52:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:52:56,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:52:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:52:56,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:52:56,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-12-02 09:52:56,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:52:56,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:52:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:52:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:52:56,896 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2018-12-02 09:52:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:56,951 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-02 09:52:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:56,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-02 09:52:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:56,952 INFO L225 Difference]: With dead ends: 69 [2018-12-02 09:52:56,953 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 09:52:56,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:52:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 09:52:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-12-02 09:52:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 09:52:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-02 09:52:56,957 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2018-12-02 09:52:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:56,957 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-02 09:52:56,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:52:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-02 09:52:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 09:52:56,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:56,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:56,959 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:56,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-12-02 09:52:56,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:56,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:57,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 09:52:57,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:57,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 09:52:57,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 09:52:57,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:52:57,013 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2018-12-02 09:52:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,071 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-12-02 09:52:57,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:57,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-02 09:52:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,072 INFO L225 Difference]: With dead ends: 63 [2018-12-02 09:52:57,072 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 09:52:57,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-02 09:52:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 09:52:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-12-02 09:52:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 09:52:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-02 09:52:57,075 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-12-02 09:52:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,075 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-02 09:52:57,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 09:52:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-02 09:52:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 09:52:57,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,076 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-12-02 09:52:57,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:57,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 09:52:57,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:57,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 09:52:57,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 09:52:57,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:52:57,107 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2018-12-02 09:52:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,190 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-12-02 09:52:57,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:57,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-12-02 09:52:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,190 INFO L225 Difference]: With dead ends: 71 [2018-12-02 09:52:57,191 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 09:52:57,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-02 09:52:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 09:52:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-12-02 09:52:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 09:52:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-02 09:52:57,194 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2018-12-02 09:52:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,194 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-02 09:52:57,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 09:52:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-02 09:52:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 09:52:57,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,194 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-12-02 09:52:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:57,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:57,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:57,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:57,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:57,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:57,225 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2018-12-02 09:52:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,288 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-02 09:52:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:57,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-02 09:52:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,289 INFO L225 Difference]: With dead ends: 91 [2018-12-02 09:52:57,289 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 09:52:57,289 INFO L631 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-12-02 09:52:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 09:52:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-12-02 09:52:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 09:52:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-02 09:52:57,293 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2018-12-02 09:52:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,293 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-02 09:52:57,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-02 09:52:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 09:52:57,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,294 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-12-02 09:52:57,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:57,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:57,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:57,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:57,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:57,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:57,319 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2018-12-02 09:52:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,365 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-02 09:52:57,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:52:57,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-02 09:52:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,365 INFO L225 Difference]: With dead ends: 61 [2018-12-02 09:52:57,365 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 09:52:57,365 INFO L631 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-12-02 09:52:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 09:52:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 09:52:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 09:52:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-02 09:52:57,368 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2018-12-02 09:52:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,368 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-02 09:52:57,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-02 09:52:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 09:52:57,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,369 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2018-12-02 09:52:57,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:57,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:57,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:57,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:57,392 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2018-12-02 09:52:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,424 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-02 09:52:57,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:57,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-12-02 09:52:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,425 INFO L225 Difference]: With dead ends: 70 [2018-12-02 09:52:57,425 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 09:52:57,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:52:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 09:52:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-12-02 09:52:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 09:52:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-02 09:52:57,430 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2018-12-02 09:52:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,430 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-02 09:52:57,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-02 09:52:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 09:52:57,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,431 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2018-12-02 09:52:57,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:57,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 09:52:57,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:57,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:52:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:52:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:52:57,467 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-12-02 09:52:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,498 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-02 09:52:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:57,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-12-02 09:52:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,499 INFO L225 Difference]: With dead ends: 66 [2018-12-02 09:52:57,499 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 09:52:57,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 09:52:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 09:52:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-12-02 09:52:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 09:52:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-02 09:52:57,502 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2018-12-02 09:52:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,502 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-02 09:52:57,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:52:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-02 09:52:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 09:52:57,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,503 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2018-12-02 09:52:57,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:57,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:57,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:57,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:57,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:57,534 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-12-02 09:52:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,614 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-12-02 09:52:57,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:57,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-02 09:52:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,615 INFO L225 Difference]: With dead ends: 88 [2018-12-02 09:52:57,615 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 09:52:57,615 INFO L631 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-12-02 09:52:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 09:52:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-12-02 09:52:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 09:52:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-02 09:52:57,618 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2018-12-02 09:52:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,618 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-02 09:52:57,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-02 09:52:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 09:52:57,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,619 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,619 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2018-12-02 09:52:57,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:52:57,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:52:57,659 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-02 09:52:57,659 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [88], [94], [100], [106], [112], [117], [120], [126], [132], [136], [139], [142], [143], [145], [151], [180], [182], [214], [215], [216] [2018-12-02 09:52:57,661 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:52:57,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:52:57,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:52:57,688 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Performed 178 root evaluator evaluations with a maximum evaluation depth of 6. Performed 178 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2018-12-02 09:52:57,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:52:57,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:52:57,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:52:57,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,700 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:52:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:52:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:52:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:52:57,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-12-02 09:52:57,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:52:57,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:52:57,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:52:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:52:57,815 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 9 states. [2018-12-02 09:52:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,872 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-02 09:52:57,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:57,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-12-02 09:52:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,873 INFO L225 Difference]: With dead ends: 60 [2018-12-02 09:52:57,873 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 09:52:57,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:52:57,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 09:52:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 09:52:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 09:52:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-12-02 09:52:57,878 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2018-12-02 09:52:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,878 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-12-02 09:52:57,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:52:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-12-02 09:52:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 09:52:57,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,879 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2018-12-02 09:52:57,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:57,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:57,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:57,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:57,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:57,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:57,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:57,909 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-12-02 09:52:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:57,965 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-02 09:52:57,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:52:57,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-02 09:52:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:57,966 INFO L225 Difference]: With dead ends: 69 [2018-12-02 09:52:57,966 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 09:52:57,966 INFO L631 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-12-02 09:52:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 09:52:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-12-02 09:52:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 09:52:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-12-02 09:52:57,971 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-12-02 09:52:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:57,971 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-12-02 09:52:57,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-12-02 09:52:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 09:52:57,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:57,972 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:57,972 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:57,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2018-12-02 09:52:57,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:57,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:57,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:57,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:52:58,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:58,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:58,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:58,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:58,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:58,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:58,012 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-12-02 09:52:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:58,107 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-12-02 09:52:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:52:58,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-02 09:52:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:58,108 INFO L225 Difference]: With dead ends: 75 [2018-12-02 09:52:58,108 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 09:52:58,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:52:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 09:52:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 09:52:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 09:52:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 09:52:58,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-12-02 09:52:58,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:58,110 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:52:58,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 09:52:58,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 09:52:58,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 09:52:58,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:52:58,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:52:58,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:52:58,528 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2018-12-02 09:52:58,758 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 09:52:58,831 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-02 09:52:58,831 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L444 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse3 (+ main_~main__cp~0 1))) (let ((.cse1 (= main_~main__c~0 0)) (.cse0 (<= 2 main_~main__cp~0)) (.cse2 (= main_~__VERIFIER_assert__cond~9 1)) (.cse4 (and (not (= 0 main_~__VERIFIER_assert__cond~8)) (and (not (= 0 main_~__VERIFIER_assert__cond~7)) (= main_~__VERIFIER_assert__cond~4 1) (and (= main_~__VERIFIER_assert__cond~3 1) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (<= .cse3 main_~main__urilen~0) (<= 1 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~0 1) (<= 1 main_~main__scheme~0) (not (= 0 main_~__VERIFIER_assert__cond~6)) (not (= 0 main_~__VERIFIER_assert__cond~1))))))) (or (and .cse0 .cse1 .cse2 (not (= main_~main__urilen~0 .cse3)) (= main_~__VERIFIER_assert__cond~8 1) .cse4) (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse5 (let ((.cse6 (not (= 0 main_~__VERIFIER_assert__cond~10))) (.cse7 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and .cse0 .cse6 .cse2 .cse7 .cse4 (not (= 0 main_~__VERIFIER_assert__cond~12))) (and .cse0 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse6 .cse2 .cse7 .cse4))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse5) (and .cse5 .cse1))))))) [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-12-02 09:52:58,832 INFO L448 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-02 09:52:58,833 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L444 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (<= 1 main_~main__cp~0)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and .cse0 (= main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse1 (not (= 0 main_~__VERIFIER_assert__cond~17)) (= main_~__VERIFIER_assert__cond~16 1) .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L444 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 main_~main__cp~0)) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~16)) .cse2 .cse3) (and (= main_~__VERIFIER_assert__cond~2 1) .cse0 .cse1 .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0)) [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L444 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (and (<= 2 main_~main__cp~0) (not (= 0 main_~__VERIFIER_assert__cond~7)) (= main_~__VERIFIER_assert__cond~3 1) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (not (= 0 main_~__VERIFIER_assert__cond~8)) (not (= 0 main_~__VERIFIER_assert__cond~9)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__VERIFIER_assert__cond~4 1) (<= 1 main_~main__scheme~0) (not (= 0 main_~__VERIFIER_assert__cond~6)) (not (= 0 main_~__VERIFIER_assert__cond~1)))) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 (not (= 0 main_~__VERIFIER_assert__cond~12))))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse0) (and (= main_~main__c~0 0) .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L444 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= main_~__VERIFIER_assert__cond~0 1) [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-12-02 09:52:58,834 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-12-02 09:52:58,835 INFO L448 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-12-02 09:52:58,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:52:58 BoogieIcfgContainer [2018-12-02 09:52:58,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:52:58,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:52:58,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:52:58,848 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:52:58,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:52:54" (3/4) ... [2018-12-02 09:52:58,851 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 09:52:58,855 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 09:52:58,855 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 09:52:58,859 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 09:52:58,859 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 09:52:58,899 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_26f25364-816d-457f-9541-c6624c847944/bin-2019/utaipan/witness.graphml [2018-12-02 09:52:58,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:52:58,899 INFO L168 Benchmark]: Toolchain (without parser) took 4443.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.1 MB). Free memory was 958.8 MB in the beginning and 1.1 GB in the end (delta: -114.2 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:58,900 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:52:58,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 942.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:58,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.09 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:52:58,900 INFO L168 Benchmark]: Boogie Preprocessor took 47.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:58,900 INFO L168 Benchmark]: RCFGBuilder took 238.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:58,900 INFO L168 Benchmark]: TraceAbstraction took 3935.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.7 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:58,901 INFO L168 Benchmark]: Witness Printer took 50.85 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:58,901 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 942.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.09 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 238.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3935.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.7 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. * Witness Printer took 50.85 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: 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: 225]: Loop Invariant Derived loop invariant: (((((2 <= main__cp && main__c == 0) && __VERIFIER_assert__cond == 1) && !(main__urilen == main__cp + 1)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (__VERIFIER_assert__cond == 1 && (((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && ((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || (((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))) && main__c == 0))) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)))) && main__cp < main__urilen - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && ((((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && (((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((__VERIFIER_assert__cond == 1 && (((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || (main__c == 0 && ((((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && (((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((__VERIFIER_assert__cond == 1 && (((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))))) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond))) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 3.8s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1337 SDtfs, 2961 SDslu, 1868 SDs, 0 SdLazy, 1141 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 246 SyntacticMatches, 19 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 311 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 722 HoareAnnotationTreeSize, 9 FomulaSimplifications, 359937 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 56278 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 89932 SizeOfPredicates, 27 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...