./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE --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 f94af16423e70ac832692bc3dd00d5592aa958be278f5f5974191233d98edf62 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1-dev-e943c26 [2021-10-24 10:34:24,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 10:34:24,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 10:34:24,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 10:34:24,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 10:34:24,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 10:34:24,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 10:34:24,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 10:34:24,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 10:34:24,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 10:34:24,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 10:34:24,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 10:34:24,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 10:34:24,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 10:34:24,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 10:34:24,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 10:34:24,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 10:34:24,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 10:34:24,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 10:34:24,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 10:34:24,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 10:34:24,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 10:34:24,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 10:34:24,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 10:34:24,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 10:34:24,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 10:34:24,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 10:34:24,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 10:34:24,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 10:34:24,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 10:34:24,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 10:34:24,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 10:34:24,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 10:34:24,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 10:34:24,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 10:34:24,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 10:34:24,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 10:34:24,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 10:34:24,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 10:34:24,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 10:34:24,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 10:34:24,267 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-24 10:34:24,321 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 10:34:24,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 10:34:24,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 10:34:24,322 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 10:34:24,322 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 10:34:24,323 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 10:34:24,323 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 10:34:24,323 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 10:34:24,323 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 10:34:24,324 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 10:34:24,324 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 10:34:24,324 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 10:34:24,324 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 10:34:24,325 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 10:34:24,325 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 10:34:24,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 10:34:24,326 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 10:34:24,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 10:34:24,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 10:34:24,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 10:34:24,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-24 10:34:24,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 10:34:24,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-24 10:34:24,328 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 10:34:24,328 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 10:34:24,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-24 10:34:24,328 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 10:34:24,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-24 10:34:24,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 10:34:24,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 10:34:24,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:34:24,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 10:34:24,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 10:34:24,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-24 10:34:24,330 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 10:34:24,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 10:34:24,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-24 10:34:24,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 10:34:24,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 10:34:24,331 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_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/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_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE 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 -> f94af16423e70ac832692bc3dd00d5592aa958be278f5f5974191233d98edf62 [2021-10-24 10:34:24,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 10:34:24,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 10:34:24,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 10:34:24,646 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 10:34:24,647 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 10:34:24,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-10-24 10:34:24,720 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/data/529b08d2c/84dac47df90849478b7897f301639c83/FLAG036256423 [2021-10-24 10:34:25,221 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 10:34:25,222 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-10-24 10:34:25,242 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/data/529b08d2c/84dac47df90849478b7897f301639c83/FLAG036256423 [2021-10-24 10:34:25,568 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/data/529b08d2c/84dac47df90849478b7897f301639c83 [2021-10-24 10:34:25,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 10:34:25,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 10:34:25,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 10:34:25,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 10:34:25,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 10:34:25,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:25,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312f5b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25, skipping insertion in model container [2021-10-24 10:34:25,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:25,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 10:34:25,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 10:34:25,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] [2021-10-24 10:34:25,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:34:25,889 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 10:34:25,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] [2021-10-24 10:34:25,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:34:25,954 INFO L208 MainTranslator]: Completed translation [2021-10-24 10:34:25,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25 WrapperNode [2021-10-24 10:34:25,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 10:34:25,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 10:34:25,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 10:34:25,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 10:34:25,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:25,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 10:34:26,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 10:34:26,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 10:34:26,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 10:34:26,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 10:34:26,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 10:34:26,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 10:34:26,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 10:34:26,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (1/1) ... [2021-10-24 10:34:26,151 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:34:26,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:34:26,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 10:34:26,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 10:34:26,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 10:34:26,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 10:34:26,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 10:34:26,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 10:34:28,308 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 10:34:28,309 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2021-10-24 10:34:28,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:28 BoogieIcfgContainer [2021-10-24 10:34:28,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 10:34:28,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 10:34:28,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 10:34:28,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 10:34:28,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:34:25" (1/3) ... [2021-10-24 10:34:28,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b24fa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:28, skipping insertion in model container [2021-10-24 10:34:28,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:25" (2/3) ... [2021-10-24 10:34:28,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b24fa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:28, skipping insertion in model container [2021-10-24 10:34:28,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:28" (3/3) ... [2021-10-24 10:34:28,327 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2021-10-24 10:34:28,338 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 10:34:28,338 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-24 10:34:28,419 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 10:34:28,429 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-24 10:34:28,430 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-24 10:34:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 149 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-24 10:34:28,470 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:28,471 INFO L512 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] [2021-10-24 10:34:28,472 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1681053004, now seen corresponding path program 1 times [2021-10-24 10:34:28,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:28,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217960576] [2021-10-24 10:34:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:28,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:28,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:28,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217960576] [2021-10-24 10:34:28,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217960576] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:28,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:28,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 10:34:28,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904091809] [2021-10-24 10:34:28,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:28,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:28,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:28,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:28,864 INFO L87 Difference]: Start difference. First operand has 150 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 149 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:29,013 INFO L93 Difference]: Finished difference Result 415 states and 637 transitions. [2021-10-24 10:34:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:29,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-24 10:34:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:29,039 INFO L225 Difference]: With dead ends: 415 [2021-10-24 10:34:29,039 INFO L226 Difference]: Without dead ends: 263 [2021-10-24 10:34:29,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-24 10:34:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2021-10-24 10:34:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 247 states have (on average 1.4939271255060729) internal successors, (369), 248 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 369 transitions. [2021-10-24 10:34:29,140 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 369 transitions. Word has length 22 [2021-10-24 10:34:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:29,141 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 369 transitions. [2021-10-24 10:34:29,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2021-10-24 10:34:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:34:29,146 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:29,147 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:29,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 10:34:29,148 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash -15810102, now seen corresponding path program 1 times [2021-10-24 10:34:29,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:29,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285159157] [2021-10-24 10:34:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:29,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-24 10:34:29,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:29,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285159157] [2021-10-24 10:34:29,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285159157] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:29,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:29,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:29,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689477650] [2021-10-24 10:34:29,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:29,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:29,269 INFO L87 Difference]: Start difference. First operand 249 states and 369 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:29,478 INFO L93 Difference]: Finished difference Result 789 states and 1161 transitions. [2021-10-24 10:34:29,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:29,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-24 10:34:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:29,490 INFO L225 Difference]: With dead ends: 789 [2021-10-24 10:34:29,490 INFO L226 Difference]: Without dead ends: 549 [2021-10-24 10:34:29,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:34:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-10-24 10:34:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 435. [2021-10-24 10:34:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 433 states have (on average 1.466512702078522) internal successors, (635), 434 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 635 transitions. [2021-10-24 10:34:29,538 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 635 transitions. Word has length 43 [2021-10-24 10:34:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:29,538 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 635 transitions. [2021-10-24 10:34:29,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 635 transitions. [2021-10-24 10:34:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:34:29,542 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:29,542 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:29,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 10:34:29,543 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:29,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1780626711, now seen corresponding path program 1 times [2021-10-24 10:34:29,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:29,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085490436] [2021-10-24 10:34:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:29,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-24 10:34:29,614 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:29,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085490436] [2021-10-24 10:34:29,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085490436] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:29,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:29,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 10:34:29,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266312901] [2021-10-24 10:34:29,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:29,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:29,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:29,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:29,617 INFO L87 Difference]: Start difference. First operand 435 states and 635 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:29,679 INFO L93 Difference]: Finished difference Result 1201 states and 1753 transitions. [2021-10-24 10:34:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:29,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-24 10:34:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:29,685 INFO L225 Difference]: With dead ends: 1201 [2021-10-24 10:34:29,685 INFO L226 Difference]: Without dead ends: 778 [2021-10-24 10:34:29,686 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-10-24 10:34:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 770. [2021-10-24 10:34:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 768 states have (on average 1.4401041666666667) internal successors, (1106), 769 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1106 transitions. [2021-10-24 10:34:29,723 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1106 transitions. Word has length 43 [2021-10-24 10:34:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:29,723 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1106 transitions. [2021-10-24 10:34:29,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1106 transitions. [2021-10-24 10:34:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:34:29,727 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:29,727 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:29,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-24 10:34:29,728 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:29,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:29,728 INFO L82 PathProgramCache]: Analyzing trace with hash -66578295, now seen corresponding path program 1 times [2021-10-24 10:34:29,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:29,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044069515] [2021-10-24 10:34:29,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:29,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:29,805 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:29,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044069515] [2021-10-24 10:34:29,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044069515] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:29,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:29,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:29,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61502224] [2021-10-24 10:34:29,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:29,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:29,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:29,808 INFO L87 Difference]: Start difference. First operand 770 states and 1106 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:29,965 INFO L93 Difference]: Finished difference Result 2528 states and 3592 transitions. [2021-10-24 10:34:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-24 10:34:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:29,976 INFO L225 Difference]: With dead ends: 2528 [2021-10-24 10:34:29,977 INFO L226 Difference]: Without dead ends: 1763 [2021-10-24 10:34:29,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:34:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2021-10-24 10:34:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1369. [2021-10-24 10:34:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1367 states have (on average 1.415508412582297) internal successors, (1935), 1368 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1935 transitions. [2021-10-24 10:34:30,079 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1935 transitions. Word has length 43 [2021-10-24 10:34:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:30,079 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1935 transitions. [2021-10-24 10:34:30,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1935 transitions. [2021-10-24 10:34:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:34:30,082 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:30,082 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:30,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-24 10:34:30,083 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash 594755496, now seen corresponding path program 1 times [2021-10-24 10:34:30,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:30,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146481094] [2021-10-24 10:34:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:30,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:30,138 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:30,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146481094] [2021-10-24 10:34:30,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146481094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:30,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:30,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:30,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882358537] [2021-10-24 10:34:30,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:30,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:30,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:30,141 INFO L87 Difference]: Start difference. First operand 1369 states and 1935 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:30,237 INFO L93 Difference]: Finished difference Result 2373 states and 3433 transitions. [2021-10-24 10:34:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-24 10:34:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:30,247 INFO L225 Difference]: With dead ends: 2373 [2021-10-24 10:34:30,247 INFO L226 Difference]: Without dead ends: 1589 [2021-10-24 10:34:30,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-10-24 10:34:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1501. [2021-10-24 10:34:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1499 states have (on average 1.4402935290193462) internal successors, (2159), 1500 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2159 transitions. [2021-10-24 10:34:30,321 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2159 transitions. Word has length 43 [2021-10-24 10:34:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:30,323 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 2159 transitions. [2021-10-24 10:34:30,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2159 transitions. [2021-10-24 10:34:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-24 10:34:30,329 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:30,330 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:30,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-24 10:34:30,330 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1551422771, now seen corresponding path program 1 times [2021-10-24 10:34:30,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:30,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16071169] [2021-10-24 10:34:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:30,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:30,457 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:30,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16071169] [2021-10-24 10:34:30,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16071169] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:30,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:30,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:30,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058465447] [2021-10-24 10:34:30,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:30,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:30,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:30,466 INFO L87 Difference]: Start difference. First operand 1501 states and 2159 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:30,586 INFO L93 Difference]: Finished difference Result 2517 states and 3645 transitions. [2021-10-24 10:34:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-24 10:34:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:30,595 INFO L225 Difference]: With dead ends: 2517 [2021-10-24 10:34:30,596 INFO L226 Difference]: Without dead ends: 1601 [2021-10-24 10:34:30,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2021-10-24 10:34:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1501. [2021-10-24 10:34:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1499 states have (on average 1.4056037358238826) internal successors, (2107), 1500 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2107 transitions. [2021-10-24 10:34:30,667 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2107 transitions. Word has length 62 [2021-10-24 10:34:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:30,668 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 2107 transitions. [2021-10-24 10:34:30,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2107 transitions. [2021-10-24 10:34:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-24 10:34:30,672 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:30,672 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:30,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-24 10:34:30,673 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1153149548, now seen corresponding path program 1 times [2021-10-24 10:34:30,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:30,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911747936] [2021-10-24 10:34:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:30,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:34:30,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:30,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911747936] [2021-10-24 10:34:30,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911747936] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:30,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:30,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:30,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255325464] [2021-10-24 10:34:30,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:30,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:30,803 INFO L87 Difference]: Start difference. First operand 1501 states and 2107 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:31,045 INFO L93 Difference]: Finished difference Result 5161 states and 7285 transitions. [2021-10-24 10:34:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:31,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-24 10:34:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:31,068 INFO L225 Difference]: With dead ends: 5161 [2021-10-24 10:34:31,068 INFO L226 Difference]: Without dead ends: 3673 [2021-10-24 10:34:31,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2021-10-24 10:34:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 2785. [2021-10-24 10:34:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2783 states have (on average 1.393819619116062) internal successors, (3879), 2784 states have internal predecessors, (3879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3879 transitions. [2021-10-24 10:34:31,255 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3879 transitions. Word has length 62 [2021-10-24 10:34:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:31,255 INFO L470 AbstractCegarLoop]: Abstraction has 2785 states and 3879 transitions. [2021-10-24 10:34:31,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3879 transitions. [2021-10-24 10:34:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-24 10:34:31,261 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:31,262 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:31,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-24 10:34:31,262 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2017211270, now seen corresponding path program 1 times [2021-10-24 10:34:31,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:31,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955835212] [2021-10-24 10:34:31,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:31,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:31,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:31,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955835212] [2021-10-24 10:34:31,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955835212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:31,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:31,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:34:31,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343550848] [2021-10-24 10:34:31,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:31,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:31,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:31,344 INFO L87 Difference]: Start difference. First operand 2785 states and 3879 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:31,560 INFO L93 Difference]: Finished difference Result 6061 states and 8622 transitions. [2021-10-24 10:34:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:34:31,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-24 10:34:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:31,580 INFO L225 Difference]: With dead ends: 6061 [2021-10-24 10:34:31,580 INFO L226 Difference]: Without dead ends: 3289 [2021-10-24 10:34:31,585 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:34:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2021-10-24 10:34:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2258. [2021-10-24 10:34:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2256 states have (on average 1.4184397163120568) internal successors, (3200), 2257 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3200 transitions. [2021-10-24 10:34:31,734 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3200 transitions. Word has length 63 [2021-10-24 10:34:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:31,735 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 3200 transitions. [2021-10-24 10:34:31,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3200 transitions. [2021-10-24 10:34:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-24 10:34:31,740 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:31,740 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:31,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-24 10:34:31,741 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1454758849, now seen corresponding path program 1 times [2021-10-24 10:34:31,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:31,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340153668] [2021-10-24 10:34:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:31,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:31,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:31,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340153668] [2021-10-24 10:34:31,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340153668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:31,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:31,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:31,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983621259] [2021-10-24 10:34:31,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:31,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:31,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:31,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:31,791 INFO L87 Difference]: Start difference. First operand 2258 states and 3200 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:31,914 INFO L93 Difference]: Finished difference Result 4502 states and 6386 transitions. [2021-10-24 10:34:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:31,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-10-24 10:34:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:31,927 INFO L225 Difference]: With dead ends: 4502 [2021-10-24 10:34:31,928 INFO L226 Difference]: Without dead ends: 2258 [2021-10-24 10:34:31,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2021-10-24 10:34:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2258. [2021-10-24 10:34:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2256 states have (on average 1.400709219858156) internal successors, (3160), 2257 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3160 transitions. [2021-10-24 10:34:32,079 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3160 transitions. Word has length 65 [2021-10-24 10:34:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:32,079 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 3160 transitions. [2021-10-24 10:34:32,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3160 transitions. [2021-10-24 10:34:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-24 10:34:32,084 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:32,085 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:32,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-24 10:34:32,085 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:32,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash 481269890, now seen corresponding path program 1 times [2021-10-24 10:34:32,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:32,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141276865] [2021-10-24 10:34:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:32,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:32,123 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:32,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141276865] [2021-10-24 10:34:32,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141276865] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:32,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:32,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:32,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764595789] [2021-10-24 10:34:32,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:32,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:32,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:32,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:32,126 INFO L87 Difference]: Start difference. First operand 2258 states and 3160 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:32,232 INFO L93 Difference]: Finished difference Result 3860 states and 5419 transitions. [2021-10-24 10:34:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-10-24 10:34:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:32,242 INFO L225 Difference]: With dead ends: 3860 [2021-10-24 10:34:32,242 INFO L226 Difference]: Without dead ends: 1616 [2021-10-24 10:34:32,246 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2021-10-24 10:34:32,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1597. [2021-10-24 10:34:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1595 states have (on average 1.3692789968652037) internal successors, (2184), 1596 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2184 transitions. [2021-10-24 10:34:32,329 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2184 transitions. Word has length 65 [2021-10-24 10:34:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:32,330 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2184 transitions. [2021-10-24 10:34:32,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2184 transitions. [2021-10-24 10:34:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-24 10:34:32,334 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:32,334 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:32,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-24 10:34:32,335 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1578794294, now seen corresponding path program 1 times [2021-10-24 10:34:32,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:32,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253706424] [2021-10-24 10:34:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:32,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:34:32,405 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:32,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253706424] [2021-10-24 10:34:32,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253706424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:32,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:32,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:32,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638578602] [2021-10-24 10:34:32,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:32,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:32,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:32,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:32,408 INFO L87 Difference]: Start difference. First operand 1597 states and 2184 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:32,517 INFO L93 Difference]: Finished difference Result 2657 states and 3657 transitions. [2021-10-24 10:34:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:32,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-10-24 10:34:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:32,527 INFO L225 Difference]: With dead ends: 2657 [2021-10-24 10:34:32,527 INFO L226 Difference]: Without dead ends: 1670 [2021-10-24 10:34:32,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:32,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2021-10-24 10:34:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1597. [2021-10-24 10:34:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1595 states have (on average 1.3510971786833856) internal successors, (2155), 1596 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2155 transitions. [2021-10-24 10:34:32,622 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2155 transitions. Word has length 66 [2021-10-24 10:34:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:32,622 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2155 transitions. [2021-10-24 10:34:32,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2155 transitions. [2021-10-24 10:34:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-24 10:34:32,627 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:32,627 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:32,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-24 10:34:32,628 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash 617875508, now seen corresponding path program 1 times [2021-10-24 10:34:32,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:32,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234757398] [2021-10-24 10:34:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:32,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:34:32,691 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:32,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234757398] [2021-10-24 10:34:32,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234757398] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:32,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:32,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:34:32,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571334060] [2021-10-24 10:34:32,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:32,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:32,694 INFO L87 Difference]: Start difference. First operand 1597 states and 2155 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:32,882 INFO L93 Difference]: Finished difference Result 2888 states and 3904 transitions. [2021-10-24 10:34:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-10-24 10:34:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:32,896 INFO L225 Difference]: With dead ends: 2888 [2021-10-24 10:34:32,896 INFO L226 Difference]: Without dead ends: 1901 [2021-10-24 10:34:32,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2021-10-24 10:34:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1722. [2021-10-24 10:34:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1720 states have (on average 1.316860465116279) internal successors, (2265), 1721 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2265 transitions. [2021-10-24 10:34:33,041 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2265 transitions. Word has length 67 [2021-10-24 10:34:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:33,042 INFO L470 AbstractCegarLoop]: Abstraction has 1722 states and 2265 transitions. [2021-10-24 10:34:33,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2265 transitions. [2021-10-24 10:34:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-24 10:34:33,047 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:33,047 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:33,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-24 10:34:33,048 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1755670380, now seen corresponding path program 1 times [2021-10-24 10:34:33,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:33,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348776293] [2021-10-24 10:34:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:33,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:33,097 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:33,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348776293] [2021-10-24 10:34:33,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348776293] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:34:33,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128576964] [2021-10-24 10:34:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:33,098 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:34:33,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:34:33,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:34:33,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-24 10:34:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:33,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 10:34:33,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:34:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:33,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:34:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:33,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128576964] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:33,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:34:33,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-24 10:34:33,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642144430] [2021-10-24 10:34:33,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:33,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:34:33,697 INFO L87 Difference]: Start difference. First operand 1722 states and 2265 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:33,851 INFO L93 Difference]: Finished difference Result 3545 states and 4707 transitions. [2021-10-24 10:34:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:33,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-10-24 10:34:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:33,865 INFO L225 Difference]: With dead ends: 3545 [2021-10-24 10:34:33,865 INFO L226 Difference]: Without dead ends: 2385 [2021-10-24 10:34:33,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:34:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2021-10-24 10:34:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1893. [2021-10-24 10:34:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1891 states have (on average 1.337916446324696) internal successors, (2530), 1892 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2530 transitions. [2021-10-24 10:34:34,014 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2530 transitions. Word has length 70 [2021-10-24 10:34:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:34,015 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 2530 transitions. [2021-10-24 10:34:34,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2530 transitions. [2021-10-24 10:34:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-24 10:34:34,020 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:34,020 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:34,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-24 10:34:34,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-24 10:34:34,243 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1855930243, now seen corresponding path program 1 times [2021-10-24 10:34:34,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:34,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560182564] [2021-10-24 10:34:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:34,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:34:34,285 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:34,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560182564] [2021-10-24 10:34:34,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560182564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:34,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:34,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:34,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772606234] [2021-10-24 10:34:34,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:34,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:34,288 INFO L87 Difference]: Start difference. First operand 1893 states and 2530 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:34,483 INFO L93 Difference]: Finished difference Result 4413 states and 5975 transitions. [2021-10-24 10:34:34,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:34,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-10-24 10:34:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:34,510 INFO L225 Difference]: With dead ends: 4413 [2021-10-24 10:34:34,517 INFO L226 Difference]: Without dead ends: 2534 [2021-10-24 10:34:34,521 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2021-10-24 10:34:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2261. [2021-10-24 10:34:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2259 states have (on average 1.372731297034086) internal successors, (3101), 2260 states have internal predecessors, (3101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3101 transitions. [2021-10-24 10:34:34,664 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3101 transitions. Word has length 70 [2021-10-24 10:34:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:34,665 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 3101 transitions. [2021-10-24 10:34:34,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3101 transitions. [2021-10-24 10:34:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-24 10:34:34,670 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:34,670 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:34,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-24 10:34:34,670 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash 229338890, now seen corresponding path program 1 times [2021-10-24 10:34:34,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:34,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096477424] [2021-10-24 10:34:34,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:34,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:34,731 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:34,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096477424] [2021-10-24 10:34:34,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096477424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:34,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:34,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:34,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368279209] [2021-10-24 10:34:34,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:34,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:34,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:34,735 INFO L87 Difference]: Start difference. First operand 2261 states and 3101 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:34,887 INFO L93 Difference]: Finished difference Result 3881 states and 5364 transitions. [2021-10-24 10:34:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-10-24 10:34:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:34,893 INFO L225 Difference]: With dead ends: 3881 [2021-10-24 10:34:34,893 INFO L226 Difference]: Without dead ends: 2268 [2021-10-24 10:34:34,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2021-10-24 10:34:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2236. [2021-10-24 10:34:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2234 states have (on average 1.3307967770814682) internal successors, (2973), 2235 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2973 transitions. [2021-10-24 10:34:35,041 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2973 transitions. Word has length 71 [2021-10-24 10:34:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:35,041 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2973 transitions. [2021-10-24 10:34:35,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2973 transitions. [2021-10-24 10:34:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-24 10:34:35,046 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:35,047 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:35,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-24 10:34:35,047 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:35,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:35,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1517533419, now seen corresponding path program 1 times [2021-10-24 10:34:35,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:35,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288915380] [2021-10-24 10:34:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:35,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:34:35,092 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:35,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288915380] [2021-10-24 10:34:35,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288915380] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:35,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:35,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 10:34:35,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546286971] [2021-10-24 10:34:35,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:35,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:35,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:35,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:35,094 INFO L87 Difference]: Start difference. First operand 2236 states and 2973 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:35,250 INFO L93 Difference]: Finished difference Result 3819 states and 5096 transitions. [2021-10-24 10:34:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:35,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-10-24 10:34:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:35,273 INFO L225 Difference]: With dead ends: 3819 [2021-10-24 10:34:35,273 INFO L226 Difference]: Without dead ends: 2236 [2021-10-24 10:34:35,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2021-10-24 10:34:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2236. [2021-10-24 10:34:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2234 states have (on average 1.311996418979409) internal successors, (2931), 2235 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2931 transitions. [2021-10-24 10:34:35,425 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2931 transitions. Word has length 71 [2021-10-24 10:34:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:35,425 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2931 transitions. [2021-10-24 10:34:35,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2931 transitions. [2021-10-24 10:34:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-24 10:34:35,430 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:35,431 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:35,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-24 10:34:35,431 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash 6215176, now seen corresponding path program 1 times [2021-10-24 10:34:35,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:35,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206063369] [2021-10-24 10:34:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:35,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:35,522 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:35,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206063369] [2021-10-24 10:34:35,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206063369] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:35,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:35,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:34:35,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306891268] [2021-10-24 10:34:35,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:35,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:35,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:35,524 INFO L87 Difference]: Start difference. First operand 2236 states and 2931 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:35,767 INFO L93 Difference]: Finished difference Result 5080 states and 6591 transitions. [2021-10-24 10:34:35,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:35,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-10-24 10:34:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:35,779 INFO L225 Difference]: With dead ends: 5080 [2021-10-24 10:34:35,781 INFO L226 Difference]: Without dead ends: 3497 [2021-10-24 10:34:35,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2021-10-24 10:34:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 2822. [2021-10-24 10:34:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2820 states have (on average 1.275886524822695) internal successors, (3598), 2821 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3598 transitions. [2021-10-24 10:34:35,974 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3598 transitions. Word has length 73 [2021-10-24 10:34:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:35,974 INFO L470 AbstractCegarLoop]: Abstraction has 2822 states and 3598 transitions. [2021-10-24 10:34:35,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3598 transitions. [2021-10-24 10:34:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-24 10:34:35,980 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:35,980 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:35,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-24 10:34:35,981 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash 543746611, now seen corresponding path program 1 times [2021-10-24 10:34:35,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:35,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666067518] [2021-10-24 10:34:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:35,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:36,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:36,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666067518] [2021-10-24 10:34:36,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666067518] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:34:36,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480964724] [2021-10-24 10:34:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:36,029 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:34:36,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:34:36,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:34:36,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-24 10:34:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:36,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 10:34:36,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:34:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:36,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:34:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:36,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480964724] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:36,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:34:36,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-24 10:34:36,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259843921] [2021-10-24 10:34:36,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:36,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:36,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:34:36,639 INFO L87 Difference]: Start difference. First operand 2822 states and 3598 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:36,927 INFO L93 Difference]: Finished difference Result 6264 states and 7985 transitions. [2021-10-24 10:34:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:36,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-10-24 10:34:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:36,938 INFO L225 Difference]: With dead ends: 6264 [2021-10-24 10:34:36,938 INFO L226 Difference]: Without dead ends: 3498 [2021-10-24 10:34:36,944 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.6ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:34:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-10-24 10:34:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 2965. [2021-10-24 10:34:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2963 states have (on average 1.2824839689503882) internal successors, (3800), 2964 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3800 transitions. [2021-10-24 10:34:37,161 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3800 transitions. Word has length 91 [2021-10-24 10:34:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:37,161 INFO L470 AbstractCegarLoop]: Abstraction has 2965 states and 3800 transitions. [2021-10-24 10:34:37,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3800 transitions. [2021-10-24 10:34:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-24 10:34:37,168 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:37,168 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:37,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-24 10:34:37,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-24 10:34:37,384 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:37,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1830675513, now seen corresponding path program 1 times [2021-10-24 10:34:37,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:37,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784550801] [2021-10-24 10:34:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:37,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:34:37,444 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:37,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784550801] [2021-10-24 10:34:37,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784550801] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:34:37,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105056822] [2021-10-24 10:34:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:37,445 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:34:37,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:34:37,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:34:37,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-24 10:34:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:37,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-24 10:34:37,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:34:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:34:38,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:34:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:34:38,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105056822] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:38,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:34:38,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 5 [2021-10-24 10:34:38,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274667126] [2021-10-24 10:34:38,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:38,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:38,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:34:38,363 INFO L87 Difference]: Start difference. First operand 2965 states and 3800 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:38,617 INFO L93 Difference]: Finished difference Result 5794 states and 7406 transitions. [2021-10-24 10:34:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-10-24 10:34:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:38,624 INFO L225 Difference]: With dead ends: 5794 [2021-10-24 10:34:38,624 INFO L226 Difference]: Without dead ends: 3003 [2021-10-24 10:34:38,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:34:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2021-10-24 10:34:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2965. [2021-10-24 10:34:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2963 states have (on average 1.2645966925413432) internal successors, (3747), 2964 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3747 transitions. [2021-10-24 10:34:38,802 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3747 transitions. Word has length 93 [2021-10-24 10:34:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:38,802 INFO L470 AbstractCegarLoop]: Abstraction has 2965 states and 3747 transitions. [2021-10-24 10:34:38,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3747 transitions. [2021-10-24 10:34:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-24 10:34:38,813 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:38,813 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:38,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-24 10:34:39,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:34:39,039 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash -767543943, now seen corresponding path program 1 times [2021-10-24 10:34:39,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:39,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728651744] [2021-10-24 10:34:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:39,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:39,085 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:39,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728651744] [2021-10-24 10:34:39,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728651744] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:39,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:39,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:34:39,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430056307] [2021-10-24 10:34:39,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:34:39,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:34:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:39,088 INFO L87 Difference]: Start difference. First operand 2965 states and 3747 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:39,260 INFO L93 Difference]: Finished difference Result 5141 states and 6501 transitions. [2021-10-24 10:34:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:34:39,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-24 10:34:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:39,266 INFO L225 Difference]: With dead ends: 5141 [2021-10-24 10:34:39,266 INFO L226 Difference]: Without dead ends: 2358 [2021-10-24 10:34:39,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:34:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2021-10-24 10:34:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2326. [2021-10-24 10:34:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2324 states have (on average 1.2220309810671257) internal successors, (2840), 2325 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2840 transitions. [2021-10-24 10:34:39,408 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2840 transitions. Word has length 94 [2021-10-24 10:34:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:39,408 INFO L470 AbstractCegarLoop]: Abstraction has 2326 states and 2840 transitions. [2021-10-24 10:34:39,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2840 transitions. [2021-10-24 10:34:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-24 10:34:39,414 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:39,414 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:39,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-24 10:34:39,415 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash 707507586, now seen corresponding path program 1 times [2021-10-24 10:34:39,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:39,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003131240] [2021-10-24 10:34:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:39,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:39,483 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:39,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003131240] [2021-10-24 10:34:39,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003131240] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:39,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:39,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:34:39,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969408804] [2021-10-24 10:34:39,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:39,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:39,485 INFO L87 Difference]: Start difference. First operand 2326 states and 2840 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:39,739 INFO L93 Difference]: Finished difference Result 5014 states and 6029 transitions. [2021-10-24 10:34:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:39,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-10-24 10:34:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:39,746 INFO L225 Difference]: With dead ends: 5014 [2021-10-24 10:34:39,746 INFO L226 Difference]: Without dead ends: 3299 [2021-10-24 10:34:39,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:34:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2021-10-24 10:34:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 2750. [2021-10-24 10:34:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2748 states have (on average 1.1812227074235808) internal successors, (3246), 2749 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3246 transitions. [2021-10-24 10:34:39,903 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3246 transitions. Word has length 96 [2021-10-24 10:34:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:39,904 INFO L470 AbstractCegarLoop]: Abstraction has 2750 states and 3246 transitions. [2021-10-24 10:34:39,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3246 transitions. [2021-10-24 10:34:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-10-24 10:34:39,910 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:39,910 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:39,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-24 10:34:39,911 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash -32283515, now seen corresponding path program 1 times [2021-10-24 10:34:39,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:39,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547614588] [2021-10-24 10:34:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:39,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:39,991 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:39,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547614588] [2021-10-24 10:34:39,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547614588] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:34:39,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299928711] [2021-10-24 10:34:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:39,992 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:34:39,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:34:39,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:34:40,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-24 10:34:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:40,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 10:34:40,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:34:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:40,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:34:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:34:40,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299928711] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:40,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:34:40,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-24 10:34:40,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434089795] [2021-10-24 10:34:40,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:34:40,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:34:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:34:40,787 INFO L87 Difference]: Start difference. First operand 2750 states and 3246 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:41,042 INFO L93 Difference]: Finished difference Result 5976 states and 7105 transitions. [2021-10-24 10:34:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:34:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-10-24 10:34:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:41,050 INFO L225 Difference]: With dead ends: 5976 [2021-10-24 10:34:41,050 INFO L226 Difference]: Without dead ends: 3464 [2021-10-24 10:34:41,055 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:34:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2021-10-24 10:34:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3037. [2021-10-24 10:34:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3035 states have (on average 1.2125205930807248) internal successors, (3680), 3036 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 3680 transitions. [2021-10-24 10:34:41,265 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 3680 transitions. Word has length 115 [2021-10-24 10:34:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:41,265 INFO L470 AbstractCegarLoop]: Abstraction has 3037 states and 3680 transitions. [2021-10-24 10:34:41,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 3680 transitions. [2021-10-24 10:34:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-24 10:34:41,270 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:41,271 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:41,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-24 10:34:41,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-24 10:34:41,498 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:41,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1918626126, now seen corresponding path program 1 times [2021-10-24 10:34:41,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:41,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157978356] [2021-10-24 10:34:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:41,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:34:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:34:41,632 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:34:41,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157978356] [2021-10-24 10:34:41,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157978356] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:34:41,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:34:41,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 10:34:41,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739584740] [2021-10-24 10:34:41,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:34:41,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:34:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:34:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:34:41,637 INFO L87 Difference]: Start difference. First operand 3037 states and 3680 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:34:42,418 INFO L93 Difference]: Finished difference Result 11425 states and 13837 transitions. [2021-10-24 10:34:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:34:42,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-10-24 10:34:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:34:42,445 INFO L225 Difference]: With dead ends: 11425 [2021-10-24 10:34:42,446 INFO L226 Difference]: Without dead ends: 10209 [2021-10-24 10:34:42,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:34:42,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10209 states. [2021-10-24 10:34:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10209 to 5303. [2021-10-24 10:34:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5303 states, 5301 states have (on average 1.1992076966610075) internal successors, (6357), 5302 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 6357 transitions. [2021-10-24 10:34:42,996 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 6357 transitions. Word has length 118 [2021-10-24 10:34:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:34:42,997 INFO L470 AbstractCegarLoop]: Abstraction has 5303 states and 6357 transitions. [2021-10-24 10:34:42,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:34:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 6357 transitions. [2021-10-24 10:34:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-24 10:34:43,005 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:34:43,005 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:34:43,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-24 10:34:43,005 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:34:43,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:34:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash 638708002, now seen corresponding path program 1 times [2021-10-24 10:34:43,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:34:43,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75845653] [2021-10-24 10:34:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:34:43,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:34:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 10:34:43,053 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-24 10:34:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 10:34:43,214 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-24 10:34:43,214 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-24 10:34:43,216 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:34:43,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:34:43,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-24 10:34:43,227 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 10:34:43,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:34:43 BoogieIcfgContainer [2021-10-24 10:34:43,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 10:34:43,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 10:34:43,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 10:34:43,491 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 10:34:43,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:28" (3/4) ... [2021-10-24 10:34:43,495 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-24 10:34:43,679 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 10:34:43,679 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 10:34:43,681 INFO L168 Benchmark]: Toolchain (without parser) took 18106.97 ms. Allocated memory was 104.9 MB in the beginning and 476.1 MB in the end (delta: 371.2 MB). Free memory was 72.8 MB in the beginning and 167.1 MB in the end (delta: -94.2 MB). Peak memory consumption was 276.2 MB. Max. memory is 16.1 GB. [2021-10-24 10:34:43,681 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 104.9 MB. Free memory is still 58.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:34:43,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.43 ms. Allocated memory is still 104.9 MB. Free memory was 72.6 MB in the beginning and 75.8 MB in the end (delta: -3.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:34:43,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.72 ms. Allocated memory is still 104.9 MB. Free memory was 75.8 MB in the beginning and 72.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-24 10:34:43,683 INFO L168 Benchmark]: Boogie Preprocessor took 91.62 ms. Allocated memory is still 104.9 MB. Free memory was 72.0 MB in the beginning and 68.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:34:43,683 INFO L168 Benchmark]: RCFGBuilder took 2170.57 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 68.8 MB in the beginning and 93.5 MB in the end (delta: -24.6 MB). Peak memory consumption was 54.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:34:43,683 INFO L168 Benchmark]: TraceAbstraction took 15173.96 ms. Allocated memory was 125.8 MB in the beginning and 476.1 MB in the end (delta: 350.2 MB). Free memory was 93.3 MB in the beginning and 191.2 MB in the end (delta: -97.9 MB). Peak memory consumption was 253.4 MB. Max. memory is 16.1 GB. [2021-10-24 10:34:43,684 INFO L168 Benchmark]: Witness Printer took 188.79 ms. Allocated memory is still 476.1 MB. Free memory was 191.2 MB in the beginning and 167.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:34:43,686 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.29 ms. Allocated memory is still 104.9 MB. Free memory is still 58.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 368.43 ms. Allocated memory is still 104.9 MB. Free memory was 72.6 MB in the beginning and 75.8 MB in the end (delta: -3.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.72 ms. Allocated memory is still 104.9 MB. Free memory was 75.8 MB in the beginning and 72.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.62 ms. Allocated memory is still 104.9 MB. Free memory was 72.0 MB in the beginning and 68.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2170.57 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 68.8 MB in the beginning and 93.5 MB in the end (delta: -24.6 MB). Peak memory consumption was 54.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15173.96 ms. Allocated memory was 125.8 MB in the beginning and 476.1 MB in the end (delta: 350.2 MB). Free memory was 93.3 MB in the beginning and 191.2 MB in the end (delta: -97.9 MB). Peak memory consumption was 253.4 MB. Max. memory is 16.1 GB. * Witness Printer took 188.79 ms. Allocated memory is still 476.1 MB. Free memory was 191.2 MB in the beginning and 167.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int t3_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int M_E = 2; [L29] int T1_E = 2; [L30] int T2_E = 2; [L31] int T3_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L41] int token ; [L43] int local ; [L727] int __retres1 ; [L640] m_i = 1 [L641] t1_i = 1 [L642] t2_i = 1 [L643] t3_i = 1 [L668] int kernel_st ; [L669] int tmp ; [L670] int tmp___0 ; [L674] kernel_st = 0 [L296] COND TRUE m_i == 1 [L297] m_st = 0 [L301] COND TRUE t1_i == 1 [L302] t1_st = 0 [L306] COND TRUE t2_i == 1 [L307] t2_st = 0 [L311] COND TRUE t3_i == 1 [L312] t3_st = 0 [L433] COND FALSE !(M_E == 0) [L438] COND FALSE !(T1_E == 0) [L443] COND FALSE !(T2_E == 0) [L448] COND FALSE !(T3_E == 0) [L453] COND FALSE !(E_M == 0) [L458] COND FALSE !(E_1 == 0) [L463] COND FALSE !(E_2 == 0) [L468] COND FALSE !(E_3 == 0) [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L231] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L250] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L269] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L481] COND FALSE !(M_E == 1) [L486] COND FALSE !(T1_E == 1) [L491] COND FALSE !(T2_E == 1) [L496] COND FALSE !(T3_E == 1) [L501] COND FALSE !(E_M == 1) [L506] COND FALSE !(E_1 == 1) [L511] COND FALSE !(E_2 == 1) [L516] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L682] COND TRUE 1 [L685] kernel_st = 1 [L352] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L104] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L115] COND TRUE 1 [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L140] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L151] COND TRUE 1 [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L176] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L187] COND TRUE 1 [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L59] COND TRUE 1 [L62] token = __VERIFIER_nondet_int() [L63] local = token [L64] E_1 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L222] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L231] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] COND TRUE E_1 == 1 [L233] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND TRUE \read(tmp___0) [L544] t1_st = 0 [L247] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L250] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L260] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L269] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L279] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L66] E_1 = 2 [L67] m_pc = 1 [L68] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L104] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L107] COND TRUE t1_pc == 1 [L123] token += 1 [L124] E_2 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L222] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L241] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] COND TRUE E_2 == 1 [L252] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND TRUE \read(tmp___1) [L552] t2_st = 0 [L266] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L279] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L126] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L115] COND TRUE 1 [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L140] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L143] COND TRUE t2_pc == 1 [L159] token += 1 [L160] E_3 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] COND TRUE E_3 == 1 [L271] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND TRUE \read(tmp___2) [L560] t3_st = 0 [L162] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L151] COND TRUE 1 [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L176] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L179] COND TRUE t3_pc == 1 [L195] token += 1 [L196] E_M = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L213] COND TRUE E_M == 1 [L214] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND TRUE \read(tmp) [L536] m_st = 0 [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L198] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L187] COND TRUE 1 [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L51] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L73] COND FALSE !(token != local + 3) [L78] COND TRUE tmp_var <= 5 [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L84] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L85] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L86] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L12] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14806.8ms, OverallIterations: 24, TraceHistogramMax: 3, EmptinessCheckTime: 130.1ms, AutomataDifference: 5174.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6172 SDtfs, 4837 SDslu, 6567 SDs, 0 SdLazy, 780 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 835.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 823 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 166.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5303occurred in iteration=23, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3370.1ms AutomataMinimizationTime, 23 MinimizatonAttempts, 10865 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 204.7ms SsaConstructionTime, 745.6ms SatisfiabilityAnalysisTime, 3133.6ms InterpolantComputationTime, 2096 NumberOfCodeBlocks, 2096 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2313 ConstructedInterpolants, 0 QuantifiedInterpolants, 4259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1664 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 482/494 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! [2021-10-24 10:34:43,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec3c0ddd-972f-4259-8f85-f186a7c96e64/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...