./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a08b839794d511e255b2cbb9b4715d014c32f56d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-7b2dab5 [2020-12-09 07:03:23,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:03:23,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:03:23,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:03:23,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:03:23,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:03:23,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:03:23,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:03:23,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:03:23,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:03:23,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:03:23,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:03:23,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:03:23,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:03:23,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:03:23,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:03:23,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:03:23,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:03:23,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:03:23,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:03:23,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:03:23,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:03:23,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:03:23,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:03:23,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:03:23,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:03:23,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:03:23,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:03:23,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:03:23,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:03:23,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:03:23,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:03:23,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:03:23,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:03:23,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:03:23,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:03:23,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:03:23,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:03:23,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:03:23,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:03:23,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:03:23,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 07:03:23,221 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:03:23,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:03:23,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:03:23,222 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:03:23,222 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:03:23,223 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:03:23,223 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 07:03:23,223 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:03:23,223 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:03:23,223 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 07:03:23,223 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 07:03:23,223 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:03:23,223 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 07:03:23,223 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 07:03:23,224 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 07:03:23,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:03:23,224 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:03:23,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 07:03:23,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:03:23,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 07:03:23,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:03:23,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:03:23,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:03:23,226 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_36f4adf6-d158-46ba-808e-0602a86c3815/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(reach_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 -> a08b839794d511e255b2cbb9b4715d014c32f56d [2020-12-09 07:03:23,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:03:23,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:03:23,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:03:23,436 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:03:23,437 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:03:23,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-12-09 07:03:23,480 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/data/49598c1ce/b4ed65de964748698b4278d901c1d5fe/FLAG2d0a07c80 [2020-12-09 07:03:23,913 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:03:23,914 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-12-09 07:03:23,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/data/49598c1ce/b4ed65de964748698b4278d901c1d5fe/FLAG2d0a07c80 [2020-12-09 07:03:23,930 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/data/49598c1ce/b4ed65de964748698b4278d901c1d5fe [2020-12-09 07:03:23,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:03:23,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:03:23,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:03:23,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:03:23,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:03:23,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:03:23" (1/1) ... [2020-12-09 07:03:23,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732d3eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:23, skipping insertion in model container [2020-12-09 07:03:23,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:03:23" (1/1) ... [2020-12-09 07:03:23,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:03:23,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:03:24,062 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2020-12-09 07:03:24,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:03:24,107 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:03:24,115 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2020-12-09 07:03:24,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:03:24,150 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:03:24,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24 WrapperNode [2020-12-09 07:03:24,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:03:24,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:03:24,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:03:24,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:03:24,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:03:24,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:03:24,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:03:24,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:03:24,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... [2020-12-09 07:03:24,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:03:24,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:03:24,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:03:24,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:03:24,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/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 [2020-12-09 07:03:24,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:03:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 07:03:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:03:24,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:03:25,365 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:03:25,365 INFO L299 CfgBuilder]: Removed 105 assume(true) statements. [2020-12-09 07:03:25,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:03:25 BoogieIcfgContainer [2020-12-09 07:03:25,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:03:25,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:03:25,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:03:25,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:03:25,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:03:23" (1/3) ... [2020-12-09 07:03:25,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3218ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:03:25, skipping insertion in model container [2020-12-09 07:03:25,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:24" (2/3) ... [2020-12-09 07:03:25,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3218ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:03:25, skipping insertion in model container [2020-12-09 07:03:25,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:03:25" (3/3) ... [2020-12-09 07:03:25,375 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-12-09 07:03:25,384 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:03:25,387 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 07:03:25,394 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-09 07:03:25,412 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:03:25,413 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 07:03:25,413 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:03:25,413 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:03:25,413 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:03:25,413 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:03:25,413 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:03:25,413 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:03:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2020-12-09 07:03:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 07:03:25,430 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:25,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:03:25,431 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1273911471, now seen corresponding path program 1 times [2020-12-09 07:03:25,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:25,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545279532] [2020-12-09 07:03:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:25,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545279532] [2020-12-09 07:03:25,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:25,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:03:25,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445066770] [2020-12-09 07:03:25,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:03:25,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:25,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:03:25,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:03:25,596 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2020-12-09 07:03:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:25,669 INFO L93 Difference]: Finished difference Result 285 states and 438 transitions. [2020-12-09 07:03:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:03:25,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-09 07:03:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:25,682 INFO L225 Difference]: With dead ends: 285 [2020-12-09 07:03:25,683 INFO L226 Difference]: Without dead ends: 178 [2020-12-09 07:03:25,686 INFO L677 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 [2020-12-09 07:03:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-12-09 07:03:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2020-12-09 07:03:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-09 07:03:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 246 transitions. [2020-12-09 07:03:25,734 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 246 transitions. Word has length 19 [2020-12-09 07:03:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:25,735 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 246 transitions. [2020-12-09 07:03:25,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:03:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 246 transitions. [2020-12-09 07:03:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 07:03:25,737 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:25,738 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:03:25,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 07:03:25,738 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:25,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1551439930, now seen corresponding path program 1 times [2020-12-09 07:03:25,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:25,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053414996] [2020-12-09 07:03:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 07:03:25,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053414996] [2020-12-09 07:03:25,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:25,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:25,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731790583] [2020-12-09 07:03:25,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:25,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:25,793 INFO L87 Difference]: Start difference. First operand 168 states and 246 transitions. Second operand 4 states. [2020-12-09 07:03:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:25,894 INFO L93 Difference]: Finished difference Result 529 states and 768 transitions. [2020-12-09 07:03:25,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:25,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-09 07:03:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:25,899 INFO L225 Difference]: With dead ends: 529 [2020-12-09 07:03:25,899 INFO L226 Difference]: Without dead ends: 366 [2020-12-09 07:03:25,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:03:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2020-12-09 07:03:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 287. [2020-12-09 07:03:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-12-09 07:03:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 413 transitions. [2020-12-09 07:03:25,928 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 413 transitions. Word has length 36 [2020-12-09 07:03:25,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:25,929 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 413 transitions. [2020-12-09 07:03:25,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 413 transitions. [2020-12-09 07:03:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 07:03:25,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:25,932 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:03:25,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 07:03:25,933 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:25,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:25,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1824552743, now seen corresponding path program 1 times [2020-12-09 07:03:25,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:25,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151829761] [2020-12-09 07:03:25,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:26,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151829761] [2020-12-09 07:03:26,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:26,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:26,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628788323] [2020-12-09 07:03:26,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:26,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:26,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:26,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:26,015 INFO L87 Difference]: Start difference. First operand 287 states and 413 transitions. Second operand 4 states. [2020-12-09 07:03:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:26,109 INFO L93 Difference]: Finished difference Result 901 states and 1285 transitions. [2020-12-09 07:03:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:26,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-09 07:03:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:26,112 INFO L225 Difference]: With dead ends: 901 [2020-12-09 07:03:26,112 INFO L226 Difference]: Without dead ends: 622 [2020-12-09 07:03:26,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:03:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-12-09 07:03:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 498. [2020-12-09 07:03:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2020-12-09 07:03:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 704 transitions. [2020-12-09 07:03:26,136 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 704 transitions. Word has length 36 [2020-12-09 07:03:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:26,136 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 704 transitions. [2020-12-09 07:03:26,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 704 transitions. [2020-12-09 07:03:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 07:03:26,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:26,139 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:03:26,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 07:03:26,139 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1191089818, now seen corresponding path program 1 times [2020-12-09 07:03:26,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:26,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917658225] [2020-12-09 07:03:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:26,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917658225] [2020-12-09 07:03:26,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:26,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:26,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467182828] [2020-12-09 07:03:26,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:26,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:26,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:26,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:26,200 INFO L87 Difference]: Start difference. First operand 498 states and 704 transitions. Second operand 4 states. [2020-12-09 07:03:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:26,307 INFO L93 Difference]: Finished difference Result 1710 states and 2434 transitions. [2020-12-09 07:03:26,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:26,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-09 07:03:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:26,313 INFO L225 Difference]: With dead ends: 1710 [2020-12-09 07:03:26,313 INFO L226 Difference]: Without dead ends: 1222 [2020-12-09 07:03:26,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-12-09 07:03:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 910. [2020-12-09 07:03:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2020-12-09 07:03:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1280 transitions. [2020-12-09 07:03:26,358 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1280 transitions. Word has length 36 [2020-12-09 07:03:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:26,359 INFO L481 AbstractCegarLoop]: Abstraction has 910 states and 1280 transitions. [2020-12-09 07:03:26,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1280 transitions. [2020-12-09 07:03:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 07:03:26,360 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:26,360 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:03:26,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 07:03:26,361 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1337019147, now seen corresponding path program 1 times [2020-12-09 07:03:26,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:26,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957726365] [2020-12-09 07:03:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:26,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957726365] [2020-12-09 07:03:26,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:26,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:26,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794056087] [2020-12-09 07:03:26,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:26,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:26,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:26,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:26,412 INFO L87 Difference]: Start difference. First operand 910 states and 1280 transitions. Second operand 4 states. [2020-12-09 07:03:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:26,535 INFO L93 Difference]: Finished difference Result 3068 states and 4336 transitions. [2020-12-09 07:03:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:26,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-12-09 07:03:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:26,545 INFO L225 Difference]: With dead ends: 3068 [2020-12-09 07:03:26,545 INFO L226 Difference]: Without dead ends: 2168 [2020-12-09 07:03:26,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2020-12-09 07:03:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 1662. [2020-12-09 07:03:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2020-12-09 07:03:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2316 transitions. [2020-12-09 07:03:26,602 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2316 transitions. Word has length 37 [2020-12-09 07:03:26,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:26,602 INFO L481 AbstractCegarLoop]: Abstraction has 1662 states and 2316 transitions. [2020-12-09 07:03:26,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2316 transitions. [2020-12-09 07:03:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 07:03:26,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:26,604 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:03:26,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 07:03:26,604 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:26,604 INFO L82 PathProgramCache]: Analyzing trace with hash 202332346, now seen corresponding path program 1 times [2020-12-09 07:03:26,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:26,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536416899] [2020-12-09 07:03:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:26,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536416899] [2020-12-09 07:03:26,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:26,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:26,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040065370] [2020-12-09 07:03:26,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:03:26,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:26,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:03:26,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:03:26,650 INFO L87 Difference]: Start difference. First operand 1662 states and 2316 transitions. Second operand 3 states. [2020-12-09 07:03:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:26,726 INFO L93 Difference]: Finished difference Result 2910 states and 4146 transitions. [2020-12-09 07:03:26,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:03:26,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-12-09 07:03:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:26,736 INFO L225 Difference]: With dead ends: 2910 [2020-12-09 07:03:26,736 INFO L226 Difference]: Without dead ends: 1910 [2020-12-09 07:03:26,737 INFO L677 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 [2020-12-09 07:03:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2020-12-09 07:03:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1798. [2020-12-09 07:03:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2020-12-09 07:03:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2524 transitions. [2020-12-09 07:03:26,794 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2524 transitions. Word has length 38 [2020-12-09 07:03:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:26,794 INFO L481 AbstractCegarLoop]: Abstraction has 1798 states and 2524 transitions. [2020-12-09 07:03:26,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:03:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2524 transitions. [2020-12-09 07:03:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 07:03:26,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:26,799 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:26,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 07:03:26,799 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:26,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:26,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2093916787, now seen corresponding path program 1 times [2020-12-09 07:03:26,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:26,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073535482] [2020-12-09 07:03:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:26,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073535482] [2020-12-09 07:03:26,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:26,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:26,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252425731] [2020-12-09 07:03:26,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:03:26,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:26,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:03:26,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:03:26,852 INFO L87 Difference]: Start difference. First operand 1798 states and 2524 transitions. Second operand 3 states. [2020-12-09 07:03:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:26,924 INFO L93 Difference]: Finished difference Result 3078 states and 4354 transitions. [2020-12-09 07:03:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:03:26,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-09 07:03:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:26,932 INFO L225 Difference]: With dead ends: 3078 [2020-12-09 07:03:26,932 INFO L226 Difference]: Without dead ends: 1942 [2020-12-09 07:03:26,934 INFO L677 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 [2020-12-09 07:03:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2020-12-09 07:03:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1798. [2020-12-09 07:03:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2020-12-09 07:03:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2436 transitions. [2020-12-09 07:03:26,990 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2436 transitions. Word has length 54 [2020-12-09 07:03:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:26,990 INFO L481 AbstractCegarLoop]: Abstraction has 1798 states and 2436 transitions. [2020-12-09 07:03:26,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:03:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2436 transitions. [2020-12-09 07:03:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 07:03:26,993 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:26,993 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:26,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 07:03:26,993 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1227561550, now seen corresponding path program 1 times [2020-12-09 07:03:26,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:26,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357862219] [2020-12-09 07:03:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:27,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357862219] [2020-12-09 07:03:27,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:27,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:03:27,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742196685] [2020-12-09 07:03:27,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:03:27,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:27,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:03:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:03:27,038 INFO L87 Difference]: Start difference. First operand 1798 states and 2436 transitions. Second operand 5 states. [2020-12-09 07:03:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:27,176 INFO L93 Difference]: Finished difference Result 3336 states and 4546 transitions. [2020-12-09 07:03:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:03:27,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-09 07:03:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:27,182 INFO L225 Difference]: With dead ends: 3336 [2020-12-09 07:03:27,182 INFO L226 Difference]: Without dead ends: 1548 [2020-12-09 07:03:27,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:03:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2020-12-09 07:03:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1383. [2020-12-09 07:03:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2020-12-09 07:03:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1901 transitions. [2020-12-09 07:03:27,228 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1901 transitions. Word has length 54 [2020-12-09 07:03:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:27,228 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 1901 transitions. [2020-12-09 07:03:27,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:03:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1901 transitions. [2020-12-09 07:03:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-09 07:03:27,230 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:27,230 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:27,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 07:03:27,230 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash 114756858, now seen corresponding path program 1 times [2020-12-09 07:03:27,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:27,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508765463] [2020-12-09 07:03:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 07:03:27,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508765463] [2020-12-09 07:03:27,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321849787] [2020-12-09 07:03:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/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 [2020-12-09 07:03:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:27,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 07:03:27,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:03:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:27,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:03:27,515 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 07:03:27,515 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 07:03:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:27,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 07:03:27,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 07:03:27,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803621465] [2020-12-09 07:03:27,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:03:27,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:03:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:03:27,556 INFO L87 Difference]: Start difference. First operand 1383 states and 1901 transitions. Second operand 3 states. [2020-12-09 07:03:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:27,658 INFO L93 Difference]: Finished difference Result 2755 states and 3791 transitions. [2020-12-09 07:03:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:03:27,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-09 07:03:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:27,667 INFO L225 Difference]: With dead ends: 2755 [2020-12-09 07:03:27,667 INFO L226 Difference]: Without dead ends: 1383 [2020-12-09 07:03:27,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:03:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-12-09 07:03:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2020-12-09 07:03:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2020-12-09 07:03:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1873 transitions. [2020-12-09 07:03:27,749 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1873 transitions. Word has length 56 [2020-12-09 07:03:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:27,749 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 1873 transitions. [2020-12-09 07:03:27,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:03:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1873 transitions. [2020-12-09 07:03:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-09 07:03:27,751 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:27,751 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:27,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-09 07:03:27,952 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1255108569, now seen corresponding path program 1 times [2020-12-09 07:03:27,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:27,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744534925] [2020-12-09 07:03:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:27,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744534925] [2020-12-09 07:03:27,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:27,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:27,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803232211] [2020-12-09 07:03:27,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:03:27,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:27,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:03:27,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:03:27,995 INFO L87 Difference]: Start difference. First operand 1383 states and 1873 transitions. Second operand 3 states. [2020-12-09 07:03:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:28,076 INFO L93 Difference]: Finished difference Result 2315 states and 3145 transitions. [2020-12-09 07:03:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:03:28,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-09 07:03:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:28,082 INFO L225 Difference]: With dead ends: 2315 [2020-12-09 07:03:28,082 INFO L226 Difference]: Without dead ends: 943 [2020-12-09 07:03:28,085 INFO L677 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 [2020-12-09 07:03:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2020-12-09 07:03:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 926. [2020-12-09 07:03:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2020-12-09 07:03:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1208 transitions. [2020-12-09 07:03:28,130 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1208 transitions. Word has length 56 [2020-12-09 07:03:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:28,130 INFO L481 AbstractCegarLoop]: Abstraction has 926 states and 1208 transitions. [2020-12-09 07:03:28,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:03:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1208 transitions. [2020-12-09 07:03:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 07:03:28,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:28,132 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:28,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 07:03:28,132 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash 423527735, now seen corresponding path program 1 times [2020-12-09 07:03:28,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:28,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20978027] [2020-12-09 07:03:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 07:03:28,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20978027] [2020-12-09 07:03:28,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356603365] [2020-12-09 07:03:28,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/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 [2020-12-09 07:03:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:28,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 07:03:28,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:03:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:28,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:03:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:28,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1888963704] [2020-12-09 07:03:28,433 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2020-12-09 07:03:28,433 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 07:03:28,437 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 07:03:28,442 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 07:03:28,442 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 07:03:29,233 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 250 [2020-12-09 07:03:29,460 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 250 [2020-12-09 07:03:29,721 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 250 [2020-12-09 07:03:32,038 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 07:03:32,611 WARN L197 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 112 [2020-12-09 07:03:32,764 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-12-09 07:03:32,940 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2020-12-09 07:03:33,115 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2020-12-09 07:03:33,332 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2020-12-09 07:03:33,548 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 96 [2020-12-09 07:03:33,821 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2020-12-09 07:03:34,096 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 102 [2020-12-09 07:03:35,290 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 251 DAG size of output: 139 [2020-12-09 07:03:36,691 WARN L197 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 251 DAG size of output: 142 [2020-12-09 07:03:37,481 WARN L197 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 102 [2020-12-09 07:03:38,318 WARN L197 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 105 [2020-12-09 07:03:38,911 WARN L197 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 109 [2020-12-09 07:03:39,514 WARN L197 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 109 [2020-12-09 07:03:39,944 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 100 [2020-12-09 07:03:40,499 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 102 [2020-12-09 07:03:41,023 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 99 [2020-12-09 07:03:41,705 WARN L197 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 114 [2020-12-09 07:03:42,417 WARN L197 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 117 [2020-12-09 07:03:43,073 WARN L197 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 128 [2020-12-09 07:03:43,854 WARN L197 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 130 [2020-12-09 07:03:44,280 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 124 [2020-12-09 07:03:44,731 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 128 [2020-12-09 07:03:45,177 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 130 [2020-12-09 07:03:45,634 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 130 [2020-12-09 07:03:46,101 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 134 [2020-12-09 07:03:46,707 WARN L197 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 112 [2020-12-09 07:03:46,858 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 07:03:46,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 07:03:46,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2020-12-09 07:03:46,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945399578] [2020-12-09 07:03:46,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:03:46,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:03:46,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 07:03:46,859 INFO L87 Difference]: Start difference. First operand 926 states and 1208 transitions. Second operand 11 states. [2020-12-09 07:03:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:47,388 INFO L93 Difference]: Finished difference Result 2805 states and 3699 transitions. [2020-12-09 07:03:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 07:03:47,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-12-09 07:03:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:47,395 INFO L225 Difference]: With dead ends: 2805 [2020-12-09 07:03:47,396 INFO L226 Difference]: Without dead ends: 1911 [2020-12-09 07:03:47,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2020-12-09 07:03:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2020-12-09 07:03:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 966. [2020-12-09 07:03:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2020-12-09 07:03:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1272 transitions. [2020-12-09 07:03:47,435 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1272 transitions. Word has length 57 [2020-12-09 07:03:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:47,435 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 1272 transitions. [2020-12-09 07:03:47,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:03:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1272 transitions. [2020-12-09 07:03:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-09 07:03:47,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:47,437 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:47,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:03:47,638 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:47,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1080521014, now seen corresponding path program 1 times [2020-12-09 07:03:47,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:47,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24042681] [2020-12-09 07:03:47,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:47,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24042681] [2020-12-09 07:03:47,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:47,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:47,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376224980] [2020-12-09 07:03:47,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:03:47,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:47,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:03:47,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:03:47,756 INFO L87 Difference]: Start difference. First operand 966 states and 1272 transitions. Second operand 3 states. [2020-12-09 07:03:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:47,801 INFO L93 Difference]: Finished difference Result 1681 states and 2226 transitions. [2020-12-09 07:03:47,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:03:47,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-12-09 07:03:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:47,804 INFO L225 Difference]: With dead ends: 1681 [2020-12-09 07:03:47,804 INFO L226 Difference]: Without dead ends: 747 [2020-12-09 07:03:47,805 INFO L677 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 [2020-12-09 07:03:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2020-12-09 07:03:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 732. [2020-12-09 07:03:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-09 07:03:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 939 transitions. [2020-12-09 07:03:47,829 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 939 transitions. Word has length 59 [2020-12-09 07:03:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:47,830 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 939 transitions. [2020-12-09 07:03:47,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:03:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 939 transitions. [2020-12-09 07:03:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-09 07:03:47,831 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:47,831 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:47,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2020-12-09 07:03:47,832 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash -10097335, now seen corresponding path program 1 times [2020-12-09 07:03:47,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:47,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973414458] [2020-12-09 07:03:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:47,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973414458] [2020-12-09 07:03:47,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439052959] [2020-12-09 07:03:47,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/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 [2020-12-09 07:03:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:47,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 07:03:47,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:03:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 07:03:48,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:03:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 07:03:48,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 07:03:48,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [8] total 10 [2020-12-09 07:03:48,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420168026] [2020-12-09 07:03:48,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:48,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:48,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:03:48,058 INFO L87 Difference]: Start difference. First operand 732 states and 939 transitions. Second operand 4 states. [2020-12-09 07:03:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:48,104 INFO L93 Difference]: Finished difference Result 1291 states and 1655 transitions. [2020-12-09 07:03:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:48,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-09 07:03:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:48,108 INFO L225 Difference]: With dead ends: 1291 [2020-12-09 07:03:48,108 INFO L226 Difference]: Without dead ends: 738 [2020-12-09 07:03:48,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:03:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-12-09 07:03:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 732. [2020-12-09 07:03:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-09 07:03:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 923 transitions. [2020-12-09 07:03:48,145 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 923 transitions. Word has length 59 [2020-12-09 07:03:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:48,146 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 923 transitions. [2020-12-09 07:03:48,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 923 transitions. [2020-12-09 07:03:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-09 07:03:48,147 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:48,147 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:48,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:03:48,348 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash 417132549, now seen corresponding path program 1 times [2020-12-09 07:03:48,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:48,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026304511] [2020-12-09 07:03:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:48,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026304511] [2020-12-09 07:03:48,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690167539] [2020-12-09 07:03:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/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 [2020-12-09 07:03:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:48,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 07:03:48,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:03:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 07:03:48,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:03:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 07:03:48,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 07:03:48,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [8] total 10 [2020-12-09 07:03:48,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418125814] [2020-12-09 07:03:48,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:48,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:48,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:03:48,631 INFO L87 Difference]: Start difference. First operand 732 states and 923 transitions. Second operand 4 states. [2020-12-09 07:03:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:48,675 INFO L93 Difference]: Finished difference Result 1205 states and 1525 transitions. [2020-12-09 07:03:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:48,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-09 07:03:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:48,678 INFO L225 Difference]: With dead ends: 1205 [2020-12-09 07:03:48,678 INFO L226 Difference]: Without dead ends: 758 [2020-12-09 07:03:48,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:03:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2020-12-09 07:03:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 732. [2020-12-09 07:03:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-09 07:03:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 909 transitions. [2020-12-09 07:03:48,704 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 909 transitions. Word has length 60 [2020-12-09 07:03:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:48,704 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 909 transitions. [2020-12-09 07:03:48,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 909 transitions. [2020-12-09 07:03:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-09 07:03:48,705 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:48,705 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:48,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:03:48,906 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash -639151278, now seen corresponding path program 1 times [2020-12-09 07:03:48,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:48,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433865636] [2020-12-09 07:03:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:48,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433865636] [2020-12-09 07:03:48,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204390965] [2020-12-09 07:03:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:03:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:48,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:03:48,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:03:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:49,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:03:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:49,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 07:03:49,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 07:03:49,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888473039] [2020-12-09 07:03:49,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:49,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:49,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:49,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:03:49,056 INFO L87 Difference]: Start difference. First operand 732 states and 909 transitions. Second operand 4 states. [2020-12-09 07:03:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:49,107 INFO L93 Difference]: Finished difference Result 1468 states and 1817 transitions. [2020-12-09 07:03:49,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:49,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-09 07:03:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:49,111 INFO L225 Difference]: With dead ends: 1468 [2020-12-09 07:03:49,111 INFO L226 Difference]: Without dead ends: 899 [2020-12-09 07:03:49,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:03:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2020-12-09 07:03:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 739. [2020-12-09 07:03:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-09 07:03:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 919 transitions. [2020-12-09 07:03:49,138 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 919 transitions. Word has length 60 [2020-12-09 07:03:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:49,138 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 919 transitions. [2020-12-09 07:03:49,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 919 transitions. [2020-12-09 07:03:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-09 07:03:49,139 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:49,140 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:49,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:03:49,341 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1559432333, now seen corresponding path program 1 times [2020-12-09 07:03:49,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:49,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385718844] [2020-12-09 07:03:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 07:03:49,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385718844] [2020-12-09 07:03:49,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:49,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:03:49,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476175809] [2020-12-09 07:03:49,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:49,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:49,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:49,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:49,413 INFO L87 Difference]: Start difference. First operand 739 states and 919 transitions. Second operand 4 states. [2020-12-09 07:03:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:49,491 INFO L93 Difference]: Finished difference Result 1316 states and 1625 transitions. [2020-12-09 07:03:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:49,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-09 07:03:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:49,494 INFO L225 Difference]: With dead ends: 1316 [2020-12-09 07:03:49,494 INFO L226 Difference]: Without dead ends: 874 [2020-12-09 07:03:49,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-12-09 07:03:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 795. [2020-12-09 07:03:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-12-09 07:03:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 962 transitions. [2020-12-09 07:03:49,525 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 962 transitions. Word has length 61 [2020-12-09 07:03:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:49,525 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 962 transitions. [2020-12-09 07:03:49,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 962 transitions. [2020-12-09 07:03:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-09 07:03:49,526 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:49,526 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 07:03:49,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-12-09 07:03:49,527 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1587612423, now seen corresponding path program 1 times [2020-12-09 07:03:49,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:49,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881946768] [2020-12-09 07:03:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 07:03:49,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881946768] [2020-12-09 07:03:49,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:49,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:03:49,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257721877] [2020-12-09 07:03:49,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:49,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:49,553 INFO L87 Difference]: Start difference. First operand 795 states and 962 transitions. Second operand 4 states. [2020-12-09 07:03:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:49,634 INFO L93 Difference]: Finished difference Result 1714 states and 2078 transitions. [2020-12-09 07:03:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:49,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-09 07:03:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:49,638 INFO L225 Difference]: With dead ends: 1714 [2020-12-09 07:03:49,638 INFO L226 Difference]: Without dead ends: 930 [2020-12-09 07:03:49,639 INFO L677 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 [2020-12-09 07:03:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2020-12-09 07:03:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 841. [2020-12-09 07:03:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2020-12-09 07:03:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 991 transitions. [2020-12-09 07:03:49,671 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 991 transitions. Word has length 61 [2020-12-09 07:03:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:49,671 INFO L481 AbstractCegarLoop]: Abstraction has 841 states and 991 transitions. [2020-12-09 07:03:49,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 991 transitions. [2020-12-09 07:03:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-09 07:03:49,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:49,672 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-09 07:03:49,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-12-09 07:03:49,672 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:49,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1044305336, now seen corresponding path program 1 times [2020-12-09 07:03:49,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:49,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115429029] [2020-12-09 07:03:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:49,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115429029] [2020-12-09 07:03:49,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:49,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:03:49,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496343053] [2020-12-09 07:03:49,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:49,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:49,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:49,702 INFO L87 Difference]: Start difference. First operand 841 states and 991 transitions. Second operand 4 states. [2020-12-09 07:03:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:49,822 INFO L93 Difference]: Finished difference Result 1801 states and 2104 transitions. [2020-12-09 07:03:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:49,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-09 07:03:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:49,826 INFO L225 Difference]: With dead ends: 1801 [2020-12-09 07:03:49,827 INFO L226 Difference]: Without dead ends: 1113 [2020-12-09 07:03:49,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:03:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-12-09 07:03:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 929. [2020-12-09 07:03:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2020-12-09 07:03:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1076 transitions. [2020-12-09 07:03:49,862 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1076 transitions. Word has length 62 [2020-12-09 07:03:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:49,862 INFO L481 AbstractCegarLoop]: Abstraction has 929 states and 1076 transitions. [2020-12-09 07:03:49,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1076 transitions. [2020-12-09 07:03:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-09 07:03:49,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:49,863 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-09 07:03:49,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2020-12-09 07:03:49,863 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -382676161, now seen corresponding path program 1 times [2020-12-09 07:03:49,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:49,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26359875] [2020-12-09 07:03:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:49,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26359875] [2020-12-09 07:03:49,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009393567] [2020-12-09 07:03:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:03:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:49,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:03:49,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:03:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:50,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:03:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:03:50,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 07:03:50,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 07:03:50,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179702037] [2020-12-09 07:03:50,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:03:50,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:03:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:03:50,063 INFO L87 Difference]: Start difference. First operand 929 states and 1076 transitions. Second operand 4 states. [2020-12-09 07:03:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:50,126 INFO L93 Difference]: Finished difference Result 1877 states and 2190 transitions. [2020-12-09 07:03:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:03:50,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-09 07:03:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:50,130 INFO L225 Difference]: With dead ends: 1877 [2020-12-09 07:03:50,130 INFO L226 Difference]: Without dead ends: 1031 [2020-12-09 07:03:50,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:03:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2020-12-09 07:03:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 896. [2020-12-09 07:03:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-12-09 07:03:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1046 transitions. [2020-12-09 07:03:50,165 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1046 transitions. Word has length 77 [2020-12-09 07:03:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:50,166 INFO L481 AbstractCegarLoop]: Abstraction has 896 states and 1046 transitions. [2020-12-09 07:03:50,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:03:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1046 transitions. [2020-12-09 07:03:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-09 07:03:50,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:50,167 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:03:50,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:03:50,368 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash 127177078, now seen corresponding path program 1 times [2020-12-09 07:03:50,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:50,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076005724] [2020-12-09 07:03:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:03:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 07:03:50,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076005724] [2020-12-09 07:03:50,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:03:50,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:03:50,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227194639] [2020-12-09 07:03:50,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:03:50,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:03:50,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:03:50,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:03:50,524 INFO L87 Difference]: Start difference. First operand 896 states and 1046 transitions. Second operand 5 states. [2020-12-09 07:03:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:03:50,631 INFO L93 Difference]: Finished difference Result 2535 states and 2945 transitions. [2020-12-09 07:03:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:03:50,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2020-12-09 07:03:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:03:50,638 INFO L225 Difference]: With dead ends: 2535 [2020-12-09 07:03:50,638 INFO L226 Difference]: Without dead ends: 1883 [2020-12-09 07:03:50,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:03:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2020-12-09 07:03:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1446. [2020-12-09 07:03:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2020-12-09 07:03:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1693 transitions. [2020-12-09 07:03:50,698 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1693 transitions. Word has length 79 [2020-12-09 07:03:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:03:50,698 INFO L481 AbstractCegarLoop]: Abstraction has 1446 states and 1693 transitions. [2020-12-09 07:03:50,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:03:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1693 transitions. [2020-12-09 07:03:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-09 07:03:50,698 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:03:50,699 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:03:50,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2020-12-09 07:03:50,699 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:03:50,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:03:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1259179990, now seen corresponding path program 1 times [2020-12-09 07:03:50,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:03:50,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4354577] [2020-12-09 07:03:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:03:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:03:50,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:03:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:03:50,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:03:50,755 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 07:03:50,755 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 07:03:50,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2020-12-09 07:03:50,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:03:50 BoogieIcfgContainer [2020-12-09 07:03:50,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 07:03:50,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 07:03:50,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 07:03:50,845 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 07:03:50,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:03:25" (3/4) ... [2020-12-09 07:03:50,846 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 07:03:50,926 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_36f4adf6-d158-46ba-808e-0602a86c3815/bin/utaipan/witness.graphml [2020-12-09 07:03:50,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 07:03:50,926 INFO L168 Benchmark]: Toolchain (without parser) took 26993.57 ms. Allocated memory was 102.8 MB in the beginning and 377.5 MB in the end (delta: 274.7 MB). Free memory was 60.8 MB in the beginning and 216.8 MB in the end (delta: -156.0 MB). Peak memory consumption was 120.4 MB. Max. memory is 16.1 GB. [2020-12-09 07:03:50,927 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 102.8 MB. Free memory was 77.3 MB in the beginning and 77.2 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:03:50,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.39 ms. Allocated memory is still 102.8 MB. Free memory was 60.6 MB in the beginning and 72.8 MB in the end (delta: -12.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:03:50,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.51 ms. Allocated memory is still 102.8 MB. Free memory was 72.8 MB in the beginning and 69.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:03:50,927 INFO L168 Benchmark]: Boogie Preprocessor took 33.30 ms. Allocated memory is still 102.8 MB. Free memory was 69.7 MB in the beginning and 67.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:03:50,927 INFO L168 Benchmark]: RCFGBuilder took 1144.57 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 66.9 MB in the beginning and 65.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:03:50,928 INFO L168 Benchmark]: TraceAbstraction took 25474.81 ms. Allocated memory was 123.7 MB in the beginning and 377.5 MB in the end (delta: 253.8 MB). Free memory was 65.7 MB in the beginning and 232.5 MB in the end (delta: -166.8 MB). Peak memory consumption was 86.7 MB. Max. memory is 16.1 GB. [2020-12-09 07:03:50,928 INFO L168 Benchmark]: Witness Printer took 81.07 ms. Allocated memory is still 377.5 MB. Free memory was 231.4 MB in the beginning and 216.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 07:03:50,929 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 102.8 MB. Free memory was 77.3 MB in the beginning and 77.2 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 217.39 ms. Allocated memory is still 102.8 MB. Free memory was 60.6 MB in the beginning and 72.8 MB in the end (delta: -12.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.51 ms. Allocated memory is still 102.8 MB. Free memory was 72.8 MB in the beginning and 69.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.30 ms. Allocated memory is still 102.8 MB. Free memory was 69.7 MB in the beginning and 67.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1144.57 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 66.9 MB in the beginning and 65.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25474.81 ms. Allocated memory was 123.7 MB in the beginning and 377.5 MB in the end (delta: 253.8 MB). Free memory was 65.7 MB in the beginning and 232.5 MB in the end (delta: -166.8 MB). Peak memory consumption was 86.7 MB. Max. memory is 16.1 GB. * Witness Printer took 81.07 ms. Allocated memory is still 377.5 MB. Free memory was 231.4 MB in the beginning and 216.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] int local ; [L602] int __retres1 ; [L516] m_i = 1 [L517] t1_i = 1 [L518] t2_i = 1 [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] kernel_st = 0 [L235] COND TRUE m_i == 1 [L236] m_st = 0 [L240] COND TRUE t1_i == 1 [L241] t1_st = 0 [L245] COND TRUE t2_i == 1 [L246] t2_st = 0 [L348] COND FALSE !(M_E == 0) [L353] COND FALSE !(T1_E == 0) [L358] COND FALSE !(T2_E == 0) [L363] COND FALSE !(E_M == 0) [L368] COND FALSE !(E_1 == 0) [L373] COND FALSE !(E_2 == 0) [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L182] return (__retres1); [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L189] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L201] return (__retres1); [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L208] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L220] return (__retres1); [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) [L386] COND FALSE !(M_E == 1) [L391] COND FALSE !(T1_E == 1) [L396] COND FALSE !(T2_E == 1) [L401] COND FALSE !(E_M == 1) [L406] COND FALSE !(E_1 == 1) [L411] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L557] COND TRUE 1 [L560] kernel_st = 1 [L281] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L285] COND TRUE 1 [L255] int __retres1 ; [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 [L276] return (__retres1); [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L98] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] COND TRUE 1 [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L134] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] COND TRUE 1 [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L285] COND TRUE 1 [L255] int __retres1 ; [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 [L276] return (__retres1); [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L53] COND TRUE 1 [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L182] return (__retres1); [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L189] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] COND TRUE E_1 == 1 [L191] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L201] return (__retres1); [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] t1_st = 0 [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L220] return (__retres1); [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) [L60] E_1 = 2 [L61] m_pc = 1 [L62] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L98] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L101] COND TRUE t1_pc == 1 [L117] token += 1 [L118] E_2 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L171] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L182] return (__retres1); [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L201] return (__retres1); [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] COND TRUE E_2 == 1 [L210] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L220] return (__retres1); [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] t2_st = 0 [L120] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] COND TRUE 1 [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L134] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L137] COND TRUE t2_pc == 1 [L153] token += 1 [L154] E_M = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L171] COND TRUE E_M == 1 [L172] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L182] return (__retres1); [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] m_st = 0 [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L201] return (__retres1); [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L220] return (__retres1); [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) [L156] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] COND TRUE 1 [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L285] COND TRUE 1 [L255] int __retres1 ; [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 [L276] return (__retres1); [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L45] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L67] COND FALSE !(token != local + 2) [L72] COND TRUE tmp_var <= 5 [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L80] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L12] reach_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.3s, OverallIterations: 21, TraceHistogramMax: 3, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3358 SDtfs, 3903 SDslu, 4006 SDs, 0 SdLazy, 833 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 907 GetRequests, 784 SyntacticMatches, 9 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1798occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 3545 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1508 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1763 ConstructedInterpolants, 0 QuantifiedInterpolants, 232486 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1848 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 347/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...