./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/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 5c6676c90977e408adf03f66d7ae0804453cb34e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-a4ecdab [2020-11-30 03:02:20,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 03:02:20,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 03:02:21,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 03:02:21,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 03:02:21,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 03:02:21,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 03:02:21,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 03:02:21,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 03:02:21,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 03:02:21,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 03:02:21,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 03:02:21,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 03:02:21,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 03:02:21,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 03:02:21,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 03:02:21,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 03:02:21,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 03:02:21,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 03:02:21,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 03:02:21,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 03:02:21,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 03:02:21,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 03:02:21,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 03:02:21,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 03:02:21,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 03:02:21,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 03:02:21,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 03:02:21,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 03:02:21,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 03:02:21,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 03:02:21,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 03:02:21,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 03:02:21,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 03:02:21,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 03:02:21,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 03:02:21,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 03:02:21,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 03:02:21,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 03:02:21,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 03:02:21,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 03:02:21,117 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 03:02:21,182 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 03:02:21,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 03:02:21,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 03:02:21,185 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 03:02:21,185 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 03:02:21,185 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 03:02:21,186 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 03:02:21,186 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 03:02:21,186 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 03:02:21,187 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 03:02:21,188 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 03:02:21,188 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 03:02:21,189 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 03:02:21,189 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 03:02:21,189 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 03:02:21,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 03:02:21,191 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 03:02:21,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 03:02:21,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 03:02:21,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 03:02:21,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 03:02:21,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 03:02:21,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 03:02:21,193 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 03:02:21,193 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 03:02:21,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 03:02:21,194 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 03:02:21,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 03:02:21,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 03:02:21,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 03:02:21,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 03:02:21,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:02:21,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 03:02:21,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 03:02:21,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 03:02:21,199 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 03:02:21,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 03:02:21,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 03:02:21,200 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 03:02:21,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 03:02:21,200 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_406c09d5-a718-42bf-aa32-361ab5c863a7/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_406c09d5-a718-42bf-aa32-361ab5c863a7/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 -> 5c6676c90977e408adf03f66d7ae0804453cb34e [2020-11-30 03:02:21,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 03:02:21,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 03:02:21,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 03:02:21,591 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 03:02:21,592 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 03:02:21,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2020-11-30 03:02:21,692 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/data/46513a902/879d4c6ef43f4c00af788ff618316535/FLAG0f1b07283 [2020-11-30 03:02:22,381 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 03:02:22,382 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/sv-benchmarks/c/systemc/transmitter.02.cil.c [2020-11-30 03:02:22,398 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/data/46513a902/879d4c6ef43f4c00af788ff618316535/FLAG0f1b07283 [2020-11-30 03:02:22,719 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/data/46513a902/879d4c6ef43f4c00af788ff618316535 [2020-11-30 03:02:22,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 03:02:22,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 03:02:22,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 03:02:22,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 03:02:22,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 03:02:22,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:02:22" (1/1) ... [2020-11-30 03:02:22,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efa5544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:22, skipping insertion in model container [2020-11-30 03:02:22,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:02:22" (1/1) ... [2020-11-30 03:02:22,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 03:02:22,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 03:02:23,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:02:23,135 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 03:02:23,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:02:23,244 INFO L208 MainTranslator]: Completed translation [2020-11-30 03:02:23,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23 WrapperNode [2020-11-30 03:02:23,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 03:02:23,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 03:02:23,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 03:02:23,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 03:02:23,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 03:02:23,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 03:02:23,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 03:02:23,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 03:02:23,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... [2020-11-30 03:02:23,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 03:02:23,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 03:02:23,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 03:02:23,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 03:02:23,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/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-11-30 03:02:23,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 03:02:23,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 03:02:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 03:02:23,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 03:02:25,877 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 03:02:25,877 INFO L298 CfgBuilder]: Removed 96 assume(true) statements. [2020-11-30 03:02:25,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:02:25 BoogieIcfgContainer [2020-11-30 03:02:25,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 03:02:25,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 03:02:25,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 03:02:25,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 03:02:25,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:02:22" (1/3) ... [2020-11-30 03:02:25,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e845cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:02:25, skipping insertion in model container [2020-11-30 03:02:25,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:23" (2/3) ... [2020-11-30 03:02:25,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e845cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:02:25, skipping insertion in model container [2020-11-30 03:02:25,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:02:25" (3/3) ... [2020-11-30 03:02:25,891 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-11-30 03:02:25,905 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 03:02:25,911 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 03:02:25,925 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 03:02:25,970 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 03:02:25,971 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 03:02:25,971 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 03:02:25,971 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 03:02:25,971 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 03:02:25,972 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 03:02:25,972 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 03:02:25,972 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 03:02:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-11-30 03:02:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 03:02:26,007 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:26,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:26,009 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:26,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1913549870, now seen corresponding path program 1 times [2020-11-30 03:02:26,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:26,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591062795] [2020-11-30 03:02:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:26,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591062795] [2020-11-30 03:02:26,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:26,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:26,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056397167] [2020-11-30 03:02:26,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:02:26,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:26,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:02:26,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:02:26,337 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2020-11-30 03:02:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:26,656 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2020-11-30 03:02:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:02:26,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-30 03:02:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:26,675 INFO L225 Difference]: With dead ends: 295 [2020-11-30 03:02:26,675 INFO L226 Difference]: Without dead ends: 203 [2020-11-30 03:02:26,679 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-11-30 03:02:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-11-30 03:02:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 179. [2020-11-30 03:02:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-11-30 03:02:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 258 transitions. [2020-11-30 03:02:26,782 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 258 transitions. Word has length 20 [2020-11-30 03:02:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:26,785 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 258 transitions. [2020-11-30 03:02:26,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:02:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 258 transitions. [2020-11-30 03:02:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 03:02:26,788 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:26,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:26,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 03:02:26,789 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:26,793 INFO L82 PathProgramCache]: Analyzing trace with hash -736945551, now seen corresponding path program 1 times [2020-11-30 03:02:26,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:26,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992235662] [2020-11-30 03:02:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:26,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992235662] [2020-11-30 03:02:26,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:26,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:26,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704790935] [2020-11-30 03:02:26,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:02:26,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:02:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:02:26,959 INFO L87 Difference]: Start difference. First operand 179 states and 258 transitions. Second operand 4 states. [2020-11-30 03:02:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:27,141 INFO L93 Difference]: Finished difference Result 524 states and 764 transitions. [2020-11-30 03:02:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:02:27,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-30 03:02:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:27,146 INFO L225 Difference]: With dead ends: 524 [2020-11-30 03:02:27,146 INFO L226 Difference]: Without dead ends: 356 [2020-11-30 03:02:27,153 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-11-30 03:02:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-11-30 03:02:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 272. [2020-11-30 03:02:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-11-30 03:02:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 395 transitions. [2020-11-30 03:02:27,218 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 395 transitions. Word has length 20 [2020-11-30 03:02:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:27,219 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 395 transitions. [2020-11-30 03:02:27,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:02:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 395 transitions. [2020-11-30 03:02:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 03:02:27,222 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:27,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:27,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 03:02:27,222 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:27,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash 67384858, now seen corresponding path program 1 times [2020-11-30 03:02:27,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:27,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782839780] [2020-11-30 03:02:27,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:27,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782839780] [2020-11-30 03:02:27,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:27,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:27,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359756624] [2020-11-30 03:02:27,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:02:27,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:27,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:02:27,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:02:27,369 INFO L87 Difference]: Start difference. First operand 272 states and 395 transitions. Second operand 4 states. [2020-11-30 03:02:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:27,543 INFO L93 Difference]: Finished difference Result 837 states and 1229 transitions. [2020-11-30 03:02:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:02:27,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-30 03:02:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:27,550 INFO L225 Difference]: With dead ends: 837 [2020-11-30 03:02:27,550 INFO L226 Difference]: Without dead ends: 576 [2020-11-30 03:02:27,555 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-11-30 03:02:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-11-30 03:02:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 453. [2020-11-30 03:02:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-11-30 03:02:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 657 transitions. [2020-11-30 03:02:27,610 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 657 transitions. Word has length 21 [2020-11-30 03:02:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:27,611 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 657 transitions. [2020-11-30 03:02:27,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:02:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 657 transitions. [2020-11-30 03:02:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 03:02:27,612 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:27,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:27,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 03:02:27,613 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:27,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1995472860, now seen corresponding path program 1 times [2020-11-30 03:02:27,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:27,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227588559] [2020-11-30 03:02:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:27,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227588559] [2020-11-30 03:02:27,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:27,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:02:27,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383794756] [2020-11-30 03:02:27,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:27,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:27,692 INFO L87 Difference]: Start difference. First operand 453 states and 657 transitions. Second operand 3 states. [2020-11-30 03:02:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:27,787 INFO L93 Difference]: Finished difference Result 1304 states and 1880 transitions. [2020-11-30 03:02:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:27,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-30 03:02:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:27,797 INFO L225 Difference]: With dead ends: 1304 [2020-11-30 03:02:27,797 INFO L226 Difference]: Without dead ends: 859 [2020-11-30 03:02:27,799 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-11-30 03:02:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-11-30 03:02:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 850. [2020-11-30 03:02:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2020-11-30 03:02:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1189 transitions. [2020-11-30 03:02:27,884 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1189 transitions. Word has length 22 [2020-11-30 03:02:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:27,884 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1189 transitions. [2020-11-30 03:02:27,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1189 transitions. [2020-11-30 03:02:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 03:02:27,896 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:27,896 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:27,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 03:02:27,897 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:27,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash -515824487, now seen corresponding path program 1 times [2020-11-30 03:02:27,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:27,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746742014] [2020-11-30 03:02:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:28,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746742014] [2020-11-30 03:02:28,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:28,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:28,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874572950] [2020-11-30 03:02:28,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:28,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:28,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:28,024 INFO L87 Difference]: Start difference. First operand 850 states and 1189 transitions. Second operand 3 states. [2020-11-30 03:02:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:28,130 INFO L93 Difference]: Finished difference Result 1558 states and 2224 transitions. [2020-11-30 03:02:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:28,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-11-30 03:02:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:28,140 INFO L225 Difference]: With dead ends: 1558 [2020-11-30 03:02:28,140 INFO L226 Difference]: Without dead ends: 1116 [2020-11-30 03:02:28,142 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-11-30 03:02:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-11-30 03:02:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 927. [2020-11-30 03:02:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-11-30 03:02:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1307 transitions. [2020-11-30 03:02:28,210 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1307 transitions. Word has length 32 [2020-11-30 03:02:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:28,212 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1307 transitions. [2020-11-30 03:02:28,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1307 transitions. [2020-11-30 03:02:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 03:02:28,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:28,218 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:28,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 03:02:28,219 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash -953374991, now seen corresponding path program 1 times [2020-11-30 03:02:28,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:28,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240257791] [2020-11-30 03:02:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 03:02:28,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240257791] [2020-11-30 03:02:28,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:28,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:02:28,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697261972] [2020-11-30 03:02:28,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:28,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:28,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:28,322 INFO L87 Difference]: Start difference. First operand 927 states and 1307 transitions. Second operand 3 states. [2020-11-30 03:02:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:28,410 INFO L93 Difference]: Finished difference Result 1468 states and 2091 transitions. [2020-11-30 03:02:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:28,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-11-30 03:02:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:28,418 INFO L225 Difference]: With dead ends: 1468 [2020-11-30 03:02:28,419 INFO L226 Difference]: Without dead ends: 949 [2020-11-30 03:02:28,420 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-11-30 03:02:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2020-11-30 03:02:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 927. [2020-11-30 03:02:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-11-30 03:02:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1294 transitions. [2020-11-30 03:02:28,486 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1294 transitions. Word has length 44 [2020-11-30 03:02:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:28,489 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1294 transitions. [2020-11-30 03:02:28,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1294 transitions. [2020-11-30 03:02:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 03:02:28,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:28,499 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:28,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 03:02:28,499 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1826213646, now seen corresponding path program 1 times [2020-11-30 03:02:28,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:28,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078428811] [2020-11-30 03:02:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:28,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078428811] [2020-11-30 03:02:28,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:28,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:28,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750625808] [2020-11-30 03:02:28,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:28,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:28,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:28,628 INFO L87 Difference]: Start difference. First operand 927 states and 1294 transitions. Second operand 3 states. [2020-11-30 03:02:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:28,745 INFO L93 Difference]: Finished difference Result 1446 states and 2043 transitions. [2020-11-30 03:02:28,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:28,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-11-30 03:02:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:28,753 INFO L225 Difference]: With dead ends: 1446 [2020-11-30 03:02:28,753 INFO L226 Difference]: Without dead ends: 927 [2020-11-30 03:02:28,755 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-11-30 03:02:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-11-30 03:02:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 911. [2020-11-30 03:02:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2020-11-30 03:02:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1236 transitions. [2020-11-30 03:02:28,825 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1236 transitions. Word has length 44 [2020-11-30 03:02:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:28,826 INFO L481 AbstractCegarLoop]: Abstraction has 911 states and 1236 transitions. [2020-11-30 03:02:28,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1236 transitions. [2020-11-30 03:02:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-30 03:02:28,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:28,829 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:28,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 03:02:28,829 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1992122171, now seen corresponding path program 1 times [2020-11-30 03:02:28,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:28,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861198070] [2020-11-30 03:02:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:28,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861198070] [2020-11-30 03:02:28,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:28,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:02:28,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162800359] [2020-11-30 03:02:28,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:02:28,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:02:28,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:02:28,961 INFO L87 Difference]: Start difference. First operand 911 states and 1236 transitions. Second operand 4 states. [2020-11-30 03:02:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:29,160 INFO L93 Difference]: Finished difference Result 1872 states and 2528 transitions. [2020-11-30 03:02:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:02:29,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-11-30 03:02:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:29,173 INFO L225 Difference]: With dead ends: 1872 [2020-11-30 03:02:29,174 INFO L226 Difference]: Without dead ends: 1455 [2020-11-30 03:02:29,176 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-11-30 03:02:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-11-30 03:02:29,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1238. [2020-11-30 03:02:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2020-11-30 03:02:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1652 transitions. [2020-11-30 03:02:29,299 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1652 transitions. Word has length 45 [2020-11-30 03:02:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:29,302 INFO L481 AbstractCegarLoop]: Abstraction has 1238 states and 1652 transitions. [2020-11-30 03:02:29,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:02:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1652 transitions. [2020-11-30 03:02:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 03:02:29,306 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:29,306 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:29,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 03:02:29,309 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:29,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash 383860720, now seen corresponding path program 1 times [2020-11-30 03:02:29,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:29,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017976449] [2020-11-30 03:02:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:29,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017976449] [2020-11-30 03:02:29,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:29,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:29,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69860525] [2020-11-30 03:02:29,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:29,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:29,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:29,380 INFO L87 Difference]: Start difference. First operand 1238 states and 1652 transitions. Second operand 3 states. [2020-11-30 03:02:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:29,504 INFO L93 Difference]: Finished difference Result 2509 states and 3383 transitions. [2020-11-30 03:02:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:29,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-30 03:02:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:29,514 INFO L225 Difference]: With dead ends: 2509 [2020-11-30 03:02:29,515 INFO L226 Difference]: Without dead ends: 1391 [2020-11-30 03:02:29,517 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-11-30 03:02:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-11-30 03:02:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1288. [2020-11-30 03:02:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2020-11-30 03:02:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1728 transitions. [2020-11-30 03:02:29,604 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1728 transitions. Word has length 46 [2020-11-30 03:02:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:29,605 INFO L481 AbstractCegarLoop]: Abstraction has 1288 states and 1728 transitions. [2020-11-30 03:02:29,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1728 transitions. [2020-11-30 03:02:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 03:02:29,608 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:29,609 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:02:29,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 03:02:29,610 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:29,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1081595277, now seen corresponding path program 1 times [2020-11-30 03:02:29,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:29,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458568143] [2020-11-30 03:02:29,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:02:29,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458568143] [2020-11-30 03:02:29,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297749685] [2020-11-30 03:02:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/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-11-30 03:02:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:29,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 03:02:29,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:02:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 03:02:29,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:02:30,040 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:02:30,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:02:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 03:02:30,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 03:02:30,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [5] total 9 [2020-11-30 03:02:30,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179599578] [2020-11-30 03:02:30,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:02:30,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:02:30,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-30 03:02:30,090 INFO L87 Difference]: Start difference. First operand 1288 states and 1728 transitions. Second operand 6 states. [2020-11-30 03:02:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:30,238 INFO L93 Difference]: Finished difference Result 1686 states and 2275 transitions. [2020-11-30 03:02:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:02:30,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2020-11-30 03:02:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:30,248 INFO L225 Difference]: With dead ends: 1686 [2020-11-30 03:02:30,249 INFO L226 Difference]: Without dead ends: 1253 [2020-11-30 03:02:30,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-30 03:02:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2020-11-30 03:02:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1251. [2020-11-30 03:02:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2020-11-30 03:02:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1666 transitions. [2020-11-30 03:02:30,368 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1666 transitions. Word has length 48 [2020-11-30 03:02:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:30,368 INFO L481 AbstractCegarLoop]: Abstraction has 1251 states and 1666 transitions. [2020-11-30 03:02:30,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:02:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1666 transitions. [2020-11-30 03:02:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-30 03:02:30,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:30,372 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:02:30,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-30 03:02:30,588 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1585623335, now seen corresponding path program 1 times [2020-11-30 03:02:30,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:30,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135483299] [2020-11-30 03:02:30,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:30,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135483299] [2020-11-30 03:02:30,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:30,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:30,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675306167] [2020-11-30 03:02:30,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:30,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:30,717 INFO L87 Difference]: Start difference. First operand 1251 states and 1666 transitions. Second operand 3 states. [2020-11-30 03:02:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:30,828 INFO L93 Difference]: Finished difference Result 2092 states and 2816 transitions. [2020-11-30 03:02:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:30,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-11-30 03:02:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:30,836 INFO L225 Difference]: With dead ends: 2092 [2020-11-30 03:02:30,837 INFO L226 Difference]: Without dead ends: 924 [2020-11-30 03:02:30,839 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-11-30 03:02:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2020-11-30 03:02:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 920. [2020-11-30 03:02:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-11-30 03:02:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1193 transitions. [2020-11-30 03:02:30,908 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1193 transitions. Word has length 59 [2020-11-30 03:02:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:30,910 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1193 transitions. [2020-11-30 03:02:30,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1193 transitions. [2020-11-30 03:02:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-30 03:02:30,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:30,913 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:02:30,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 03:02:30,913 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash -297428806, now seen corresponding path program 1 times [2020-11-30 03:02:30,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:30,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489044576] [2020-11-30 03:02:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 03:02:30,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489044576] [2020-11-30 03:02:30,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:30,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:30,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64864705] [2020-11-30 03:02:30,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:30,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:30,981 INFO L87 Difference]: Start difference. First operand 920 states and 1193 transitions. Second operand 3 states. [2020-11-30 03:02:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:31,092 INFO L93 Difference]: Finished difference Result 1584 states and 2070 transitions. [2020-11-30 03:02:31,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:31,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-11-30 03:02:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:31,100 INFO L225 Difference]: With dead ends: 1584 [2020-11-30 03:02:31,100 INFO L226 Difference]: Without dead ends: 920 [2020-11-30 03:02:31,103 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-11-30 03:02:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2020-11-30 03:02:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2020-11-30 03:02:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-11-30 03:02:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1163 transitions. [2020-11-30 03:02:31,182 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1163 transitions. Word has length 59 [2020-11-30 03:02:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:31,182 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1163 transitions. [2020-11-30 03:02:31,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1163 transitions. [2020-11-30 03:02:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-30 03:02:31,185 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:31,185 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:02:31,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 03:02:31,186 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1068002938, now seen corresponding path program 1 times [2020-11-30 03:02:31,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:31,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888720180] [2020-11-30 03:02:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:02:31,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888720180] [2020-11-30 03:02:31,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:31,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:02:31,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82811088] [2020-11-30 03:02:31,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:31,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:31,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:31,314 INFO L87 Difference]: Start difference. First operand 920 states and 1163 transitions. Second operand 3 states. [2020-11-30 03:02:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:31,483 INFO L93 Difference]: Finished difference Result 2466 states and 3151 transitions. [2020-11-30 03:02:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:31,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-11-30 03:02:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:31,496 INFO L225 Difference]: With dead ends: 2466 [2020-11-30 03:02:31,497 INFO L226 Difference]: Without dead ends: 1629 [2020-11-30 03:02:31,499 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-11-30 03:02:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2020-11-30 03:02:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1625. [2020-11-30 03:02:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2020-11-30 03:02:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2050 transitions. [2020-11-30 03:02:31,630 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2050 transitions. Word has length 60 [2020-11-30 03:02:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:31,631 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 2050 transitions. [2020-11-30 03:02:31,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2050 transitions. [2020-11-30 03:02:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-30 03:02:31,634 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:31,635 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:02:31,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 03:02:31,637 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:31,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2050360039, now seen corresponding path program 1 times [2020-11-30 03:02:31,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:31,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291033865] [2020-11-30 03:02:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 03:02:31,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291033865] [2020-11-30 03:02:31,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:31,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:31,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431281403] [2020-11-30 03:02:31,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:02:31,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:31,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:02:31,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:02:31,715 INFO L87 Difference]: Start difference. First operand 1625 states and 2050 transitions. Second operand 3 states. [2020-11-30 03:02:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:31,950 INFO L93 Difference]: Finished difference Result 3753 states and 4736 transitions. [2020-11-30 03:02:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:02:31,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-11-30 03:02:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:31,966 INFO L225 Difference]: With dead ends: 3753 [2020-11-30 03:02:31,967 INFO L226 Difference]: Without dead ends: 2265 [2020-11-30 03:02:31,970 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-11-30 03:02:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2020-11-30 03:02:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2129. [2020-11-30 03:02:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2020-11-30 03:02:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2596 transitions. [2020-11-30 03:02:32,142 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2596 transitions. Word has length 60 [2020-11-30 03:02:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:32,142 INFO L481 AbstractCegarLoop]: Abstraction has 2129 states and 2596 transitions. [2020-11-30 03:02:32,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:02:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2596 transitions. [2020-11-30 03:02:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-30 03:02:32,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:32,147 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:02:32,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 03:02:32,148 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:02:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:32,149 INFO L82 PathProgramCache]: Analyzing trace with hash 298137967, now seen corresponding path program 1 times [2020-11-30 03:02:32,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:32,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143021247] [2020-11-30 03:02:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 03:02:32,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 03:02:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 03:02:32,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 03:02:32,290 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 03:02:32,295 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 03:02:32,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 03:02:32,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:02:32 BoogieIcfgContainer [2020-11-30 03:02:32,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 03:02:32,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 03:02:32,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 03:02:32,494 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 03:02:32,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:02:25" (3/4) ... [2020-11-30 03:02:32,497 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 03:02:32,687 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_406c09d5-a718-42bf-aa32-361ab5c863a7/bin/utaipan/witness.graphml [2020-11-30 03:02:32,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 03:02:32,690 INFO L168 Benchmark]: Toolchain (without parser) took 9964.16 ms. Allocated memory was 96.5 MB in the beginning and 253.8 MB in the end (delta: 157.3 MB). Free memory was 67.6 MB in the beginning and 212.3 MB in the end (delta: -144.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 16.1 GB. [2020-11-30 03:02:32,691 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 96.5 MB. Free memory was 55.8 MB in the beginning and 55.8 MB in the end (delta: 37.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:02:32,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.20 ms. Allocated memory is still 96.5 MB. Free memory was 67.3 MB in the beginning and 70.2 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 03:02:32,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.98 ms. Allocated memory is still 96.5 MB. Free memory was 70.2 MB in the beginning and 67.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 03:02:32,692 INFO L168 Benchmark]: Boogie Preprocessor took 64.92 ms. Allocated memory is still 96.5 MB. Free memory was 67.2 MB in the beginning and 64.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:02:32,693 INFO L168 Benchmark]: RCFGBuilder took 2470.29 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 64.7 MB in the beginning and 72.6 MB in the end (delta: -8.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 16.1 GB. [2020-11-30 03:02:32,694 INFO L168 Benchmark]: TraceAbstraction took 6610.33 ms. Allocated memory was 117.4 MB in the beginning and 253.8 MB in the end (delta: 136.3 MB). Free memory was 71.8 MB in the beginning and 223.9 MB in the end (delta: -152.0 MB). Peak memory consumption was 91.0 MB. Max. memory is 16.1 GB. [2020-11-30 03:02:32,694 INFO L168 Benchmark]: Witness Printer took 194.77 ms. Allocated memory is still 253.8 MB. Free memory was 223.9 MB in the beginning and 213.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 03:02:32,697 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.41 ms. Allocated memory is still 96.5 MB. Free memory was 55.8 MB in the beginning and 55.8 MB in the end (delta: 37.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 516.20 ms. Allocated memory is still 96.5 MB. Free memory was 67.3 MB in the beginning and 70.2 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 96.98 ms. Allocated memory is still 96.5 MB. Free memory was 70.2 MB in the beginning and 67.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 64.92 ms. Allocated memory is still 96.5 MB. Free memory was 67.2 MB in the beginning and 64.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2470.29 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 64.7 MB in the beginning and 72.6 MB in the end (delta: -8.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6610.33 ms. Allocated memory was 117.4 MB in the beginning and 253.8 MB in the end (delta: 136.3 MB). Free memory was 71.8 MB in the beginning and 223.9 MB in the end (delta: -152.0 MB). Peak memory consumption was 91.0 MB. Max. memory is 16.1 GB. * Witness Printer took 194.77 ms. Allocated memory is still 253.8 MB. Free memory was 223.9 MB in the beginning and 213.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L565] int __retres1 ; [L479] m_i = 1 [L480] t1_i = 1 [L481] t2_i = 1 [L506] int kernel_st ; [L507] int tmp ; [L508] int tmp___0 ; [L512] kernel_st = 0 [L213] COND TRUE m_i == 1 [L214] m_st = 0 [L218] COND TRUE t1_i == 1 [L219] t1_st = 0 [L223] COND TRUE t2_i == 1 [L224] t2_st = 0 [L326] COND FALSE !(M_E == 0) [L331] COND FALSE !(T1_E == 0) [L336] COND FALSE !(T2_E == 0) [L341] COND FALSE !(E_1 == 0) [L346] COND FALSE !(E_2 == 0) [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=2, 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] [L148] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, 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] [L158] __retres1 = 0 VAL [E_1=2, E_2=2, 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] [L160] return (__retres1); [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) [L164] int __retres1 ; VAL [E_1=2, E_2=2, 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] [L167] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, 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] [L177] __retres1 = 0 VAL [E_1=2, E_2=2, 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] [L179] return (__retres1); [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) [L183] int __retres1 ; VAL [E_1=2, E_2=2, 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] [L186] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, 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] [L196] __retres1 = 0 VAL [E_1=2, E_2=2, 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] [L198] return (__retres1); [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) [L359] COND FALSE !(M_E == 1) [L364] COND FALSE !(T1_E == 1) [L369] COND FALSE !(T2_E == 1) [L374] COND FALSE !(E_1 == 1) [L379] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, 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] [L520] COND TRUE 1 [L523] kernel_st = 1 [L259] int tmp ; VAL [E_1=2, E_2=2, 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] [L263] COND TRUE 1 [L233] int __retres1 ; [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 [L254] return (__retres1); [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, 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] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, 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] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, 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] [L80] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, 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] [L91] COND TRUE 1 [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, 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] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, 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] [L115] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, 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] [L126] COND TRUE 1 [L128] t2_pc = 1 [L129] t2_st = 2 VAL [E_1=2, E_2=2, 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] [L263] COND TRUE 1 [L233] int __retres1 ; [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 [L254] return (__retres1); [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, 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] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp_ndt_1) [L278] m_st = 1 VAL [E_1=2, E_2=2, 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] [L39] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, 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] [L50] COND TRUE 1 [L53] E_1 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=1, E_2=2, 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] [L148] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, 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] [L158] __retres1 = 0 VAL [E_1=1, E_2=2, 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] [L160] return (__retres1); [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) [L164] int __retres1 ; VAL [E_1=1, E_2=2, 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] [L167] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, 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] [L168] COND TRUE E_1 == 1 [L169] __retres1 = 1 VAL [E_1=1, E_2=2, 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] [L179] return (__retres1); [L403] tmp___0 = is_transmit1_triggered() [L405] COND TRUE \read(tmp___0) [L406] t1_st = 0 [L183] int __retres1 ; VAL [E_1=1, E_2=2, 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] [L186] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, 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] [L187] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, 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] [L196] __retres1 = 0 VAL [E_1=1, E_2=2, 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] [L198] return (__retres1); [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) [L55] E_1 = 2 VAL [E_1=2, E_2=2, 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] [L58] COND TRUE 1 [L60] m_pc = 1 [L61] m_st = 2 VAL [E_1=2, E_2=2, 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] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, 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] [L80] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, 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] [L83] COND TRUE t1_pc == 1 [L99] E_2 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=1, 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] [L148] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, 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] [L149] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, 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] [L158] __retres1 = 0 VAL [E_1=2, E_2=1, 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] [L160] return (__retres1); [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) [L164] int __retres1 ; VAL [E_1=2, E_2=1, 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] [L167] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, 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] [L168] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, 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] [L177] __retres1 = 0 VAL [E_1=2, E_2=1, 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] [L179] return (__retres1); [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) [L183] int __retres1 ; VAL [E_1=2, E_2=1, 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] [L186] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, 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] [L187] COND TRUE E_2 == 1 [L188] __retres1 = 1 VAL [E_1=2, E_2=1, 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] [L198] return (__retres1); [L411] tmp___1 = is_transmit2_triggered() [L413] COND TRUE \read(tmp___1) [L414] t2_st = 0 [L101] E_2 = 2 VAL [E_1=2, E_2=2, 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] [L91] COND TRUE 1 [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, 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] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, 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] [L115] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, 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] [L118] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, 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] [L3] __assert_fail("0", "transmitter.02.cil.c", 3, "reach_error") VAL [E_1=2, E_2=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2070 SDtfs, 1621 SDslu, 1464 SDs, 0 SdLazy, 314 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2129occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 933 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 64931 SizeOfPredicates, 5 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 132/133 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...