./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/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 edfcf451b435e6b30ae37c75ee1e2f5c8348550f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:28:58,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:28:58,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:28:58,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:28:58,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:28:58,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:28:58,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:28:58,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:28:58,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:28:59,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:28:59,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:28:59,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:28:59,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:28:59,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:28:59,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:28:59,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:28:59,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:28:59,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:28:59,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:28:59,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:28:59,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:28:59,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:28:59,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:28:59,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:28:59,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:28:59,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:28:59,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:28:59,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:28:59,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:28:59,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:28:59,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:28:59,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:28:59,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:28:59,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:28:59,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:28:59,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:28:59,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:28:59,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:28:59,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:28:59,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:28:59,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:28:59,019 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:28:59,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:28:59,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:28:59,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:28:59,031 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:28:59,031 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:28:59,031 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:28:59,031 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:28:59,031 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:28:59,031 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:28:59,031 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:28:59,032 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:28:59,032 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:28:59,032 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:28:59,032 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:28:59,033 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:28:59,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:28:59,033 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:28:59,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:28:59,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:28:59,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:28:59,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:28:59,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:28:59,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:28:59,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:28:59,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:28:59,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:28:59,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:28:59,035 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:28:59,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:28:59,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:28:59,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:28:59,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:28:59,036 INFO L138 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/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/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 -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2019-12-07 12:28:59,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:28:59,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:28:59,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:28:59,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:28:59,145 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:28:59,145 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-12-07 12:28:59,183 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/data/e7172b144/ba1719e304d543028c831f395ad2e100/FLAGce2951da1 [2019-12-07 12:28:59,620 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:28:59,621 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-12-07 12:28:59,626 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/data/e7172b144/ba1719e304d543028c831f395ad2e100/FLAGce2951da1 [2019-12-07 12:28:59,635 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/data/e7172b144/ba1719e304d543028c831f395ad2e100 [2019-12-07 12:28:59,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:28:59,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:28:59,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:28:59,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:28:59,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:28:59,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc7a4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59, skipping insertion in model container [2019-12-07 12:28:59,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:28:59,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:28:59,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:28:59,821 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:28:59,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:28:59,851 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:28:59,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59 WrapperNode [2019-12-07 12:28:59,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:28:59,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:28:59,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:28:59,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:28:59,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:28:59,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:28:59,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:28:59,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:28:59,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... [2019-12-07 12:28:59,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:28:59,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:28:59,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:28:59,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:28:59,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/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 [2019-12-07 12:28:59,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:28:59,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:29:00,158 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:29:00,159 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 12:29:00,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:29:00 BoogieIcfgContainer [2019-12-07 12:29:00,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:29:00,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:29:00,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:29:00,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:29:00,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:28:59" (1/3) ... [2019-12-07 12:29:00,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9601c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:29:00, skipping insertion in model container [2019-12-07 12:29:00,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:59" (2/3) ... [2019-12-07 12:29:00,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9601c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:29:00, skipping insertion in model container [2019-12-07 12:29:00,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:29:00" (3/3) ... [2019-12-07 12:29:00,164 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-12-07 12:29:00,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:29:00,174 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-12-07 12:29:00,181 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-12-07 12:29:00,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:29:00,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:29:00,196 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:29:00,196 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:29:00,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:29:00,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:29:00,197 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:29:00,197 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:29:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-12-07 12:29:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:29:00,212 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,213 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2133700231, now seen corresponding path program 1 times [2019-12-07 12:29:00,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:00,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537247606] [2019-12-07 12:29:00,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537247606] [2019-12-07 12:29:00,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:29:00,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438305453] [2019-12-07 12:29:00,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:00,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:00,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:00,357 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 4 states. [2019-12-07 12:29:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:00,448 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2019-12-07 12:29:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:00,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 12:29:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:00,456 INFO L225 Difference]: With dead ends: 124 [2019-12-07 12:29:00,456 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 12:29:00,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 12:29:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2019-12-07 12:29:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 12:29:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-12-07 12:29:00,490 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 7 [2019-12-07 12:29:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,490 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-12-07 12:29:00,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-12-07 12:29:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:29:00,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2130064740, now seen corresponding path program 1 times [2019-12-07 12:29:00,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:00,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080126106] [2019-12-07 12:29:00,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080126106] [2019-12-07 12:29:00,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:29:00,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899518417] [2019-12-07 12:29:00,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:00,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:00,515 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-12-07 12:29:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:00,556 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-12-07 12:29:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:29:00,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 12:29:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:00,557 INFO L225 Difference]: With dead ends: 64 [2019-12-07 12:29:00,557 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:29:00,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:29:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 12:29:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:29:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-12-07 12:29:00,563 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 7 [2019-12-07 12:29:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,564 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-12-07 12:29:00,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-12-07 12:29:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:29:00,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,565 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1607501556, now seen corresponding path program 1 times [2019-12-07 12:29:00,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:00,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055122751] [2019-12-07 12:29:00,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055122751] [2019-12-07 12:29:00,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:29:00,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432975569] [2019-12-07 12:29:00,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:00,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:00,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:00,588 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-12-07 12:29:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:00,638 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-12-07 12:29:00,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:00,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 12:29:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:00,640 INFO L225 Difference]: With dead ends: 68 [2019-12-07 12:29:00,640 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 12:29:00,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 12:29:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-12-07 12:29:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 12:29:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-12-07 12:29:00,648 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2019-12-07 12:29:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,648 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-12-07 12:29:00,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-12-07 12:29:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:29:00,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,649 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,650 INFO L82 PathProgramCache]: Analyzing trace with hash -448408979, now seen corresponding path program 1 times [2019-12-07 12:29:00,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:00,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333501247] [2019-12-07 12:29:00,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333501247] [2019-12-07 12:29:00,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:29:00,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74094650] [2019-12-07 12:29:00,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:00,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:00,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:00,697 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-12-07 12:29:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:00,755 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-12-07 12:29:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:00,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 12:29:00,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:00,756 INFO L225 Difference]: With dead ends: 66 [2019-12-07 12:29:00,756 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 12:29:00,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:29:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 12:29:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-12-07 12:29:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 12:29:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-12-07 12:29:00,763 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 10 [2019-12-07 12:29:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,763 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-12-07 12:29:00,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-12-07 12:29:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:29:00,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1379104200, now seen corresponding path program 1 times [2019-12-07 12:29:00,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:00,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501136483] [2019-12-07 12:29:00,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501136483] [2019-12-07 12:29:00,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:29:00,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805451448] [2019-12-07 12:29:00,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:29:00,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:00,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:29:00,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:00,794 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-12-07 12:29:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:00,848 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-12-07 12:29:00,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:00,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 12:29:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:00,849 INFO L225 Difference]: With dead ends: 64 [2019-12-07 12:29:00,849 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:29:00,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:29:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-12-07 12:29:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 12:29:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-12-07 12:29:00,853 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 10 [2019-12-07 12:29:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,854 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-12-07 12:29:00,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:29:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-12-07 12:29:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:29:00,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,855 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1015772272, now seen corresponding path program 1 times [2019-12-07 12:29:00,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:00,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12183680] [2019-12-07 12:29:00,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12183680] [2019-12-07 12:29:00,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:29:00,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316699482] [2019-12-07 12:29:00,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:00,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:00,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:00,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:00,881 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2019-12-07 12:29:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:00,916 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-12-07 12:29:00,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:29:00,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:29:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:00,917 INFO L225 Difference]: With dead ends: 62 [2019-12-07 12:29:00,917 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 12:29:00,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 12:29:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-12-07 12:29:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 12:29:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-12-07 12:29:00,921 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 11 [2019-12-07 12:29:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,921 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-12-07 12:29:00,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-12-07 12:29:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:29:00,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,922 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1015281714, now seen corresponding path program 1 times [2019-12-07 12:29:00,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:00,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374020206] [2019-12-07 12:29:00,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374020206] [2019-12-07 12:29:00,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:29:00,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190070923] [2019-12-07 12:29:00,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:00,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:00,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:00,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:00,955 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 6 states. [2019-12-07 12:29:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,024 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-12-07 12:29:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:01,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 12:29:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,025 INFO L225 Difference]: With dead ends: 99 [2019-12-07 12:29:01,025 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 12:29:01,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:29:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 12:29:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2019-12-07 12:29:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 12:29:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-12-07 12:29:01,030 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2019-12-07 12:29:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,030 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-12-07 12:29:01,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-12-07 12:29:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:29:01,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,031 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash 197446834, now seen corresponding path program 1 times [2019-12-07 12:29:01,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987003203] [2019-12-07 12:29:01,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987003203] [2019-12-07 12:29:01,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:29:01,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524493891] [2019-12-07 12:29:01,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:01,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:01,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:01,051 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-12-07 12:29:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,085 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-12-07 12:29:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:29:01,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:29:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,086 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:29:01,086 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 12:29:01,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 12:29:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-12-07 12:29:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 12:29:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-12-07 12:29:01,090 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2019-12-07 12:29:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,090 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-12-07 12:29:01,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-12-07 12:29:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:29:01,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,091 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1408957852, now seen corresponding path program 1 times [2019-12-07 12:29:01,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598840158] [2019-12-07 12:29:01,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598840158] [2019-12-07 12:29:01,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:29:01,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587603012] [2019-12-07 12:29:01,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:01,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:01,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:01,148 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2019-12-07 12:29:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,217 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2019-12-07 12:29:01,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:29:01,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-12-07 12:29:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,218 INFO L225 Difference]: With dead ends: 90 [2019-12-07 12:29:01,218 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 12:29:01,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:29:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 12:29:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 49. [2019-12-07 12:29:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 12:29:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-12-07 12:29:01,222 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 12 [2019-12-07 12:29:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,222 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-12-07 12:29:01,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-12-07 12:29:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:29:01,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,223 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1842939021, now seen corresponding path program 1 times [2019-12-07 12:29:01,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306891747] [2019-12-07 12:29:01,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306891747] [2019-12-07 12:29:01,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:29:01,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155584073] [2019-12-07 12:29:01,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:29:01,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:29:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:01,244 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-12-07 12:29:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,294 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-12-07 12:29:01,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:01,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 12:29:01,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,295 INFO L225 Difference]: With dead ends: 67 [2019-12-07 12:29:01,295 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 12:29:01,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 12:29:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-12-07 12:29:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 12:29:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-12-07 12:29:01,298 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 12 [2019-12-07 12:29:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,298 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-12-07 12:29:01,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:29:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-12-07 12:29:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:29:01,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,299 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1844662925, now seen corresponding path program 1 times [2019-12-07 12:29:01,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139211473] [2019-12-07 12:29:01,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139211473] [2019-12-07 12:29:01,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:29:01,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925202272] [2019-12-07 12:29:01,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:01,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:01,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:01,337 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2019-12-07 12:29:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,375 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-12-07 12:29:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:01,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-12-07 12:29:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,376 INFO L225 Difference]: With dead ends: 48 [2019-12-07 12:29:01,376 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 12:29:01,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:29:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 12:29:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-12-07 12:29:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 12:29:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-12-07 12:29:01,379 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 12 [2019-12-07 12:29:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,379 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-12-07 12:29:01,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-12-07 12:29:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:29:01,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,380 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -734819501, now seen corresponding path program 1 times [2019-12-07 12:29:01,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528274874] [2019-12-07 12:29:01,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528274874] [2019-12-07 12:29:01,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:29:01,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054125553] [2019-12-07 12:29:01,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:01,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:01,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:01,434 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-12-07 12:29:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,472 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-12-07 12:29:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:29:01,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 12:29:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,472 INFO L225 Difference]: With dead ends: 45 [2019-12-07 12:29:01,473 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 12:29:01,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:29:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 12:29:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-12-07 12:29:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 12:29:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-12-07 12:29:01,475 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 13 [2019-12-07 12:29:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,475 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-12-07 12:29:01,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-12-07 12:29:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:29:01,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,477 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1296538901, now seen corresponding path program 1 times [2019-12-07 12:29:01,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41745417] [2019-12-07 12:29:01,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41745417] [2019-12-07 12:29:01,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:29:01,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360848187] [2019-12-07 12:29:01,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:29:01,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:29:01,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:01,506 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-12-07 12:29:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,554 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-12-07 12:29:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:29:01,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:29:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,554 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:29:01,554 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 12:29:01,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:29:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 12:29:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-12-07 12:29:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 12:29:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-12-07 12:29:01,557 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 13 [2019-12-07 12:29:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,557 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-12-07 12:29:01,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:29:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-12-07 12:29:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:29:01,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,558 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1298086046, now seen corresponding path program 1 times [2019-12-07 12:29:01,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221240613] [2019-12-07 12:29:01,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221240613] [2019-12-07 12:29:01,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:29:01,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317545339] [2019-12-07 12:29:01,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:01,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:01,602 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-12-07 12:29:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,650 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-12-07 12:29:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:01,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 12:29:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,651 INFO L225 Difference]: With dead ends: 60 [2019-12-07 12:29:01,651 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 12:29:01,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:29:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 12:29:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2019-12-07 12:29:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 12:29:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-12-07 12:29:01,653 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 13 [2019-12-07 12:29:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,653 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-12-07 12:29:01,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-12-07 12:29:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:29:01,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,654 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1349979981, now seen corresponding path program 1 times [2019-12-07 12:29:01,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636070482] [2019-12-07 12:29:01,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636070482] [2019-12-07 12:29:01,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:29:01,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826299513] [2019-12-07 12:29:01,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:29:01,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:29:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:01,683 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-12-07 12:29:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,716 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-12-07 12:29:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:01,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:29:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,717 INFO L225 Difference]: With dead ends: 36 [2019-12-07 12:29:01,717 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 12:29:01,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 12:29:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 12:29:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 12:29:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-12-07 12:29:01,719 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 13 [2019-12-07 12:29:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,719 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-12-07 12:29:01,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:29:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-12-07 12:29:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:29:01,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,720 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1585965895, now seen corresponding path program 1 times [2019-12-07 12:29:01,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327779127] [2019-12-07 12:29:01,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327779127] [2019-12-07 12:29:01,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:29:01,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131191320] [2019-12-07 12:29:01,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:29:01,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:29:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:01,751 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-12-07 12:29:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,798 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-12-07 12:29:01,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:29:01,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:29:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,799 INFO L225 Difference]: With dead ends: 47 [2019-12-07 12:29:01,799 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 12:29:01,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:29:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 12:29:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-12-07 12:29:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 12:29:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-12-07 12:29:01,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 14 [2019-12-07 12:29:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,801 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-12-07 12:29:01,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:29:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-12-07 12:29:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:29:01,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,802 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash 433495416, now seen corresponding path program 1 times [2019-12-07 12:29:01,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284940239] [2019-12-07 12:29:01,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284940239] [2019-12-07 12:29:01,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:29:01,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138894179] [2019-12-07 12:29:01,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:01,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:01,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:01,828 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2019-12-07 12:29:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,885 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-12-07 12:29:01,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:29:01,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 12:29:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,887 INFO L225 Difference]: With dead ends: 51 [2019-12-07 12:29:01,887 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 12:29:01,888 INFO L630 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 [2019-12-07 12:29:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 12:29:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2019-12-07 12:29:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 12:29:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 12:29:01,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-12-07 12:29:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,890 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 12:29:01,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 12:29:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:29:01,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:01,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:01,891 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:01,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:01,891 INFO L82 PathProgramCache]: Analyzing trace with hash 553460123, now seen corresponding path program 1 times [2019-12-07 12:29:01,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:01,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789574835] [2019-12-07 12:29:01,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:01,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789574835] [2019-12-07 12:29:01,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:01,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:29:01,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813648824] [2019-12-07 12:29:01,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:01,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:01,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:01,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:01,906 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-12-07 12:29:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:01,931 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-12-07 12:29:01,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:29:01,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:29:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:01,932 INFO L225 Difference]: With dead ends: 32 [2019-12-07 12:29:01,932 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:29:01,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:29:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:29:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:29:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:29:01,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-12-07 12:29:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:01,933 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:29:01,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:29:01,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:29:01,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:29:02,156 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L334(line 334) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-12-07 12:29:02,157 INFO L246 CegarLoopResult]: For program point L293(line 293) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L249 CegarLoopResult]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L249 CegarLoopResult]: At program point L368(lines 10 370) the Hoare annotation is: true [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-12-07 12:29:02,158 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-12-07 12:29:02,159 INFO L242 CegarLoopResult]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-12-07 12:29:02,159 INFO L246 CegarLoopResult]: For program point L220(line 220) no Hoare annotation was computed. [2019-12-07 12:29:02,159 INFO L246 CegarLoopResult]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-12-07 12:29:02,159 INFO L242 CegarLoopResult]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-12-07 12:29:02,159 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-12-07 12:29:02,159 INFO L246 CegarLoopResult]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-12-07 12:29:02,159 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 12:29:02,159 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 12:29:02,159 INFO L246 CegarLoopResult]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-12-07 12:29:02,159 INFO L246 CegarLoopResult]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point L346(line 346) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-12-07 12:29:02,160 INFO L246 CegarLoopResult]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L305(line 305) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L232(line 232) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L242 CegarLoopResult]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-12-07 12:29:02,161 INFO L242 CegarLoopResult]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 12:29:02,161 INFO L246 CegarLoopResult]: For program point L274(line 274) no Hoare annotation was computed. [2019-12-07 12:29:02,162 INFO L246 CegarLoopResult]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-12-07 12:29:02,162 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-12-07 12:29:02,162 INFO L246 CegarLoopResult]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-12-07 12:29:02,162 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 12:29:02,162 INFO L246 CegarLoopResult]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-12-07 12:29:02,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:29:02 BoogieIcfgContainer [2019-12-07 12:29:02,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:29:02,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:29:02,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:29:02,177 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:29:02,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:29:00" (3/4) ... [2019-12-07 12:29:02,180 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:29:02,191 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 12:29:02,192 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:29:02,249 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_98409d24-a0eb-4ce1-a034-d82c078c1acf/bin/utaipan/witness.graphml [2019-12-07 12:29:02,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:29:02,251 INFO L168 Benchmark]: Toolchain (without parser) took 2612.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 939.3 MB in the beginning and 879.6 MB in the end (delta: 59.7 MB). Peak memory consumption was 148.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:02,251 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:29:02,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:02,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.89 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:02,252 INFO L168 Benchmark]: Boogie Preprocessor took 15.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:29:02,252 INFO L168 Benchmark]: RCFGBuilder took 263.05 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:02,252 INFO L168 Benchmark]: TraceAbstraction took 2016.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 886.5 MB in the end (delta: 163.8 MB). Peak memory consumption was 163.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:02,253 INFO L168 Benchmark]: Witness Printer took 72.02 ms. Allocated memory is still 1.1 GB. Free memory was 886.5 MB in the beginning and 879.6 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:02,254 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 213.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.89 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 263.05 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2016.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 886.5 MB in the end (delta: 163.8 MB). Peak memory consumption was 163.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.02 ms. Allocated memory is still 1.1 GB. Free memory was 886.5 MB in the beginning and 879.6 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: 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: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 69 locations, 17 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 705 SDtfs, 1368 SDslu, 609 SDs, 0 SdLazy, 1023 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 226 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 56 HoareAnnotationTreeSize, 6 FomulaSimplifications, 143036 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 8224 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 6465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...