./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu2.cil.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_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/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 2559ce56d5bdfaeec5255956226223494fe099f5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:34:31,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:34:31,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:34:31,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:34:31,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:34:31,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:34:31,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:34:31,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:34:31,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:34:31,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:34:31,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:34:31,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:34:31,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:34:31,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:34:31,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:34:31,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:34:31,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:34:31,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:34:31,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:34:31,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:34:31,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:34:31,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:34:31,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:34:31,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:34:31,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:34:31,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:34:31,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:34:31,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:34:31,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:34:31,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:34:31,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:34:31,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:34:31,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:34:31,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:34:31,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:34:31,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:34:31,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:34:31,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:34:31,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:34:31,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:34:31,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:34:31,223 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:34:31,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:34:31,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:34:31,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:34:31,234 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:34:31,234 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:34:31,235 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:34:31,235 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:34:31,235 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:34:31,235 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:34:31,235 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:34:31,235 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:34:31,235 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:34:31,235 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:34:31,236 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:34:31,236 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:34:31,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:34:31,236 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:34:31,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:34:31,237 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:34:31,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:34:31,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:34:31,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:34:31,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:34:31,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:34:31,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:34:31,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:34:31,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:34:31,238 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:34:31,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:34:31,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:34:31,239 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:34:31,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:34:31,239 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_506a26ba-ca9c-48a5-b1af-15c5597fa354/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 -> 2559ce56d5bdfaeec5255956226223494fe099f5 [2019-12-07 19:34:31,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:34:31,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:34:31,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:34:31,348 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:34:31,349 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:34:31,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/../../sv-benchmarks/c/systemc/kundu2.cil.c [2019-12-07 19:34:31,385 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/data/e82a676f0/faf891b53edf47a6ab23e1a5461780fc/FLAGbf733d7e3 [2019-12-07 19:34:31,788 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:34:31,788 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/sv-benchmarks/c/systemc/kundu2.cil.c [2019-12-07 19:34:31,795 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/data/e82a676f0/faf891b53edf47a6ab23e1a5461780fc/FLAGbf733d7e3 [2019-12-07 19:34:31,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/data/e82a676f0/faf891b53edf47a6ab23e1a5461780fc [2019-12-07 19:34:31,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:34:31,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:34:31,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:34:31,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:34:31,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:34:31,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:34:31" (1/1) ... [2019-12-07 19:34:31,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17982447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:31, skipping insertion in model container [2019-12-07 19:34:31,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:34:31" (1/1) ... [2019-12-07 19:34:31,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:34:31,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:34:31,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:34:31,998 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:34:32,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:34:32,038 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:34:32,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32 WrapperNode [2019-12-07 19:34:32,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:34:32,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:34:32,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:34:32,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:34:32,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:34:32,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:34:32,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:34:32,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:34:32,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... [2019-12-07 19:34:32,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:34:32,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:34:32,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:34:32,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:34:32,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/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 19:34:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:34:32,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:34:32,766 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:34:32,767 INFO L287 CfgBuilder]: Removed 95 assume(true) statements. [2019-12-07 19:34:32,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:32 BoogieIcfgContainer [2019-12-07 19:34:32,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:34:32,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:34:32,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:34:32,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:34:32,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:34:31" (1/3) ... [2019-12-07 19:34:32,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795c372a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:34:32, skipping insertion in model container [2019-12-07 19:34:32,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:32" (2/3) ... [2019-12-07 19:34:32,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795c372a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:34:32, skipping insertion in model container [2019-12-07 19:34:32,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:32" (3/3) ... [2019-12-07 19:34:32,772 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-12-07 19:34:32,779 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:34:32,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-07 19:34:32,791 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 19:34:32,808 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:34:32,808 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:34:32,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:34:32,808 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:34:32,808 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:34:32,808 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:34:32,809 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:34:32,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:34:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-12-07 19:34:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:34:32,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:32,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:32,826 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash 146133789, now seen corresponding path program 1 times [2019-12-07 19:34:32,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:32,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326120742] [2019-12-07 19:34:32,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:32,942 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 19:34:32,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326120742] [2019-12-07 19:34:32,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:32,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:34:32,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304021598] [2019-12-07 19:34:32,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:32,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:32,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:32,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:32,962 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2019-12-07 19:34:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:33,007 INFO L93 Difference]: Finished difference Result 275 states and 428 transitions. [2019-12-07 19:34:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:33,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:34:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:33,018 INFO L225 Difference]: With dead ends: 275 [2019-12-07 19:34:33,018 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 19:34:33,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 19:34:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-12-07 19:34:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-12-07 19:34:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 244 transitions. [2019-12-07 19:34:33,057 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 244 transitions. Word has length 19 [2019-12-07 19:34:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:33,057 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 244 transitions. [2019-12-07 19:34:33,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2019-12-07 19:34:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:34:33,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:33,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:33,059 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash -924289890, now seen corresponding path program 1 times [2019-12-07 19:34:33,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:33,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863832803] [2019-12-07 19:34:33,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:33,091 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 19:34:33,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863832803] [2019-12-07 19:34:33,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:33,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:34:33,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586537557] [2019-12-07 19:34:33,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:33,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:33,094 INFO L87 Difference]: Start difference. First operand 160 states and 244 transitions. Second operand 3 states. [2019-12-07 19:34:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:33,138 INFO L93 Difference]: Finished difference Result 445 states and 676 transitions. [2019-12-07 19:34:33,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:33,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:34:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:33,141 INFO L225 Difference]: With dead ends: 445 [2019-12-07 19:34:33,141 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 19:34:33,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 19:34:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-12-07 19:34:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-12-07 19:34:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 404 transitions. [2019-12-07 19:34:33,160 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 404 transitions. Word has length 19 [2019-12-07 19:34:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:33,160 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 404 transitions. [2019-12-07 19:34:33,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 404 transitions. [2019-12-07 19:34:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:34:33,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:33,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:33,161 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash -732877369, now seen corresponding path program 1 times [2019-12-07 19:34:33,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:33,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501540659] [2019-12-07 19:34:33,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:33,246 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 19:34:33,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501540659] [2019-12-07 19:34:33,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:33,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:33,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688930182] [2019-12-07 19:34:33,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:33,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:33,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:33,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:33,248 INFO L87 Difference]: Start difference. First operand 272 states and 404 transitions. Second operand 5 states. [2019-12-07 19:34:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:33,365 INFO L93 Difference]: Finished difference Result 1337 states and 2000 transitions. [2019-12-07 19:34:33,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:34:33,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 19:34:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:33,372 INFO L225 Difference]: With dead ends: 1337 [2019-12-07 19:34:33,372 INFO L226 Difference]: Without dead ends: 1077 [2019-12-07 19:34:33,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:34:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-12-07 19:34:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 462. [2019-12-07 19:34:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-12-07 19:34:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 692 transitions. [2019-12-07 19:34:33,416 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 692 transitions. Word has length 20 [2019-12-07 19:34:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:33,416 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 692 transitions. [2019-12-07 19:34:33,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 692 transitions. [2019-12-07 19:34:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:34:33,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:33,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:33,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:33,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:33,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1209496291, now seen corresponding path program 1 times [2019-12-07 19:34:33,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:33,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047536690] [2019-12-07 19:34:33,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:33,485 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 19:34:33,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047536690] [2019-12-07 19:34:33,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:33,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:33,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984031979] [2019-12-07 19:34:33,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:33,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:33,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:33,487 INFO L87 Difference]: Start difference. First operand 462 states and 692 transitions. Second operand 5 states. [2019-12-07 19:34:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:33,663 INFO L93 Difference]: Finished difference Result 2198 states and 3310 transitions. [2019-12-07 19:34:33,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:34:33,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:34:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:33,671 INFO L225 Difference]: With dead ends: 2198 [2019-12-07 19:34:33,671 INFO L226 Difference]: Without dead ends: 1748 [2019-12-07 19:34:33,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:34:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-07 19:34:33,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 902. [2019-12-07 19:34:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-07 19:34:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1352 transitions. [2019-12-07 19:34:33,707 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1352 transitions. Word has length 25 [2019-12-07 19:34:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:33,708 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1352 transitions. [2019-12-07 19:34:33,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1352 transitions. [2019-12-07 19:34:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:34:33,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:33,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:33,710 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash -901042847, now seen corresponding path program 1 times [2019-12-07 19:34:33,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:33,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317455296] [2019-12-07 19:34:33,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:33,745 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 19:34:33,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317455296] [2019-12-07 19:34:33,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:33,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:34:33,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184375669] [2019-12-07 19:34:33,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:33,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:33,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:33,747 INFO L87 Difference]: Start difference. First operand 902 states and 1352 transitions. Second operand 3 states. [2019-12-07 19:34:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:33,820 INFO L93 Difference]: Finished difference Result 2524 states and 3779 transitions. [2019-12-07 19:34:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:33,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 19:34:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:33,827 INFO L225 Difference]: With dead ends: 2524 [2019-12-07 19:34:33,827 INFO L226 Difference]: Without dead ends: 1634 [2019-12-07 19:34:33,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-12-07 19:34:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1628. [2019-12-07 19:34:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-12-07 19:34:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2422 transitions. [2019-12-07 19:34:33,881 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2422 transitions. Word has length 31 [2019-12-07 19:34:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:33,882 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 2422 transitions. [2019-12-07 19:34:33,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2422 transitions. [2019-12-07 19:34:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:34:33,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:33,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:33,883 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:33,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:33,884 INFO L82 PathProgramCache]: Analyzing trace with hash -419757452, now seen corresponding path program 1 times [2019-12-07 19:34:33,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:33,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822936570] [2019-12-07 19:34:33,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:33,939 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 19:34:33,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822936570] [2019-12-07 19:34:33,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:33,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:34:33,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333448488] [2019-12-07 19:34:33,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:34:33,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:33,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:34:33,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:34:33,940 INFO L87 Difference]: Start difference. First operand 1628 states and 2422 transitions. Second operand 7 states. [2019-12-07 19:34:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:34,274 INFO L93 Difference]: Finished difference Result 6372 states and 9539 transitions. [2019-12-07 19:34:34,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:34:34,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-07 19:34:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:34,293 INFO L225 Difference]: With dead ends: 6372 [2019-12-07 19:34:34,293 INFO L226 Difference]: Without dead ends: 4756 [2019-12-07 19:34:34,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:34:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2019-12-07 19:34:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2398. [2019-12-07 19:34:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-12-07 19:34:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3572 transitions. [2019-12-07 19:34:34,411 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3572 transitions. Word has length 32 [2019-12-07 19:34:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:34,411 INFO L462 AbstractCegarLoop]: Abstraction has 2398 states and 3572 transitions. [2019-12-07 19:34:34,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:34:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3572 transitions. [2019-12-07 19:34:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 19:34:34,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:34,412 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:34,413 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:34,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1765703740, now seen corresponding path program 1 times [2019-12-07 19:34:34,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:34,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475917082] [2019-12-07 19:34:34,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:34,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475917082] [2019-12-07 19:34:34,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:34,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:34,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599261574] [2019-12-07 19:34:34,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:34,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:34,437 INFO L87 Difference]: Start difference. First operand 2398 states and 3572 transitions. Second operand 4 states. [2019-12-07 19:34:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:34,616 INFO L93 Difference]: Finished difference Result 7420 states and 11154 transitions. [2019-12-07 19:34:34,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:34,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 19:34:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:34,636 INFO L225 Difference]: With dead ends: 7420 [2019-12-07 19:34:34,636 INFO L226 Difference]: Without dead ends: 5034 [2019-12-07 19:34:34,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-12-07 19:34:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 2956. [2019-12-07 19:34:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-12-07 19:34:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4490 transitions. [2019-12-07 19:34:34,756 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4490 transitions. Word has length 34 [2019-12-07 19:34:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:34,756 INFO L462 AbstractCegarLoop]: Abstraction has 2956 states and 4490 transitions. [2019-12-07 19:34:34,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4490 transitions. [2019-12-07 19:34:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 19:34:34,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:34,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:34,757 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:34,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1116955560, now seen corresponding path program 1 times [2019-12-07 19:34:34,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:34,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305078882] [2019-12-07 19:34:34,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:34,783 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 19:34:34,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305078882] [2019-12-07 19:34:34,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:34,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:34,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222500716] [2019-12-07 19:34:34,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:34,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:34,785 INFO L87 Difference]: Start difference. First operand 2956 states and 4490 transitions. Second operand 5 states. [2019-12-07 19:34:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:34,979 INFO L93 Difference]: Finished difference Result 6950 states and 10583 transitions. [2019-12-07 19:34:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:34:34,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 19:34:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:34,999 INFO L225 Difference]: With dead ends: 6950 [2019-12-07 19:34:34,999 INFO L226 Difference]: Without dead ends: 4006 [2019-12-07 19:34:35,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2019-12-07 19:34:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 3924. [2019-12-07 19:34:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3924 states. [2019-12-07 19:34:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5958 transitions. [2019-12-07 19:34:35,170 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5958 transitions. Word has length 35 [2019-12-07 19:34:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:35,170 INFO L462 AbstractCegarLoop]: Abstraction has 3924 states and 5958 transitions. [2019-12-07 19:34:35,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5958 transitions. [2019-12-07 19:34:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:34:35,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:35,171 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:35,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1911060133, now seen corresponding path program 1 times [2019-12-07 19:34:35,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:35,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100185234] [2019-12-07 19:34:35,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:35,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100185234] [2019-12-07 19:34:35,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:35,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:35,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456114380] [2019-12-07 19:34:35,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:35,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:35,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:35,199 INFO L87 Difference]: Start difference. First operand 3924 states and 5958 transitions. Second operand 4 states. [2019-12-07 19:34:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:35,443 INFO L93 Difference]: Finished difference Result 11272 states and 17388 transitions. [2019-12-07 19:34:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:35,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 19:34:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:35,471 INFO L225 Difference]: With dead ends: 11272 [2019-12-07 19:34:35,471 INFO L226 Difference]: Without dead ends: 7360 [2019-12-07 19:34:35,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2019-12-07 19:34:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 5252. [2019-12-07 19:34:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-12-07 19:34:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8026 transitions. [2019-12-07 19:34:35,698 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8026 transitions. Word has length 36 [2019-12-07 19:34:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:35,699 INFO L462 AbstractCegarLoop]: Abstraction has 5252 states and 8026 transitions. [2019-12-07 19:34:35,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8026 transitions. [2019-12-07 19:34:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 19:34:35,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:35,700 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:35,700 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2059367407, now seen corresponding path program 1 times [2019-12-07 19:34:35,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:35,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906718849] [2019-12-07 19:34:35,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:35,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906718849] [2019-12-07 19:34:35,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:35,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:35,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510622043] [2019-12-07 19:34:35,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:35,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:35,727 INFO L87 Difference]: Start difference. First operand 5252 states and 8026 transitions. Second operand 4 states. [2019-12-07 19:34:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:35,983 INFO L93 Difference]: Finished difference Result 12624 states and 19420 transitions. [2019-12-07 19:34:35,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:35,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 19:34:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:35,995 INFO L225 Difference]: With dead ends: 12624 [2019-12-07 19:34:35,996 INFO L226 Difference]: Without dead ends: 7384 [2019-12-07 19:34:36,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7384 states. [2019-12-07 19:34:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7384 to 5540. [2019-12-07 19:34:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5540 states. [2019-12-07 19:34:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5540 states to 5540 states and 8414 transitions. [2019-12-07 19:34:36,282 INFO L78 Accepts]: Start accepts. Automaton has 5540 states and 8414 transitions. Word has length 37 [2019-12-07 19:34:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:36,283 INFO L462 AbstractCegarLoop]: Abstraction has 5540 states and 8414 transitions. [2019-12-07 19:34:36,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5540 states and 8414 transitions. [2019-12-07 19:34:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 19:34:36,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:36,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:36,284 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2117574998, now seen corresponding path program 1 times [2019-12-07 19:34:36,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:36,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877441441] [2019-12-07 19:34:36,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:36,330 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 19:34:36,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877441441] [2019-12-07 19:34:36,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:36,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:34:36,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993947746] [2019-12-07 19:34:36,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:34:36,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:36,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:34:36,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:34:36,331 INFO L87 Difference]: Start difference. First operand 5540 states and 8414 transitions. Second operand 7 states. [2019-12-07 19:34:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:37,100 INFO L93 Difference]: Finished difference Result 20028 states and 30323 transitions. [2019-12-07 19:34:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:34:37,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-07 19:34:37,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:37,117 INFO L225 Difference]: With dead ends: 20028 [2019-12-07 19:34:37,117 INFO L226 Difference]: Without dead ends: 14500 [2019-12-07 19:34:37,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:34:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14500 states. [2019-12-07 19:34:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14500 to 7656. [2019-12-07 19:34:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7656 states. [2019-12-07 19:34:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 11642 transitions. [2019-12-07 19:34:37,410 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 11642 transitions. Word has length 38 [2019-12-07 19:34:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:37,411 INFO L462 AbstractCegarLoop]: Abstraction has 7656 states and 11642 transitions. [2019-12-07 19:34:37,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:34:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 11642 transitions. [2019-12-07 19:34:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:34:37,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:37,412 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:37,412 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:37,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1747634684, now seen corresponding path program 1 times [2019-12-07 19:34:37,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:37,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344818658] [2019-12-07 19:34:37,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:37,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344818658] [2019-12-07 19:34:37,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:37,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:34:37,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025590789] [2019-12-07 19:34:37,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:37,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:37,438 INFO L87 Difference]: Start difference. First operand 7656 states and 11642 transitions. Second operand 5 states. [2019-12-07 19:34:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:38,226 INFO L93 Difference]: Finished difference Result 26902 states and 40750 transitions. [2019-12-07 19:34:38,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:34:38,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 19:34:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:38,249 INFO L225 Difference]: With dead ends: 26902 [2019-12-07 19:34:38,249 INFO L226 Difference]: Without dead ends: 19242 [2019-12-07 19:34:38,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:34:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19242 states. [2019-12-07 19:34:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19242 to 8756. [2019-12-07 19:34:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8756 states. [2019-12-07 19:34:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8756 states to 8756 states and 13138 transitions. [2019-12-07 19:34:38,673 INFO L78 Accepts]: Start accepts. Automaton has 8756 states and 13138 transitions. Word has length 40 [2019-12-07 19:34:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:38,674 INFO L462 AbstractCegarLoop]: Abstraction has 8756 states and 13138 transitions. [2019-12-07 19:34:38,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:38,674 INFO L276 IsEmpty]: Start isEmpty. Operand 8756 states and 13138 transitions. [2019-12-07 19:34:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 19:34:38,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:38,675 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:38,675 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:38,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1805104947, now seen corresponding path program 1 times [2019-12-07 19:34:38,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:38,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026857207] [2019-12-07 19:34:38,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:38,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026857207] [2019-12-07 19:34:38,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:38,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:34:38,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758060649] [2019-12-07 19:34:38,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:38,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:38,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:38,694 INFO L87 Difference]: Start difference. First operand 8756 states and 13138 transitions. Second operand 3 states. [2019-12-07 19:34:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:39,272 INFO L93 Difference]: Finished difference Result 21796 states and 32802 transitions. [2019-12-07 19:34:39,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:39,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 19:34:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:39,288 INFO L225 Difference]: With dead ends: 21796 [2019-12-07 19:34:39,288 INFO L226 Difference]: Without dead ends: 17236 [2019-12-07 19:34:39,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17236 states. [2019-12-07 19:34:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17236 to 17004. [2019-12-07 19:34:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17004 states. [2019-12-07 19:34:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17004 states to 17004 states and 25514 transitions. [2019-12-07 19:34:40,036 INFO L78 Accepts]: Start accepts. Automaton has 17004 states and 25514 transitions. Word has length 46 [2019-12-07 19:34:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:40,036 INFO L462 AbstractCegarLoop]: Abstraction has 17004 states and 25514 transitions. [2019-12-07 19:34:40,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17004 states and 25514 transitions. [2019-12-07 19:34:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 19:34:40,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:40,038 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:40,038 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1356200331, now seen corresponding path program 1 times [2019-12-07 19:34:40,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:40,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425095374] [2019-12-07 19:34:40,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:34:40,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425095374] [2019-12-07 19:34:40,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:40,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:40,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211439523] [2019-12-07 19:34:40,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:40,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:40,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:40,062 INFO L87 Difference]: Start difference. First operand 17004 states and 25514 transitions. Second operand 4 states. [2019-12-07 19:34:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:41,524 INFO L93 Difference]: Finished difference Result 56300 states and 84158 transitions. [2019-12-07 19:34:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:41,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 19:34:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:41,566 INFO L225 Difference]: With dead ends: 56300 [2019-12-07 19:34:41,566 INFO L226 Difference]: Without dead ends: 39298 [2019-12-07 19:34:41,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39298 states. [2019-12-07 19:34:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39298 to 32707. [2019-12-07 19:34:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32707 states. [2019-12-07 19:34:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32707 states to 32707 states and 48527 transitions. [2019-12-07 19:34:43,077 INFO L78 Accepts]: Start accepts. Automaton has 32707 states and 48527 transitions. Word has length 50 [2019-12-07 19:34:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:43,078 INFO L462 AbstractCegarLoop]: Abstraction has 32707 states and 48527 transitions. [2019-12-07 19:34:43,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32707 states and 48527 transitions. [2019-12-07 19:34:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 19:34:43,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:43,080 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:43,080 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash 881162934, now seen corresponding path program 1 times [2019-12-07 19:34:43,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:43,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364519350] [2019-12-07 19:34:43,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:34:43,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364519350] [2019-12-07 19:34:43,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:43,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:34:43,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716396436] [2019-12-07 19:34:43,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:43,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:43,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:43,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:43,108 INFO L87 Difference]: Start difference. First operand 32707 states and 48527 transitions. Second operand 3 states. [2019-12-07 19:34:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:45,139 INFO L93 Difference]: Finished difference Result 82023 states and 121979 transitions. [2019-12-07 19:34:45,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:45,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 19:34:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:45,191 INFO L225 Difference]: With dead ends: 82023 [2019-12-07 19:34:45,191 INFO L226 Difference]: Without dead ends: 49327 [2019-12-07 19:34:45,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49327 states. [2019-12-07 19:34:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49327 to 49319. [2019-12-07 19:34:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49319 states. [2019-12-07 19:34:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49319 states to 49319 states and 73043 transitions. [2019-12-07 19:34:47,309 INFO L78 Accepts]: Start accepts. Automaton has 49319 states and 73043 transitions. Word has length 50 [2019-12-07 19:34:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:47,309 INFO L462 AbstractCegarLoop]: Abstraction has 49319 states and 73043 transitions. [2019-12-07 19:34:47,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 49319 states and 73043 transitions. [2019-12-07 19:34:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 19:34:47,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:47,311 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:47,312 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash -58461633, now seen corresponding path program 1 times [2019-12-07 19:34:47,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:47,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621794241] [2019-12-07 19:34:47,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:47,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621794241] [2019-12-07 19:34:47,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:47,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:47,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271099494] [2019-12-07 19:34:47,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:47,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:47,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:47,335 INFO L87 Difference]: Start difference. First operand 49319 states and 73043 transitions. Second operand 3 states. [2019-12-07 19:34:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:50,359 INFO L93 Difference]: Finished difference Result 122635 states and 181960 transitions. [2019-12-07 19:34:50,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:50,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 19:34:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:50,439 INFO L225 Difference]: With dead ends: 122635 [2019-12-07 19:34:50,440 INFO L226 Difference]: Without dead ends: 73327 [2019-12-07 19:34:50,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73327 states. [2019-12-07 19:34:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73327 to 71065. [2019-12-07 19:34:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71065 states. [2019-12-07 19:34:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71065 states to 71065 states and 103861 transitions. [2019-12-07 19:34:53,749 INFO L78 Accepts]: Start accepts. Automaton has 71065 states and 103861 transitions. Word has length 51 [2019-12-07 19:34:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:53,749 INFO L462 AbstractCegarLoop]: Abstraction has 71065 states and 103861 transitions. [2019-12-07 19:34:53,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 71065 states and 103861 transitions. [2019-12-07 19:34:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 19:34:53,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,752 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:53,752 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash 456161298, now seen corresponding path program 1 times [2019-12-07 19:34:53,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489939210] [2019-12-07 19:34:53,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:53,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489939210] [2019-12-07 19:34:53,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:53,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:34:53,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793271844] [2019-12-07 19:34:53,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:53,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:53,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:53,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:53,794 INFO L87 Difference]: Start difference. First operand 71065 states and 103861 transitions. Second operand 5 states. [2019-12-07 19:34:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:57,042 INFO L93 Difference]: Finished difference Result 145891 states and 212018 transitions. [2019-12-07 19:34:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:34:57,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 19:34:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:57,119 INFO L225 Difference]: With dead ends: 145891 [2019-12-07 19:34:57,119 INFO L226 Difference]: Without dead ends: 74837 [2019-12-07 19:34:57,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:34:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74837 states. [2019-12-07 19:35:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74837 to 71065. [2019-12-07 19:35:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71065 states. [2019-12-07 19:35:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71065 states to 71065 states and 102925 transitions. [2019-12-07 19:35:01,341 INFO L78 Accepts]: Start accepts. Automaton has 71065 states and 102925 transitions. Word has length 52 [2019-12-07 19:35:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:01,342 INFO L462 AbstractCegarLoop]: Abstraction has 71065 states and 102925 transitions. [2019-12-07 19:35:01,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:35:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 71065 states and 102925 transitions. [2019-12-07 19:35:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 19:35:01,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:01,344 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:01,344 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash 580716263, now seen corresponding path program 1 times [2019-12-07 19:35:01,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:01,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398261476] [2019-12-07 19:35:01,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:35:01,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398261476] [2019-12-07 19:35:01,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:01,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:35:01,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013759981] [2019-12-07 19:35:01,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:35:01,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:35:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:01,368 INFO L87 Difference]: Start difference. First operand 71065 states and 102925 transitions. Second operand 3 states. [2019-12-07 19:35:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:04,346 INFO L93 Difference]: Finished difference Result 143153 states and 207251 transitions. [2019-12-07 19:35:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:35:04,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 19:35:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:04,420 INFO L225 Difference]: With dead ends: 143153 [2019-12-07 19:35:04,420 INFO L226 Difference]: Without dead ends: 72099 [2019-12-07 19:35:04,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72099 states. [2019-12-07 19:35:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72099 to 71905. [2019-12-07 19:35:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71905 states. [2019-12-07 19:35:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71905 states to 71905 states and 104052 transitions. [2019-12-07 19:35:07,603 INFO L78 Accepts]: Start accepts. Automaton has 71905 states and 104052 transitions. Word has length 52 [2019-12-07 19:35:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:07,604 INFO L462 AbstractCegarLoop]: Abstraction has 71905 states and 104052 transitions. [2019-12-07 19:35:07,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:35:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 71905 states and 104052 transitions. [2019-12-07 19:35:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:35:07,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:07,606 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:07,606 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:07,607 INFO L82 PathProgramCache]: Analyzing trace with hash 771753252, now seen corresponding path program 1 times [2019-12-07 19:35:07,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:07,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066156241] [2019-12-07 19:35:07,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:35:07,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066156241] [2019-12-07 19:35:07,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:07,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:35:07,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121184757] [2019-12-07 19:35:07,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:35:07,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:07,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:35:07,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:07,633 INFO L87 Difference]: Start difference. First operand 71905 states and 104052 transitions. Second operand 3 states. [2019-12-07 19:35:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:13,475 INFO L93 Difference]: Finished difference Result 204213 states and 297335 transitions. [2019-12-07 19:35:13,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:35:13,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 19:35:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:13,642 INFO L225 Difference]: With dead ends: 204213 [2019-12-07 19:35:13,642 INFO L226 Difference]: Without dead ends: 132599 [2019-12-07 19:35:13,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132599 states. [2019-12-07 19:35:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132599 to 132591. [2019-12-07 19:35:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132591 states. [2019-12-07 19:35:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132591 states to 132591 states and 193129 transitions. [2019-12-07 19:35:19,875 INFO L78 Accepts]: Start accepts. Automaton has 132591 states and 193129 transitions. Word has length 53 [2019-12-07 19:35:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:19,875 INFO L462 AbstractCegarLoop]: Abstraction has 132591 states and 193129 transitions. [2019-12-07 19:35:19,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:35:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 132591 states and 193129 transitions. [2019-12-07 19:35:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:35:19,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:19,877 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:19,877 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash 658366595, now seen corresponding path program 1 times [2019-12-07 19:35:19,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:19,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623352454] [2019-12-07 19:35:19,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:19,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623352454] [2019-12-07 19:35:19,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:19,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:35:19,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729224267] [2019-12-07 19:35:19,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:35:19,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:35:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:19,900 INFO L87 Difference]: Start difference. First operand 132591 states and 193129 transitions. Second operand 3 states. [2019-12-07 19:35:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:24,451 INFO L93 Difference]: Finished difference Result 227839 states and 332137 transitions. [2019-12-07 19:35:24,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:35:24,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 19:35:24,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:24,575 INFO L225 Difference]: With dead ends: 227839 [2019-12-07 19:35:24,575 INFO L226 Difference]: Without dead ends: 96007 [2019-12-07 19:35:24,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96007 states. [2019-12-07 19:35:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96007 to 94459. [2019-12-07 19:35:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94459 states. [2019-12-07 19:35:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94459 states to 94459 states and 136459 transitions. [2019-12-07 19:35:29,336 INFO L78 Accepts]: Start accepts. Automaton has 94459 states and 136459 transitions. Word has length 53 [2019-12-07 19:35:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:29,336 INFO L462 AbstractCegarLoop]: Abstraction has 94459 states and 136459 transitions. [2019-12-07 19:35:29,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:35:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 94459 states and 136459 transitions. [2019-12-07 19:35:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:35:29,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:29,338 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:29,338 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:29,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash 165795650, now seen corresponding path program 1 times [2019-12-07 19:35:29,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:29,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191638272] [2019-12-07 19:35:29,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:29,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191638272] [2019-12-07 19:35:29,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:29,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:35:29,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633292052] [2019-12-07 19:35:29,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:35:29,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:29,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:35:29,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:35:29,366 INFO L87 Difference]: Start difference. First operand 94459 states and 136459 transitions. Second operand 4 states. [2019-12-07 19:35:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:33,289 INFO L93 Difference]: Finished difference Result 174290 states and 254886 transitions. [2019-12-07 19:35:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:35:33,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 19:35:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:33,377 INFO L225 Difference]: With dead ends: 174290 [2019-12-07 19:35:33,377 INFO L226 Difference]: Without dead ends: 79842 [2019-12-07 19:35:33,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 19:35:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79842 states. [2019-12-07 19:35:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79842 to 79809. [2019-12-07 19:35:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79809 states. [2019-12-07 19:35:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79809 states to 79809 states and 113178 transitions. [2019-12-07 19:35:38,337 INFO L78 Accepts]: Start accepts. Automaton has 79809 states and 113178 transitions. Word has length 53 [2019-12-07 19:35:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:38,337 INFO L462 AbstractCegarLoop]: Abstraction has 79809 states and 113178 transitions. [2019-12-07 19:35:38,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:35:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 79809 states and 113178 transitions. [2019-12-07 19:35:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:35:38,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:38,339 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:38,339 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash -545235094, now seen corresponding path program 1 times [2019-12-07 19:35:38,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:38,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17653945] [2019-12-07 19:35:38,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:38,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17653945] [2019-12-07 19:35:38,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:38,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:35:38,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788453086] [2019-12-07 19:35:38,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:35:38,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:35:38,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:38,358 INFO L87 Difference]: Start difference. First operand 79809 states and 113178 transitions. Second operand 3 states. [2019-12-07 19:35:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:42,176 INFO L93 Difference]: Finished difference Result 141541 states and 200671 transitions. [2019-12-07 19:35:42,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:35:42,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 19:35:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:42,265 INFO L225 Difference]: With dead ends: 141541 [2019-12-07 19:35:42,265 INFO L226 Difference]: Without dead ends: 81317 [2019-12-07 19:35:42,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:42,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81317 states. [2019-12-07 19:35:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81317 to 79809. [2019-12-07 19:35:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79809 states. [2019-12-07 19:35:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79809 states to 79809 states and 112358 transitions. [2019-12-07 19:35:46,310 INFO L78 Accepts]: Start accepts. Automaton has 79809 states and 112358 transitions. Word has length 54 [2019-12-07 19:35:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:46,310 INFO L462 AbstractCegarLoop]: Abstraction has 79809 states and 112358 transitions. [2019-12-07 19:35:46,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:35:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 79809 states and 112358 transitions. [2019-12-07 19:35:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:35:46,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:46,311 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:46,312 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1536399767, now seen corresponding path program 1 times [2019-12-07 19:35:46,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:46,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172640445] [2019-12-07 19:35:46,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:35:46,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172640445] [2019-12-07 19:35:46,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:46,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:35:46,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946204575] [2019-12-07 19:35:46,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:35:46,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:46,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:35:46,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:46,331 INFO L87 Difference]: Start difference. First operand 79809 states and 112358 transitions. Second operand 3 states. [2019-12-07 19:35:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:50,130 INFO L93 Difference]: Finished difference Result 140041 states and 197223 transitions. [2019-12-07 19:35:50,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:35:50,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 19:35:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:50,232 INFO L225 Difference]: With dead ends: 140041 [2019-12-07 19:35:50,232 INFO L226 Difference]: Without dead ends: 79817 [2019-12-07 19:35:50,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79817 states. [2019-12-07 19:35:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79817 to 79809. [2019-12-07 19:35:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79809 states. [2019-12-07 19:35:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79809 states to 79809 states and 112070 transitions. [2019-12-07 19:35:54,419 INFO L78 Accepts]: Start accepts. Automaton has 79809 states and 112070 transitions. Word has length 54 [2019-12-07 19:35:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:54,420 INFO L462 AbstractCegarLoop]: Abstraction has 79809 states and 112070 transitions. [2019-12-07 19:35:54,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:35:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 79809 states and 112070 transitions. [2019-12-07 19:35:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:35:54,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:54,421 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:54,421 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:54,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:54,421 INFO L82 PathProgramCache]: Analyzing trace with hash -594010836, now seen corresponding path program 1 times [2019-12-07 19:35:54,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:54,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135483712] [2019-12-07 19:35:54,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:54,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135483712] [2019-12-07 19:35:54,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280023548] [2019-12-07 19:35:54,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:54,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:35:54,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:35:54,539 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:54,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:35:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:35:54,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:35:54,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 7 [2019-12-07 19:35:54,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106689323] [2019-12-07 19:35:54,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:35:54,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:35:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:35:54,551 INFO L87 Difference]: Start difference. First operand 79809 states and 112070 transitions. Second operand 3 states. [2019-12-07 19:36:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:36:00,259 INFO L93 Difference]: Finished difference Result 189253 states and 266986 transitions. [2019-12-07 19:36:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:36:00,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:36:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:36:00,470 INFO L225 Difference]: With dead ends: 189253 [2019-12-07 19:36:00,470 INFO L226 Difference]: Without dead ends: 109505 [2019-12-07 19:36:00,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:36:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109505 states. [2019-12-07 19:36:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109505 to 109501. [2019-12-07 19:36:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109501 states. [2019-12-07 19:36:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109501 states to 109501 states and 152333 transitions. [2019-12-07 19:36:06,213 INFO L78 Accepts]: Start accepts. Automaton has 109501 states and 152333 transitions. Word has length 55 [2019-12-07 19:36:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:36:06,213 INFO L462 AbstractCegarLoop]: Abstraction has 109501 states and 152333 transitions. [2019-12-07 19:36:06,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:36:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 109501 states and 152333 transitions. [2019-12-07 19:36:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:36:06,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:36:06,215 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:36:06,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:36:06,417 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:36:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:36:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash 526645279, now seen corresponding path program 1 times [2019-12-07 19:36:06,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:36:06,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303864162] [2019-12-07 19:36:06,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:36:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:36:06,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303864162] [2019-12-07 19:36:06,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:36:06,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:36:06,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691329090] [2019-12-07 19:36:06,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:36:06,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:36:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:36:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:36:06,455 INFO L87 Difference]: Start difference. First operand 109501 states and 152333 transitions. Second operand 6 states. [2019-12-07 19:36:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:36:15,114 INFO L93 Difference]: Finished difference Result 269206 states and 372292 transitions. [2019-12-07 19:36:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:36:15,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 19:36:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:36:15,328 INFO L225 Difference]: With dead ends: 269206 [2019-12-07 19:36:15,328 INFO L226 Difference]: Without dead ends: 159766 [2019-12-07 19:36:15,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:36:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159766 states. [2019-12-07 19:36:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159766 to 124691. [2019-12-07 19:36:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124691 states. [2019-12-07 19:36:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124691 states to 124691 states and 174866 transitions. [2019-12-07 19:36:22,455 INFO L78 Accepts]: Start accepts. Automaton has 124691 states and 174866 transitions. Word has length 56 [2019-12-07 19:36:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:36:22,455 INFO L462 AbstractCegarLoop]: Abstraction has 124691 states and 174866 transitions. [2019-12-07 19:36:22,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:36:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 124691 states and 174866 transitions. [2019-12-07 19:36:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 19:36:22,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:36:22,457 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:36:22,457 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:36:22,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:36:22,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1571003399, now seen corresponding path program 1 times [2019-12-07 19:36:22,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:36:22,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870188731] [2019-12-07 19:36:22,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:36:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:36:22,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870188731] [2019-12-07 19:36:22,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:36:22,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:36:22,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473075301] [2019-12-07 19:36:22,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:36:22,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:36:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:36:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:36:22,486 INFO L87 Difference]: Start difference. First operand 124691 states and 174866 transitions. Second operand 4 states. [2019-12-07 19:36:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:36:28,050 INFO L93 Difference]: Finished difference Result 228634 states and 315986 transitions. [2019-12-07 19:36:28,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:36:28,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 19:36:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:36:28,182 INFO L225 Difference]: With dead ends: 228634 [2019-12-07 19:36:28,183 INFO L226 Difference]: Without dead ends: 104102 [2019-12-07 19:36:28,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:36:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104102 states. [2019-12-07 19:36:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104102 to 91381. [2019-12-07 19:36:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91381 states. [2019-12-07 19:36:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91381 states to 91381 states and 122581 transitions. [2019-12-07 19:36:34,086 INFO L78 Accepts]: Start accepts. Automaton has 91381 states and 122581 transitions. Word has length 57 [2019-12-07 19:36:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:36:34,086 INFO L462 AbstractCegarLoop]: Abstraction has 91381 states and 122581 transitions. [2019-12-07 19:36:34,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:36:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 91381 states and 122581 transitions. [2019-12-07 19:36:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 19:36:34,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:36:34,088 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:36:34,088 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:36:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:36:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1710305162, now seen corresponding path program 1 times [2019-12-07 19:36:34,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:36:34,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720332105] [2019-12-07 19:36:34,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:36:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:36:34,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720332105] [2019-12-07 19:36:34,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633645967] [2019-12-07 19:36:34,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:36:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:34,171 INFO L264 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:36:34,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:36:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:36:34,191 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:36:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:36:34,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1799527607] [2019-12-07 19:36:34,218 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2019-12-07 19:36:34,218 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:36:34,221 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:36:34,227 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:36:34,227 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:36:37,446 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:36:37,925 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-12-07 19:36:38,097 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2019-12-07 19:36:38,259 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2019-12-07 19:36:38,520 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2019-12-07 19:36:39,230 WARN L192 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2019-12-07 19:36:39,948 WARN L192 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 118 [2019-12-07 19:36:40,684 WARN L192 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 116 [2019-12-07 19:36:41,396 WARN L192 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2019-12-07 19:36:41,988 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 106 [2019-12-07 19:36:42,458 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 108 [2019-12-07 19:36:42,934 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 110 [2019-12-07 19:36:44,085 WARN L192 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 114 [2019-12-07 19:36:44,810 WARN L192 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 111 [2019-12-07 19:36:44,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:36:44,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [3, 3, 3] total 22 [2019-12-07 19:36:44,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117349699] [2019-12-07 19:36:44,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 19:36:44,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:36:44,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 19:36:44,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:36:44,862 INFO L87 Difference]: Start difference. First operand 91381 states and 122581 transitions. Second operand 19 states. [2019-12-07 19:36:46,322 WARN L192 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 122 [2019-12-07 19:36:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:36:51,380 INFO L93 Difference]: Finished difference Result 171478 states and 230105 transitions. [2019-12-07 19:36:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 19:36:51,380 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-12-07 19:36:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:36:51,480 INFO L225 Difference]: With dead ends: 171478 [2019-12-07 19:36:51,481 INFO L226 Difference]: Without dead ends: 90541 [2019-12-07 19:36:51,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 152 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:36:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90541 states. [2019-12-07 19:36:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90541 to 90537. [2019-12-07 19:36:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90537 states. [2019-12-07 19:36:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90537 states to 90537 states and 121522 transitions. [2019-12-07 19:36:55,941 INFO L78 Accepts]: Start accepts. Automaton has 90537 states and 121522 transitions. Word has length 61 [2019-12-07 19:36:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:36:55,941 INFO L462 AbstractCegarLoop]: Abstraction has 90537 states and 121522 transitions. [2019-12-07 19:36:55,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 19:36:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 90537 states and 121522 transitions. [2019-12-07 19:36:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 19:36:55,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:36:55,943 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:36:56,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:36:56,145 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:36:56,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:36:56,145 INFO L82 PathProgramCache]: Analyzing trace with hash 737556343, now seen corresponding path program 1 times [2019-12-07 19:36:56,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:36:56,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801342367] [2019-12-07 19:36:56,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:36:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:36:56,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801342367] [2019-12-07 19:36:56,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562806120] [2019-12-07 19:36:56,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:36:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:56,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 19:36:56,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:36:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:36:56,276 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:36:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:36:56,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [191847766] [2019-12-07 19:36:56,298 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2019-12-07 19:36:56,298 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:36:56,299 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:36:56,299 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:36:56,299 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:36:57,547 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-12-07 19:36:58,861 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:36:59,228 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 110 [2019-12-07 19:36:59,766 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-12-07 19:36:59,973 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2019-12-07 19:37:00,135 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2019-12-07 19:37:00,933 WARN L192 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 110 [2019-12-07 19:37:01,309 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 105 [2019-12-07 19:37:01,727 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 105 [2019-12-07 19:37:02,097 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 91 [2019-12-07 19:37:02,496 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 96 [2019-12-07 19:37:02,806 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 98 [2019-12-07 19:37:03,155 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2019-12-07 19:37:03,507 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 105 [2019-12-07 19:37:03,856 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2019-12-07 19:37:04,414 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 88 [2019-12-07 19:37:04,821 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2019-12-07 19:37:05,341 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2019-12-07 19:37:05,851 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 115 [2019-12-07 19:37:06,373 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 117 [2019-12-07 19:37:06,801 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 115 [2019-12-07 19:37:07,410 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 108 [2019-12-07 19:37:07,412 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:37:07,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:37:07,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2019-12-07 19:37:07,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615450565] [2019-12-07 19:37:07,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 19:37:07,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:07,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 19:37:07,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 19:37:07,414 INFO L87 Difference]: Start difference. First operand 90537 states and 121522 transitions. Second operand 13 states. [2019-12-07 19:37:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:15,289 INFO L93 Difference]: Finished difference Result 212814 states and 286745 transitions. [2019-12-07 19:37:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 19:37:15,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-07 19:37:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:15,446 INFO L225 Difference]: With dead ends: 212814 [2019-12-07 19:37:15,446 INFO L226 Difference]: Without dead ends: 122497 [2019-12-07 19:37:15,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 184 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=872, Invalid=4098, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 19:37:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122497 states. [2019-12-07 19:37:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122497 to 61111. [2019-12-07 19:37:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61111 states. [2019-12-07 19:37:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61111 states to 61111 states and 82511 transitions. [2019-12-07 19:37:19,282 INFO L78 Accepts]: Start accepts. Automaton has 61111 states and 82511 transitions. Word has length 64 [2019-12-07 19:37:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:19,282 INFO L462 AbstractCegarLoop]: Abstraction has 61111 states and 82511 transitions. [2019-12-07 19:37:19,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 19:37:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 61111 states and 82511 transitions. [2019-12-07 19:37:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:37:19,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:19,284 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:19,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:37:19,485 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash 73482815, now seen corresponding path program 1 times [2019-12-07 19:37:19,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:19,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95149866] [2019-12-07 19:37:19,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:37:19,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95149866] [2019-12-07 19:37:19,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:37:19,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:37:19,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968683845] [2019-12-07 19:37:19,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:37:19,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:19,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:37:19,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:19,504 INFO L87 Difference]: Start difference. First operand 61111 states and 82511 transitions. Second operand 3 states. [2019-12-07 19:37:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:21,306 INFO L93 Difference]: Finished difference Result 88524 states and 120158 transitions. [2019-12-07 19:37:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:37:21,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 19:37:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:21,333 INFO L225 Difference]: With dead ends: 88524 [2019-12-07 19:37:21,334 INFO L226 Difference]: Without dead ends: 27680 [2019-12-07 19:37:21,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27680 states. [2019-12-07 19:37:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27680 to 27043. [2019-12-07 19:37:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27043 states. [2019-12-07 19:37:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27043 states to 27043 states and 35366 transitions. [2019-12-07 19:37:22,870 INFO L78 Accepts]: Start accepts. Automaton has 27043 states and 35366 transitions. Word has length 66 [2019-12-07 19:37:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:22,870 INFO L462 AbstractCegarLoop]: Abstraction has 27043 states and 35366 transitions. [2019-12-07 19:37:22,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:37:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 27043 states and 35366 transitions. [2019-12-07 19:37:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:37:22,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:22,872 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:22,872 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1103121504, now seen corresponding path program 1 times [2019-12-07 19:37:22,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:22,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079740282] [2019-12-07 19:37:22,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:37:22,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079740282] [2019-12-07 19:37:22,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:37:22,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:37:22,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007213144] [2019-12-07 19:37:22,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:37:22,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:22,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:37:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:22,899 INFO L87 Difference]: Start difference. First operand 27043 states and 35366 transitions. Second operand 3 states. [2019-12-07 19:37:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:24,401 INFO L93 Difference]: Finished difference Result 53825 states and 70422 transitions. [2019-12-07 19:37:24,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:37:24,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 19:37:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:24,427 INFO L225 Difference]: With dead ends: 53825 [2019-12-07 19:37:24,427 INFO L226 Difference]: Without dead ends: 27049 [2019-12-07 19:37:24,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27049 states. [2019-12-07 19:37:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27049 to 27043. [2019-12-07 19:37:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27043 states. [2019-12-07 19:37:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27043 states to 27043 states and 35301 transitions. [2019-12-07 19:37:26,045 INFO L78 Accepts]: Start accepts. Automaton has 27043 states and 35301 transitions. Word has length 66 [2019-12-07 19:37:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:26,046 INFO L462 AbstractCegarLoop]: Abstraction has 27043 states and 35301 transitions. [2019-12-07 19:37:26,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:37:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 27043 states and 35301 transitions. [2019-12-07 19:37:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:37:26,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:26,047 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:26,047 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1413048779, now seen corresponding path program 1 times [2019-12-07 19:37:26,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:26,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463325812] [2019-12-07 19:37:26,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:37:26,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463325812] [2019-12-07 19:37:26,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:37:26,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:37:26,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936342471] [2019-12-07 19:37:26,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:37:26,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:26,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:37:26,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:37:26,078 INFO L87 Difference]: Start difference. First operand 27043 states and 35301 transitions. Second operand 5 states. [2019-12-07 19:37:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:29,031 INFO L93 Difference]: Finished difference Result 75978 states and 99346 transitions. [2019-12-07 19:37:29,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:37:29,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-07 19:37:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:29,082 INFO L225 Difference]: With dead ends: 75978 [2019-12-07 19:37:29,082 INFO L226 Difference]: Without dead ends: 49803 [2019-12-07 19:37:29,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:37:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49803 states. [2019-12-07 19:37:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49803 to 29713. [2019-12-07 19:37:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29713 states. [2019-12-07 19:37:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29713 states to 29713 states and 38431 transitions. [2019-12-07 19:37:30,948 INFO L78 Accepts]: Start accepts. Automaton has 29713 states and 38431 transitions. Word has length 67 [2019-12-07 19:37:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:30,949 INFO L462 AbstractCegarLoop]: Abstraction has 29713 states and 38431 transitions. [2019-12-07 19:37:30,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:37:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29713 states and 38431 transitions. [2019-12-07 19:37:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:37:30,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:30,950 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:30,950 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:30,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash -772614741, now seen corresponding path program 1 times [2019-12-07 19:37:30,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:30,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123685317] [2019-12-07 19:37:30,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:37:30,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123685317] [2019-12-07 19:37:30,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:37:30,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:37:30,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110016318] [2019-12-07 19:37:30,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:37:30,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:37:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:30,968 INFO L87 Difference]: Start difference. First operand 29713 states and 38431 transitions. Second operand 3 states. [2019-12-07 19:37:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:32,580 INFO L93 Difference]: Finished difference Result 51134 states and 66146 transitions. [2019-12-07 19:37:32,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:37:32,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 19:37:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:32,609 INFO L225 Difference]: With dead ends: 51134 [2019-12-07 19:37:32,609 INFO L226 Difference]: Without dead ends: 27754 [2019-12-07 19:37:32,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27754 states. [2019-12-07 19:37:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27754 to 27237. [2019-12-07 19:37:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27237 states. [2019-12-07 19:37:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27237 states to 27237 states and 35160 transitions. [2019-12-07 19:37:34,340 INFO L78 Accepts]: Start accepts. Automaton has 27237 states and 35160 transitions. Word has length 68 [2019-12-07 19:37:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:34,340 INFO L462 AbstractCegarLoop]: Abstraction has 27237 states and 35160 transitions. [2019-12-07 19:37:34,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:37:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 27237 states and 35160 transitions. [2019-12-07 19:37:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 19:37:34,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:34,342 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:34,342 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:34,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash -700454067, now seen corresponding path program 1 times [2019-12-07 19:37:34,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:34,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849619841] [2019-12-07 19:37:34,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:37:34,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849619841] [2019-12-07 19:37:34,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768334764] [2019-12-07 19:37:34,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:37:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:34,473 INFO L264 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 19:37:34,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:37:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:37:34,508 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:37:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:37:34,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:37:34,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [10] total 14 [2019-12-07 19:37:34,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749870003] [2019-12-07 19:37:34,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:37:34,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:34,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:37:34,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:37:34,526 INFO L87 Difference]: Start difference. First operand 27237 states and 35160 transitions. Second operand 7 states. [2019-12-07 19:37:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:37,171 INFO L93 Difference]: Finished difference Result 70606 states and 91107 transitions. [2019-12-07 19:37:37,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:37:37,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-07 19:37:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:37,210 INFO L225 Difference]: With dead ends: 70606 [2019-12-07 19:37:37,210 INFO L226 Difference]: Without dead ends: 43523 [2019-12-07 19:37:37,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:37:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43523 states. [2019-12-07 19:37:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43523 to 23229. [2019-12-07 19:37:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23229 states. [2019-12-07 19:37:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23229 states to 23229 states and 29793 transitions. [2019-12-07 19:37:38,641 INFO L78 Accepts]: Start accepts. Automaton has 23229 states and 29793 transitions. Word has length 74 [2019-12-07 19:37:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:38,641 INFO L462 AbstractCegarLoop]: Abstraction has 23229 states and 29793 transitions. [2019-12-07 19:37:38,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:37:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 23229 states and 29793 transitions. [2019-12-07 19:37:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 19:37:38,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:38,643 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:38,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:37:38,844 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:38,845 INFO L82 PathProgramCache]: Analyzing trace with hash 48317127, now seen corresponding path program 1 times [2019-12-07 19:37:38,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:38,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993427249] [2019-12-07 19:37:38,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:37:38,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993427249] [2019-12-07 19:37:38,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:37:38,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:37:38,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635065634] [2019-12-07 19:37:38,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:37:38,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:38,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:37:38,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:38,876 INFO L87 Difference]: Start difference. First operand 23229 states and 29793 transitions. Second operand 3 states. [2019-12-07 19:37:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:39,825 INFO L93 Difference]: Finished difference Result 29866 states and 38271 transitions. [2019-12-07 19:37:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:37:39,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-12-07 19:37:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:39,840 INFO L225 Difference]: With dead ends: 29866 [2019-12-07 19:37:39,840 INFO L226 Difference]: Without dead ends: 15903 [2019-12-07 19:37:39,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15903 states. [2019-12-07 19:37:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15903 to 9978. [2019-12-07 19:37:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9978 states. [2019-12-07 19:37:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9978 states to 9978 states and 12734 transitions. [2019-12-07 19:37:40,561 INFO L78 Accepts]: Start accepts. Automaton has 9978 states and 12734 transitions. Word has length 76 [2019-12-07 19:37:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:40,562 INFO L462 AbstractCegarLoop]: Abstraction has 9978 states and 12734 transitions. [2019-12-07 19:37:40,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:37:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9978 states and 12734 transitions. [2019-12-07 19:37:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 19:37:40,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:40,563 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:40,563 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1716952341, now seen corresponding path program 1 times [2019-12-07 19:37:40,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:40,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506860217] [2019-12-07 19:37:40,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:37:40,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506860217] [2019-12-07 19:37:40,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:37:40,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:37:40,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682242439] [2019-12-07 19:37:40,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:37:40,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:40,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:37:40,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:37:40,585 INFO L87 Difference]: Start difference. First operand 9978 states and 12734 transitions. Second operand 4 states. [2019-12-07 19:37:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:41,828 INFO L93 Difference]: Finished difference Result 25469 states and 32609 transitions. [2019-12-07 19:37:41,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:37:41,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 19:37:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:41,840 INFO L225 Difference]: With dead ends: 25469 [2019-12-07 19:37:41,841 INFO L226 Difference]: Without dead ends: 16030 [2019-12-07 19:37:41,846 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 19:37:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16030 states. [2019-12-07 19:37:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16030 to 9616. [2019-12-07 19:37:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9616 states. [2019-12-07 19:37:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 12088 transitions. [2019-12-07 19:37:42,548 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 12088 transitions. Word has length 78 [2019-12-07 19:37:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:42,548 INFO L462 AbstractCegarLoop]: Abstraction has 9616 states and 12088 transitions. [2019-12-07 19:37:42,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:37:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 12088 transitions. [2019-12-07 19:37:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 19:37:42,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:42,550 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:42,550 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:42,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1439272877, now seen corresponding path program 1 times [2019-12-07 19:37:42,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:42,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981023106] [2019-12-07 19:37:42,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:37:42,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981023106] [2019-12-07 19:37:42,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:37:42,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:37:42,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781596550] [2019-12-07 19:37:42,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:37:42,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:37:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:42,565 INFO L87 Difference]: Start difference. First operand 9616 states and 12088 transitions. Second operand 3 states. [2019-12-07 19:37:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:43,240 INFO L93 Difference]: Finished difference Result 18943 states and 23844 transitions. [2019-12-07 19:37:43,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:37:43,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-07 19:37:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:43,247 INFO L225 Difference]: With dead ends: 18943 [2019-12-07 19:37:43,247 INFO L226 Difference]: Without dead ends: 9504 [2019-12-07 19:37:43,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9504 states. [2019-12-07 19:37:43,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9504 to 9243. [2019-12-07 19:37:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-07 19:37:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 11444 transitions. [2019-12-07 19:37:43,911 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 11444 transitions. Word has length 78 [2019-12-07 19:37:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:43,911 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 11444 transitions. [2019-12-07 19:37:43,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:37:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 11444 transitions. [2019-12-07 19:37:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 19:37:43,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:43,913 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:43,913 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:43,913 INFO L82 PathProgramCache]: Analyzing trace with hash -480205745, now seen corresponding path program 1 times [2019-12-07 19:37:43,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:43,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757583433] [2019-12-07 19:37:43,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:37:43,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757583433] [2019-12-07 19:37:43,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:37:43,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:37:43,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351418767] [2019-12-07 19:37:43,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:37:43,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:37:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:37:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:43,928 INFO L87 Difference]: Start difference. First operand 9243 states and 11444 transitions. Second operand 3 states. [2019-12-07 19:37:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:44,531 INFO L93 Difference]: Finished difference Result 9247 states and 11446 transitions. [2019-12-07 19:37:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:37:44,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-07 19:37:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:44,537 INFO L225 Difference]: With dead ends: 9247 [2019-12-07 19:37:44,537 INFO L226 Difference]: Without dead ends: 8827 [2019-12-07 19:37:44,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:37:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8827 states. [2019-12-07 19:37:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8827 to 8827. [2019-12-07 19:37:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8827 states. [2019-12-07 19:37:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8827 states to 8827 states and 10936 transitions. [2019-12-07 19:37:45,164 INFO L78 Accepts]: Start accepts. Automaton has 8827 states and 10936 transitions. Word has length 80 [2019-12-07 19:37:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:45,164 INFO L462 AbstractCegarLoop]: Abstraction has 8827 states and 10936 transitions. [2019-12-07 19:37:45,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:37:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 8827 states and 10936 transitions. [2019-12-07 19:37:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 19:37:45,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:45,165 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:37:45,166 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:37:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1854904720, now seen corresponding path program 1 times [2019-12-07 19:37:45,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:37:45,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746782640] [2019-12-07 19:37:45,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:37:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:37:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:37:45,215 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:37:45,216 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:37:45,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:37:45 BoogieIcfgContainer [2019-12-07 19:37:45,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:37:45,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:37:45,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:37:45,289 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:37:45,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:32" (3/4) ... [2019-12-07 19:37:45,290 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:37:45,356 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_506a26ba-ca9c-48a5-b1af-15c5597fa354/bin/utaipan/witness.graphml [2019-12-07 19:37:45,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:37:45,357 INFO L168 Benchmark]: Toolchain (without parser) took 193551.28 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.2 GB). Free memory was 938.1 MB in the beginning and 1.6 GB in the end (delta: -613.6 MB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2019-12-07 19:37:45,357 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:37:45,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:37:45,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.90 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:37:45,358 INFO L168 Benchmark]: Boogie Preprocessor took 26.33 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:37:45,358 INFO L168 Benchmark]: RCFGBuilder took 668.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 978.1 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:37:45,359 INFO L168 Benchmark]: TraceAbstraction took 192520.01 ms. Allocated memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 978.1 MB in the beginning and 1.6 GB in the end (delta: -589.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2019-12-07 19:37:45,359 INFO L168 Benchmark]: Witness Printer took 68.21 ms. Allocated memory is still 6.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:37:45,360 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 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.90 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.33 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 668.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 978.1 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 192520.01 ms. Allocated memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 978.1 MB in the beginning and 1.6 GB in the end (delta: -589.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 68.21 ms. Allocated memory is still 6.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L107] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L117] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L175] COND FALSE !((int )P_2_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L185] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L277] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp) [L362] P_1_st = 1 [L72] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L83] COND TRUE i < max_loop [L49] COND TRUE i___0 == 0 [L50] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L87] num += 1 [L88] P_1_pc = 1 [L89] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___0) [L377] P_2_st = 1 [L130] COND TRUE (int )P_2_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L141] COND TRUE i < max_loop [L49] COND FALSE !(i___0 == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L52] COND TRUE i___0 == 1 [L53] data_1 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L145] num += 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L147] COND FALSE !(\read(timer)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L157] P_2_pc = 1 [L158] P_2_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND TRUE \read(tmp___1) [L392] C_1_st = 1 [L196] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L199] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L214] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L216] COND FALSE !(num == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L227] num -= 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L228] COND FALSE !(! (num >= 0)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L23] char c ; [L24] char __retres3 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L27] COND FALSE !(i___0 == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L31] COND TRUE i___0 == 1 [L32] __retres3 = data_1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L42] return (__retres3); [L236] c = read_data(num) [L237] i += 1 [L238] C_1_pc = 2 [L239] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND FALSE !((int )P_1_st == 0) [L321] COND FALSE !((int )P_2_st == 0) [L325] COND FALSE !((int )C_1_st == 0) [L333] __retres1 = 0 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L544] kernel_st = 2 [L548] kernel_st = 3 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L107] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L108] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L117] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L175] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L176] COND FALSE !((int )P_2_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L185] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L267] COND TRUE (int )C_1_pc == 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L268] COND FALSE !((int )C_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L277] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) [L314] int __retres1 ; [L317] COND FALSE !((int )P_1_st == 0) [L321] COND FALSE !((int )P_2_st == 0) [L325] COND FALSE !((int )C_1_st == 0) [L333] __retres1 = 0 [L335] return (__retres1); [L554] tmp = exists_runnable_thread() [L556] COND TRUE tmp == 0 [L558] kernel_st = 4 [L428] C_1_ev = 1 [L429] P_1_ev = 1 [L430] P_2_ev = 1 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L107] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L108] COND TRUE (int )P_1_ev == 1 [L109] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND TRUE \read(tmp) [L468] P_1_st = 0 [L172] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L175] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L176] COND TRUE (int )P_2_ev == 1 [L177] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND TRUE \read(tmp___0) [L476] P_2_st = 0 [L254] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L267] COND TRUE (int )C_1_pc == 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L268] COND TRUE (int )C_1_ev == 1 [L269] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND TRUE \read(tmp___1) [L484] C_1_st = 0 [L439] COND TRUE (int )P_1_ev == 1 [L440] P_1_ev = 2 [L444] COND TRUE (int )P_2_ev == 1 [L445] P_2_ev = 2 [L449] COND TRUE (int )C_1_ev == 1 [L450] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L504] int tmp ; [L505] int __retres2 ; [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L509] tmp = exists_runnable_thread() [L511] COND TRUE \read(tmp) [L512] __retres2 = 0 [L519] return (__retres2); [L567] tmp___0 = stop_simulation() [L569] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp) [L362] P_1_st = 1 [L72] COND FALSE !((int )P_1_pc == 0) [L75] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L83] COND TRUE i < max_loop [L49] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L52] COND TRUE i___0 == 1 [L53] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L87] num += 1 [L88] P_1_pc = 1 [L89] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___0) [L377] P_2_st = 1 [L130] COND FALSE !((int )P_2_pc == 0) [L133] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L141] COND TRUE i < max_loop [L49] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L52] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L9] __VERIFIER_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 4 error locations. Result: UNSAFE, OverallTime: 192.4s, OverallIterations: 38, TraceHistogramMax: 4, AutomataDifference: 89.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7901 SDtfs, 8622 SDslu, 11964 SDs, 0 SdLazy, 2688 SolverSat, 389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 897 GetRequests, 666 SyntacticMatches, 27 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132591occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 78.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 206804 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2216 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2343 ConstructedInterpolants, 0 QuantifiedInterpolants, 274165 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1061 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 45 InterpolantComputations, 37 PerfectInterpolantSequences, 582/605 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 3229, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 89, DAG_INTERPRETER_EARLY_EXITS: 25, TOOLS_POST_APPLICATIONS: 160, TOOLS_POST_TIME[ms]: 97, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 160, TOOLS_QUANTIFIERELIM_TIME[ms]: 68, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 2, FLUID_QUERY_TIME[ms]: 6, FLUID_QUERIES: 207, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 25, DOMAIN_JOIN_TIME[ms]: 2552, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME[ms]: 224, DOMAIN_ISSUBSETEQ_APPLICATIONS: 8, DOMAIN_ISSUBSETEQ_TIME[ms]: 19, DOMAIN_ISBOTTOM_APPLICATIONS: 89, DOMAIN_ISBOTTOM_TIME[ms]: 157, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2157, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2157, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 8, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 7, DAG_COMPRESSION_TIME[ms]: 131, DAG_COMPRESSION_PROCESSED_NODES: 10285, DAG_COMPRESSION_RETAINED_NODES: 180, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...