./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/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_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8 --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 ba5ca2b9b2a5f86416453e0608f62cc01593f29e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-4e77c04 [2021-10-13 07:47:48,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:47:48,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:47:48,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:47:48,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:47:48,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:47:48,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:47:48,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:47:48,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:47:48,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:47:48,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:47:48,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:47:48,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:47:48,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:47:48,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:47:48,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:47:48,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:47:48,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:47:48,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:47:48,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:47:49,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:47:49,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:47:49,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:47:49,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:47:49,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:47:49,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:47:49,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:47:49,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:47:49,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:47:49,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:47:49,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:47:49,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:47:49,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:47:49,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:47:49,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:47:49,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:47:49,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:47:49,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:47:49,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:47:49,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:47:49,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:47:49,040 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:47:49,094 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:47:49,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:47:49,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:47:49,096 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:47:49,097 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:47:49,097 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:47:49,097 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:47:49,098 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:47:49,106 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:47:49,106 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:47:49,107 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:47:49,108 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:47:49,108 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:47:49,108 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:47:49,109 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:47:49,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:47:49,110 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:47:49,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:47:49,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:47:49,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:47:49,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:47:49,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:47:49,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:47:49,112 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:47:49,112 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:47:49,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:47:49,113 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:47:49,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:47:49,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:47:49,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:47:49,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:47:49,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:47:49,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:47:49,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:47:49,115 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:47:49,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:47:49,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:47:49,116 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:47:49,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:47:49,117 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_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/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_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8 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 -> ba5ca2b9b2a5f86416453e0608f62cc01593f29e [2021-10-13 07:47:49,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:47:49,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:47:49,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:47:49,470 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:47:49,471 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:47:49,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-10-13 07:47:49,545 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/data/ac4c23422/e0bc543e21e64da283a848f16953deb2/FLAG5a340810c [2021-10-13 07:47:50,152 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:47:50,153 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-10-13 07:47:50,164 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/data/ac4c23422/e0bc543e21e64da283a848f16953deb2/FLAG5a340810c [2021-10-13 07:47:50,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/data/ac4c23422/e0bc543e21e64da283a848f16953deb2 [2021-10-13 07:47:50,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:47:50,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:47:50,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:47:50,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:47:50,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:47:50,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:50,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a79d917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50, skipping insertion in model container [2021-10-13 07:47:50,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:50,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:47:50,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:47:50,794 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_0748f210-f4e9-4d55-8776-c717054c5419/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] [2021-10-13 07:47:50,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:47:50,898 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:47:50,911 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_0748f210-f4e9-4d55-8776-c717054c5419/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] [2021-10-13 07:47:50,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:47:50,980 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:47:50,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50 WrapperNode [2021-10-13 07:47:50,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:47:50,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:47:50,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:47:50,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:47:50,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:47:51,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:47:51,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:47:51,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:47:51,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:47:51,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:47:51,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:47:51,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:47:51,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (1/1) ... [2021-10-13 07:47:51,213 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:47:51,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:47:51,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:47:51,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:47:51,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:47:51,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:47:51,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:47:51,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:47:53,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:47:53,597 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2021-10-13 07:47:53,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:47:53 BoogieIcfgContainer [2021-10-13 07:47:53,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:47:53,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:47:53,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:47:53,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:47:53,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:47:50" (1/3) ... [2021-10-13 07:47:53,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173f7f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:47:53, skipping insertion in model container [2021-10-13 07:47:53,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:50" (2/3) ... [2021-10-13 07:47:53,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173f7f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:47:53, skipping insertion in model container [2021-10-13 07:47:53,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:47:53" (3/3) ... [2021-10-13 07:47:53,614 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2021-10-13 07:47:53,622 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:47:53,622 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 07:47:53,684 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:47:53,691 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, mConcurrency=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-13 07:47:53,692 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-13 07:47:53,714 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-13 07:47:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:47:53,722 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:53,723 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-13 07:47:53,724 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1681053004, now seen corresponding path program 1 times [2021-10-13 07:47:53,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:53,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002979114] [2021-10-13 07:47:53,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:53,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:54,051 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-13 07:47:54,052 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:54,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002979114] [2021-10-13 07:47:54,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002979114] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:54,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:54,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:47:54,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247746994] [2021-10-13 07:47:54,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:47:54,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:54,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:47:54,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:54,096 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-13 07:47:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:54,274 INFO L93 Difference]: Finished difference Result 415 states and 637 transitions. [2021-10-13 07:47:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:47:54,277 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-13 07:47:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:54,308 INFO L225 Difference]: With dead ends: 415 [2021-10-13 07:47:54,309 INFO L226 Difference]: Without dead ends: 263 [2021-10-13 07:47:54,316 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-13 07:47:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2021-10-13 07:47:54,403 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-13 07:47:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 369 transitions. [2021-10-13 07:47:54,411 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 369 transitions. Word has length 22 [2021-10-13 07:47:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:54,413 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 369 transitions. [2021-10-13 07:47:54,413 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-13 07:47:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2021-10-13 07:47:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 07:47:54,424 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:54,425 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-13 07:47:54,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:47:54,426 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:54,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:54,430 INFO L82 PathProgramCache]: Analyzing trace with hash -15810102, now seen corresponding path program 1 times [2021-10-13 07:47:54,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:54,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533535305] [2021-10-13 07:47:54,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:54,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:54,581 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-13 07:47:54,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:54,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533535305] [2021-10-13 07:47:54,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533535305] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:54,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:54,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:47:54,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463237312] [2021-10-13 07:47:54,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:47:54,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:47:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:54,590 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-13 07:47:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:54,738 INFO L93 Difference]: Finished difference Result 789 states and 1161 transitions. [2021-10-13 07:47:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:47:54,739 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-13 07:47:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:54,744 INFO L225 Difference]: With dead ends: 789 [2021-10-13 07:47:54,744 INFO L226 Difference]: Without dead ends: 549 [2021-10-13 07:47:54,747 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:47:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-10-13 07:47:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 435. [2021-10-13 07:47:54,785 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-13 07:47:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 635 transitions. [2021-10-13 07:47:54,788 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 635 transitions. Word has length 43 [2021-10-13 07:47:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:54,789 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 635 transitions. [2021-10-13 07:47:54,789 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-13 07:47:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 635 transitions. [2021-10-13 07:47:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 07:47:54,792 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:54,792 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-13 07:47:54,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:47:54,793 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1780626711, now seen corresponding path program 1 times [2021-10-13 07:47:54,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:54,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159327169] [2021-10-13 07:47:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:54,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:54,913 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-13 07:47:54,914 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:54,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159327169] [2021-10-13 07:47:54,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159327169] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:54,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:54,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:47:54,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286258733] [2021-10-13 07:47:54,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:47:54,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:47:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:54,926 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-13 07:47:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:55,009 INFO L93 Difference]: Finished difference Result 1201 states and 1753 transitions. [2021-10-13 07:47:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:47:55,010 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-13 07:47:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:55,015 INFO L225 Difference]: With dead ends: 1201 [2021-10-13 07:47:55,016 INFO L226 Difference]: Without dead ends: 778 [2021-10-13 07:47:55,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-10-13 07:47:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 770. [2021-10-13 07:47:55,050 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-13 07:47:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1106 transitions. [2021-10-13 07:47:55,054 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1106 transitions. Word has length 43 [2021-10-13 07:47:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:55,055 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1106 transitions. [2021-10-13 07:47:55,055 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-13 07:47:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1106 transitions. [2021-10-13 07:47:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 07:47:55,058 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:55,058 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-13 07:47:55,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:47:55,059 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash -66578295, now seen corresponding path program 1 times [2021-10-13 07:47:55,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:55,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511473401] [2021-10-13 07:47:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:55,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:55,150 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-13 07:47:55,151 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:55,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511473401] [2021-10-13 07:47:55,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511473401] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:55,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:55,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:47:55,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472048683] [2021-10-13 07:47:55,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:47:55,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:55,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:47:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:55,159 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-13 07:47:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:55,357 INFO L93 Difference]: Finished difference Result 2528 states and 3592 transitions. [2021-10-13 07:47:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:47:55,358 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-13 07:47:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:55,370 INFO L225 Difference]: With dead ends: 2528 [2021-10-13 07:47:55,371 INFO L226 Difference]: Without dead ends: 1763 [2021-10-13 07:47:55,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:47:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2021-10-13 07:47:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1369. [2021-10-13 07:47:55,460 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-13 07:47:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1935 transitions. [2021-10-13 07:47:55,467 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1935 transitions. Word has length 43 [2021-10-13 07:47:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:55,468 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1935 transitions. [2021-10-13 07:47:55,468 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-13 07:47:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1935 transitions. [2021-10-13 07:47:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 07:47:55,473 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:55,473 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-13 07:47:55,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:47:55,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:55,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash 594755496, now seen corresponding path program 1 times [2021-10-13 07:47:55,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:55,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686460222] [2021-10-13 07:47:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:55,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:55,532 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-13 07:47:55,532 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:55,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686460222] [2021-10-13 07:47:55,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686460222] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:55,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:55,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:47:55,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813109608] [2021-10-13 07:47:55,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:47:55,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:47:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:55,535 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-13 07:47:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:55,640 INFO L93 Difference]: Finished difference Result 2373 states and 3433 transitions. [2021-10-13 07:47:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:47:55,641 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-13 07:47:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:55,651 INFO L225 Difference]: With dead ends: 2373 [2021-10-13 07:47:55,652 INFO L226 Difference]: Without dead ends: 1589 [2021-10-13 07:47:55,653 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-13 07:47:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-10-13 07:47:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1501. [2021-10-13 07:47:55,740 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-13 07:47:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2159 transitions. [2021-10-13 07:47:55,750 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2159 transitions. Word has length 43 [2021-10-13 07:47:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:55,753 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 2159 transitions. [2021-10-13 07:47:55,753 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-13 07:47:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2159 transitions. [2021-10-13 07:47:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 07:47:55,758 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:55,758 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-13 07:47:55,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:47:55,759 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1551422771, now seen corresponding path program 1 times [2021-10-13 07:47:55,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:55,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758687478] [2021-10-13 07:47:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:55,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:55,863 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-13 07:47:55,864 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:55,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758687478] [2021-10-13 07:47:55,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758687478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:55,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:55,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:47:55,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559832497] [2021-10-13 07:47:55,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:47:55,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:55,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:47:55,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:55,867 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-13 07:47:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:55,983 INFO L93 Difference]: Finished difference Result 2517 states and 3645 transitions. [2021-10-13 07:47:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:47:55,983 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-13 07:47:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:55,995 INFO L225 Difference]: With dead ends: 2517 [2021-10-13 07:47:55,995 INFO L226 Difference]: Without dead ends: 1601 [2021-10-13 07:47:55,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2021-10-13 07:47:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1501. [2021-10-13 07:47:56,079 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-13 07:47:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2107 transitions. [2021-10-13 07:47:56,086 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2107 transitions. Word has length 62 [2021-10-13 07:47:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:56,087 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 2107 transitions. [2021-10-13 07:47:56,088 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-13 07:47:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2107 transitions. [2021-10-13 07:47:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 07:47:56,092 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:56,093 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-13 07:47:56,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:47:56,093 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1153149548, now seen corresponding path program 1 times [2021-10-13 07:47:56,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:56,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421866548] [2021-10-13 07:47:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:56,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:56,231 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-13 07:47:56,231 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:56,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421866548] [2021-10-13 07:47:56,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421866548] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:56,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:56,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:47:56,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257535903] [2021-10-13 07:47:56,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:47:56,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:56,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:47:56,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:56,234 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-13 07:47:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:56,547 INFO L93 Difference]: Finished difference Result 5161 states and 7285 transitions. [2021-10-13 07:47:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:47:56,547 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-13 07:47:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:56,574 INFO L225 Difference]: With dead ends: 5161 [2021-10-13 07:47:56,574 INFO L226 Difference]: Without dead ends: 3673 [2021-10-13 07:47:56,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2021-10-13 07:47:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 2785. [2021-10-13 07:47:56,745 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-13 07:47:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3879 transitions. [2021-10-13 07:47:56,759 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3879 transitions. Word has length 62 [2021-10-13 07:47:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:56,760 INFO L470 AbstractCegarLoop]: Abstraction has 2785 states and 3879 transitions. [2021-10-13 07:47:56,760 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-13 07:47:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3879 transitions. [2021-10-13 07:47:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 07:47:56,767 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:56,767 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-13 07:47:56,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:47:56,768 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:56,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2017211270, now seen corresponding path program 1 times [2021-10-13 07:47:56,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:56,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671167265] [2021-10-13 07:47:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:56,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:56,857 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-13 07:47:56,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:56,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671167265] [2021-10-13 07:47:56,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671167265] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:56,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:56,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:47:56,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801188638] [2021-10-13 07:47:56,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:47:56,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:47:56,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:56,860 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-13 07:47:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:57,113 INFO L93 Difference]: Finished difference Result 6061 states and 8622 transitions. [2021-10-13 07:47:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:47:57,114 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-13 07:47:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:57,137 INFO L225 Difference]: With dead ends: 6061 [2021-10-13 07:47:57,137 INFO L226 Difference]: Without dead ends: 3289 [2021-10-13 07:47:57,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:47:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2021-10-13 07:47:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2258. [2021-10-13 07:47:57,319 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-13 07:47:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3200 transitions. [2021-10-13 07:47:57,329 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3200 transitions. Word has length 63 [2021-10-13 07:47:57,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:57,330 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 3200 transitions. [2021-10-13 07:47:57,330 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-13 07:47:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3200 transitions. [2021-10-13 07:47:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-13 07:47:57,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:57,336 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-13 07:47:57,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:47:57,336 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1454758849, now seen corresponding path program 1 times [2021-10-13 07:47:57,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:57,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231374129] [2021-10-13 07:47:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:57,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:57,394 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-13 07:47:57,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:57,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231374129] [2021-10-13 07:47:57,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231374129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:57,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:57,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:47:57,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477224411] [2021-10-13 07:47:57,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:47:57,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:57,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:47:57,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:57,397 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-13 07:47:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:57,544 INFO L93 Difference]: Finished difference Result 4502 states and 6386 transitions. [2021-10-13 07:47:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:47:57,545 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-13 07:47:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:57,559 INFO L225 Difference]: With dead ends: 4502 [2021-10-13 07:47:57,559 INFO L226 Difference]: Without dead ends: 2258 [2021-10-13 07:47:57,563 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2021-10-13 07:47:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2258. [2021-10-13 07:47:57,753 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-13 07:47:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3160 transitions. [2021-10-13 07:47:57,765 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3160 transitions. Word has length 65 [2021-10-13 07:47:57,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:57,765 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 3160 transitions. [2021-10-13 07:47:57,765 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-13 07:47:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3160 transitions. [2021-10-13 07:47:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-13 07:47:57,772 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:57,773 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-13 07:47:57,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:47:57,773 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 481269890, now seen corresponding path program 1 times [2021-10-13 07:47:57,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:57,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708409573] [2021-10-13 07:47:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:57,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:57,830 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-13 07:47:57,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:57,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708409573] [2021-10-13 07:47:57,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708409573] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:57,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:57,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:47:57,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881592733] [2021-10-13 07:47:57,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:47:57,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:57,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:47:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:57,833 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-13 07:47:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:57,969 INFO L93 Difference]: Finished difference Result 3860 states and 5419 transitions. [2021-10-13 07:47:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:47:57,969 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-13 07:47:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:57,981 INFO L225 Difference]: With dead ends: 3860 [2021-10-13 07:47:57,981 INFO L226 Difference]: Without dead ends: 1616 [2021-10-13 07:47:57,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2021-10-13 07:47:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1597. [2021-10-13 07:47:58,081 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-13 07:47:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2184 transitions. [2021-10-13 07:47:58,088 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2184 transitions. Word has length 65 [2021-10-13 07:47:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:58,089 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2184 transitions. [2021-10-13 07:47:58,089 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-13 07:47:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2184 transitions. [2021-10-13 07:47:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-13 07:47:58,093 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:58,094 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-13 07:47:58,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:47:58,094 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1578794294, now seen corresponding path program 1 times [2021-10-13 07:47:58,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:58,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034454728] [2021-10-13 07:47:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:58,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:58,198 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-13 07:47:58,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:58,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034454728] [2021-10-13 07:47:58,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034454728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:58,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:58,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:47:58,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884089348] [2021-10-13 07:47:58,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:47:58,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:58,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:47:58,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:58,201 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-13 07:47:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:58,322 INFO L93 Difference]: Finished difference Result 2657 states and 3657 transitions. [2021-10-13 07:47:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:47:58,323 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-13 07:47:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:58,334 INFO L225 Difference]: With dead ends: 2657 [2021-10-13 07:47:58,334 INFO L226 Difference]: Without dead ends: 1670 [2021-10-13 07:47:58,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2021-10-13 07:47:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1597. [2021-10-13 07:47:58,435 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-13 07:47:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2155 transitions. [2021-10-13 07:47:58,442 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2155 transitions. Word has length 66 [2021-10-13 07:47:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:58,443 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2155 transitions. [2021-10-13 07:47:58,443 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-13 07:47:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2155 transitions. [2021-10-13 07:47:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-13 07:47:58,453 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:58,453 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-13 07:47:58,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:47:58,454 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:58,454 INFO L82 PathProgramCache]: Analyzing trace with hash 617875508, now seen corresponding path program 1 times [2021-10-13 07:47:58,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:58,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36019067] [2021-10-13 07:47:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:58,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:58,553 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-13 07:47:58,554 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:58,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36019067] [2021-10-13 07:47:58,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36019067] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:58,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:58,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:47:58,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650989748] [2021-10-13 07:47:58,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:47:58,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:58,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:47:58,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:58,557 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-13 07:47:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:58,792 INFO L93 Difference]: Finished difference Result 2888 states and 3904 transitions. [2021-10-13 07:47:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:47:58,793 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-13 07:47:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:58,806 INFO L225 Difference]: With dead ends: 2888 [2021-10-13 07:47:58,806 INFO L226 Difference]: Without dead ends: 1901 [2021-10-13 07:47:58,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:47:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2021-10-13 07:47:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1722. [2021-10-13 07:47:58,918 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-13 07:47:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2265 transitions. [2021-10-13 07:47:58,928 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2265 transitions. Word has length 67 [2021-10-13 07:47:58,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:58,930 INFO L470 AbstractCegarLoop]: Abstraction has 1722 states and 2265 transitions. [2021-10-13 07:47:58,931 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-13 07:47:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2265 transitions. [2021-10-13 07:47:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-13 07:47:58,936 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:58,936 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-13 07:47:58,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:47:58,937 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1755670380, now seen corresponding path program 1 times [2021-10-13 07:47:58,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:58,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342383349] [2021-10-13 07:47:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:58,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:59,006 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-13 07:47:59,006 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:59,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342383349] [2021-10-13 07:47:59,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342383349] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:47:59,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538029747] [2021-10-13 07:47:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:59,008 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:47:59,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:47:59,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:47:59,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:47:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:59,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:47:59,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:47:59,449 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-13 07:47:59,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:47:59,670 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-13 07:47:59,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538029747] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:59,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:47:59,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-13 07:47:59,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044376611] [2021-10-13 07:47:59,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:47:59,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:59,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:47:59,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:47:59,674 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-13 07:47:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:59,887 INFO L93 Difference]: Finished difference Result 3545 states and 4707 transitions. [2021-10-13 07:47:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:47:59,888 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-13 07:47:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:59,903 INFO L225 Difference]: With dead ends: 3545 [2021-10-13 07:47:59,903 INFO L226 Difference]: Without dead ends: 2385 [2021-10-13 07:47:59,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:47:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2021-10-13 07:48:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1893. [2021-10-13 07:48:00,036 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-13 07:48:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2530 transitions. [2021-10-13 07:48:00,044 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2530 transitions. Word has length 70 [2021-10-13 07:48:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:00,044 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 2530 transitions. [2021-10-13 07:48:00,045 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-13 07:48:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2530 transitions. [2021-10-13 07:48:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-13 07:48:00,049 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:00,050 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-13 07:48:00,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:48:00,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-13 07:48:00,277 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:00,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:00,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1855930243, now seen corresponding path program 1 times [2021-10-13 07:48:00,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:00,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759617649] [2021-10-13 07:48:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:00,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:00,312 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-13 07:48:00,312 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:00,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759617649] [2021-10-13 07:48:00,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759617649] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:00,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:00,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:00,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714048207] [2021-10-13 07:48:00,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:48:00,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:00,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:48:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:00,315 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-13 07:48:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:00,572 INFO L93 Difference]: Finished difference Result 4413 states and 5975 transitions. [2021-10-13 07:48:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:48:00,573 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-13 07:48:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:00,601 INFO L225 Difference]: With dead ends: 4413 [2021-10-13 07:48:00,608 INFO L226 Difference]: Without dead ends: 2534 [2021-10-13 07:48:00,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2021-10-13 07:48:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2261. [2021-10-13 07:48:00,811 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-13 07:48:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3101 transitions. [2021-10-13 07:48:00,819 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3101 transitions. Word has length 70 [2021-10-13 07:48:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:00,820 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 3101 transitions. [2021-10-13 07:48:00,820 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-13 07:48:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3101 transitions. [2021-10-13 07:48:00,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-13 07:48:00,827 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:00,827 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-13 07:48:00,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:48:00,828 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash 229338890, now seen corresponding path program 1 times [2021-10-13 07:48:00,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:00,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788117876] [2021-10-13 07:48:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:00,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:00,900 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-13 07:48:00,901 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:00,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788117876] [2021-10-13 07:48:00,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788117876] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:00,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:00,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:00,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171366205] [2021-10-13 07:48:00,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:48:00,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:00,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:48:00,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:00,907 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-13 07:48:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:01,085 INFO L93 Difference]: Finished difference Result 3881 states and 5364 transitions. [2021-10-13 07:48:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:48:01,086 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-13 07:48:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:01,095 INFO L225 Difference]: With dead ends: 3881 [2021-10-13 07:48:01,095 INFO L226 Difference]: Without dead ends: 2268 [2021-10-13 07:48:01,099 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-13 07:48:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2021-10-13 07:48:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2236. [2021-10-13 07:48:01,290 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-13 07:48:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2973 transitions. [2021-10-13 07:48:01,297 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2973 transitions. Word has length 71 [2021-10-13 07:48:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:01,297 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2973 transitions. [2021-10-13 07:48:01,298 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-13 07:48:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2973 transitions. [2021-10-13 07:48:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-13 07:48:01,303 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:01,304 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-13 07:48:01,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:48:01,304 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:01,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1517533419, now seen corresponding path program 1 times [2021-10-13 07:48:01,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:01,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266642189] [2021-10-13 07:48:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:01,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:01,355 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-13 07:48:01,356 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:01,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266642189] [2021-10-13 07:48:01,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266642189] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:01,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:01,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:48:01,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446890547] [2021-10-13 07:48:01,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:48:01,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:01,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:48:01,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:01,359 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-13 07:48:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:01,560 INFO L93 Difference]: Finished difference Result 3819 states and 5096 transitions. [2021-10-13 07:48:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:48:01,560 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-13 07:48:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:01,568 INFO L225 Difference]: With dead ends: 3819 [2021-10-13 07:48:01,568 INFO L226 Difference]: Without dead ends: 2236 [2021-10-13 07:48:01,572 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2021-10-13 07:48:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2236. [2021-10-13 07:48:01,772 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-13 07:48:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2931 transitions. [2021-10-13 07:48:01,788 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2931 transitions. Word has length 71 [2021-10-13 07:48:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:01,789 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2931 transitions. [2021-10-13 07:48:01,790 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-13 07:48:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2931 transitions. [2021-10-13 07:48:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-13 07:48:01,796 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:01,796 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-13 07:48:01,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 07:48:01,797 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash 6215176, now seen corresponding path program 1 times [2021-10-13 07:48:01,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:01,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396816263] [2021-10-13 07:48:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:01,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:01,890 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-13 07:48:01,890 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:01,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396816263] [2021-10-13 07:48:01,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396816263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:01,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:01,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:48:01,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271848241] [2021-10-13 07:48:01,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:01,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:01,893 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-13 07:48:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:02,186 INFO L93 Difference]: Finished difference Result 5080 states and 6591 transitions. [2021-10-13 07:48:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:02,187 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-13 07:48:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:02,197 INFO L225 Difference]: With dead ends: 5080 [2021-10-13 07:48:02,198 INFO L226 Difference]: Without dead ends: 3497 [2021-10-13 07:48:02,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2021-10-13 07:48:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 2822. [2021-10-13 07:48:02,416 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-13 07:48:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3598 transitions. [2021-10-13 07:48:02,423 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3598 transitions. Word has length 73 [2021-10-13 07:48:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:02,424 INFO L470 AbstractCegarLoop]: Abstraction has 2822 states and 3598 transitions. [2021-10-13 07:48:02,424 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-13 07:48:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3598 transitions. [2021-10-13 07:48:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-13 07:48:02,431 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:02,431 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-13 07:48:02,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 07:48:02,432 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:02,432 INFO L82 PathProgramCache]: Analyzing trace with hash 543746611, now seen corresponding path program 1 times [2021-10-13 07:48:02,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:02,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217128277] [2021-10-13 07:48:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:02,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:02,487 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-13 07:48:02,487 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:02,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217128277] [2021-10-13 07:48:02,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217128277] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:48:02,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692002696] [2021-10-13 07:48:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:02,489 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:48:02,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:48:02,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:48:02,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 07:48:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:02,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:48:02,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:02,952 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-13 07:48:02,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:03,220 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-13 07:48:03,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692002696] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:03,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:48:03,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-13 07:48:03,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302693218] [2021-10-13 07:48:03,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:03,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:03,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:03,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:48:03,224 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-13 07:48:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:03,478 INFO L93 Difference]: Finished difference Result 6264 states and 7985 transitions. [2021-10-13 07:48:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:03,479 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-13 07:48:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:03,539 INFO L225 Difference]: With dead ends: 6264 [2021-10-13 07:48:03,539 INFO L226 Difference]: Without dead ends: 3498 [2021-10-13 07:48:03,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:48:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-10-13 07:48:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 2965. [2021-10-13 07:48:03,818 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-13 07:48:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3800 transitions. [2021-10-13 07:48:03,828 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3800 transitions. Word has length 91 [2021-10-13 07:48:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:03,829 INFO L470 AbstractCegarLoop]: Abstraction has 2965 states and 3800 transitions. [2021-10-13 07:48:03,829 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-13 07:48:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3800 transitions. [2021-10-13 07:48:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 07:48:03,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:03,838 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-13 07:48:03,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:48:04,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 07:48:04,061 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1830675513, now seen corresponding path program 1 times [2021-10-13 07:48:04,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:04,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764767942] [2021-10-13 07:48:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:04,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:04,145 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-13 07:48:04,145 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:04,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764767942] [2021-10-13 07:48:04,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764767942] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:48:04,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4063565] [2021-10-13 07:48:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:04,146 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:48:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:48:04,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:48:04,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 07:48:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:04,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 07:48:04,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:04,732 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-13 07:48:04,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:05,057 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-13 07:48:05,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4063565] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:05,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:48:05,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 5 [2021-10-13 07:48:05,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417492176] [2021-10-13 07:48:05,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:05,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:05,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:05,062 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-13 07:48:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:05,344 INFO L93 Difference]: Finished difference Result 5794 states and 7406 transitions. [2021-10-13 07:48:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:05,345 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-13 07:48:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:05,352 INFO L225 Difference]: With dead ends: 5794 [2021-10-13 07:48:05,353 INFO L226 Difference]: Without dead ends: 3003 [2021-10-13 07:48:05,357 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-13 07:48:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2021-10-13 07:48:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2965. [2021-10-13 07:48:05,581 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-13 07:48:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3747 transitions. [2021-10-13 07:48:05,589 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3747 transitions. Word has length 93 [2021-10-13 07:48:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:05,589 INFO L470 AbstractCegarLoop]: Abstraction has 2965 states and 3747 transitions. [2021-10-13 07:48:05,590 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-13 07:48:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3747 transitions. [2021-10-13 07:48:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-13 07:48:05,596 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:05,597 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-13 07:48:05,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:48:05,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:48:05,824 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:05,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:05,824 INFO L82 PathProgramCache]: Analyzing trace with hash -767543943, now seen corresponding path program 1 times [2021-10-13 07:48:05,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:05,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580240988] [2021-10-13 07:48:05,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:05,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:05,876 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-13 07:48:05,876 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:05,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580240988] [2021-10-13 07:48:05,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580240988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:05,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:05,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:05,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824726145] [2021-10-13 07:48:05,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:48:05,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:48:05,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:05,881 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-13 07:48:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:06,082 INFO L93 Difference]: Finished difference Result 5141 states and 6501 transitions. [2021-10-13 07:48:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:48:06,083 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-13 07:48:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:06,090 INFO L225 Difference]: With dead ends: 5141 [2021-10-13 07:48:06,090 INFO L226 Difference]: Without dead ends: 2358 [2021-10-13 07:48:06,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2021-10-13 07:48:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2326. [2021-10-13 07:48:06,257 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-13 07:48:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2840 transitions. [2021-10-13 07:48:06,263 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2840 transitions. Word has length 94 [2021-10-13 07:48:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:06,264 INFO L470 AbstractCegarLoop]: Abstraction has 2326 states and 2840 transitions. [2021-10-13 07:48:06,264 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-13 07:48:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2840 transitions. [2021-10-13 07:48:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-13 07:48:06,282 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:06,282 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-13 07:48:06,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 07:48:06,283 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:06,283 INFO L82 PathProgramCache]: Analyzing trace with hash 707507586, now seen corresponding path program 1 times [2021-10-13 07:48:06,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:06,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122476032] [2021-10-13 07:48:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:06,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:06,388 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-13 07:48:06,388 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:06,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122476032] [2021-10-13 07:48:06,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122476032] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:06,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:06,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:48:06,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677985437] [2021-10-13 07:48:06,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:06,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:06,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:06,391 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-13 07:48:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:06,674 INFO L93 Difference]: Finished difference Result 5014 states and 6029 transitions. [2021-10-13 07:48:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:06,674 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-13 07:48:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:06,683 INFO L225 Difference]: With dead ends: 5014 [2021-10-13 07:48:06,683 INFO L226 Difference]: Without dead ends: 3299 [2021-10-13 07:48:06,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2021-10-13 07:48:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 2750. [2021-10-13 07:48:06,878 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-13 07:48:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3246 transitions. [2021-10-13 07:48:06,887 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3246 transitions. Word has length 96 [2021-10-13 07:48:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:06,887 INFO L470 AbstractCegarLoop]: Abstraction has 2750 states and 3246 transitions. [2021-10-13 07:48:06,887 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-13 07:48:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3246 transitions. [2021-10-13 07:48:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-10-13 07:48:06,894 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:06,894 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-13 07:48:06,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 07:48:06,895 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:06,895 INFO L82 PathProgramCache]: Analyzing trace with hash -32283515, now seen corresponding path program 1 times [2021-10-13 07:48:06,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:06,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100413688] [2021-10-13 07:48:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:06,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:06,950 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-13 07:48:06,950 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:06,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100413688] [2021-10-13 07:48:06,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100413688] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:48:06,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886491231] [2021-10-13 07:48:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:06,951 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:48:06,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:48:06,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:48:06,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 07:48:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:07,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:48:07,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:07,587 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-13 07:48:07,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:08,002 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-13 07:48:08,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886491231] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:08,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:48:08,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-13 07:48:08,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581485025] [2021-10-13 07:48:08,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:08,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:48:08,006 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-13 07:48:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:08,295 INFO L93 Difference]: Finished difference Result 5976 states and 7105 transitions. [2021-10-13 07:48:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:08,296 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-13 07:48:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:08,322 INFO L225 Difference]: With dead ends: 5976 [2021-10-13 07:48:08,322 INFO L226 Difference]: Without dead ends: 3464 [2021-10-13 07:48:08,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:48:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2021-10-13 07:48:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3037. [2021-10-13 07:48:08,545 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-13 07:48:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 3680 transitions. [2021-10-13 07:48:08,553 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 3680 transitions. Word has length 115 [2021-10-13 07:48:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:08,553 INFO L470 AbstractCegarLoop]: Abstraction has 3037 states and 3680 transitions. [2021-10-13 07:48:08,553 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-13 07:48:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 3680 transitions. [2021-10-13 07:48:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-13 07:48:08,564 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:08,564 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-13 07:48:08,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-10-13 07:48:08,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:48:08,791 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:08,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:08,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1918626126, now seen corresponding path program 1 times [2021-10-13 07:48:08,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:08,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544907831] [2021-10-13 07:48:08,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:08,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:08,917 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-13 07:48:08,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:08,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544907831] [2021-10-13 07:48:08,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544907831] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:08,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:08,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:48:08,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687470488] [2021-10-13 07:48:08,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:48:08,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:08,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:48:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:48:08,920 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-13 07:48:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:09,894 INFO L93 Difference]: Finished difference Result 11425 states and 13837 transitions. [2021-10-13 07:48:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:48:09,895 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-13 07:48:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:09,922 INFO L225 Difference]: With dead ends: 11425 [2021-10-13 07:48:09,922 INFO L226 Difference]: Without dead ends: 10209 [2021-10-13 07:48:09,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.0ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:48:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10209 states. [2021-10-13 07:48:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10209 to 5303. [2021-10-13 07:48:10,468 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-13 07:48:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 6357 transitions. [2021-10-13 07:48:10,481 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 6357 transitions. Word has length 118 [2021-10-13 07:48:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:10,482 INFO L470 AbstractCegarLoop]: Abstraction has 5303 states and 6357 transitions. [2021-10-13 07:48:10,482 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-13 07:48:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 6357 transitions. [2021-10-13 07:48:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-13 07:48:10,490 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:10,490 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-13 07:48:10,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 07:48:10,491 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash 638708002, now seen corresponding path program 1 times [2021-10-13 07:48:10,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:10,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490822085] [2021-10-13 07:48:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:10,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:48:10,536 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:48:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:48:10,683 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 07:48:10,683 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:48:10,684 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:48:10,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:48:10,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 07:48:10,694 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:48:10,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:48:10 BoogieIcfgContainer [2021-10-13 07:48:10,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:48:10,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:48:10,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:48:10,980 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:48:10,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:47:53" (3/4) ... [2021-10-13 07:48:10,983 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:48:11,194 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:48:11,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:48:11,196 INFO L168 Benchmark]: Toolchain (without parser) took 20678.68 ms. Allocated memory was 100.7 MB in the beginning and 614.5 MB in the end (delta: 513.8 MB). Free memory was 60.9 MB in the beginning and 319.1 MB in the end (delta: -258.1 MB). Peak memory consumption was 256.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:11,197 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 100.7 MB. Free memory is still 77.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:48:11,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.66 ms. Allocated memory is still 100.7 MB. Free memory was 60.7 MB in the beginning and 73.8 MB in the end (delta: -13.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:11,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.00 ms. Allocated memory is still 100.7 MB. Free memory was 73.8 MB in the beginning and 69.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:11,199 INFO L168 Benchmark]: Boogie Preprocessor took 86.25 ms. Allocated memory is still 100.7 MB. Free memory was 69.8 MB in the beginning and 66.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:11,200 INFO L168 Benchmark]: RCFGBuilder took 2409.91 ms. Allocated memory was 100.7 MB in the beginning and 130.0 MB in the end (delta: 29.4 MB). Free memory was 66.6 MB in the beginning and 98.3 MB in the end (delta: -31.7 MB). Peak memory consumption was 46.0 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:11,200 INFO L168 Benchmark]: TraceAbstraction took 17374.80 ms. Allocated memory was 130.0 MB in the beginning and 614.5 MB in the end (delta: 484.4 MB). Free memory was 98.3 MB in the beginning and 344.3 MB in the end (delta: -246.0 MB). Peak memory consumption was 239.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:11,201 INFO L168 Benchmark]: Witness Printer took 214.59 ms. Allocated memory is still 614.5 MB. Free memory was 344.3 MB in the beginning and 319.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:11,203 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.31 ms. Allocated memory is still 100.7 MB. Free memory is still 77.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 448.66 ms. Allocated memory is still 100.7 MB. Free memory was 60.7 MB in the beginning and 73.8 MB in the end (delta: -13.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 121.00 ms. Allocated memory is still 100.7 MB. Free memory was 73.8 MB in the beginning and 69.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 86.25 ms. Allocated memory is still 100.7 MB. Free memory was 69.8 MB in the beginning and 66.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2409.91 ms. Allocated memory was 100.7 MB in the beginning and 130.0 MB in the end (delta: 29.4 MB). Free memory was 66.6 MB in the beginning and 98.3 MB in the end (delta: -31.7 MB). Peak memory consumption was 46.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17374.80 ms. Allocated memory was 130.0 MB in the beginning and 614.5 MB in the end (delta: 484.4 MB). Free memory was 98.3 MB in the beginning and 344.3 MB in the end (delta: -246.0 MB). Peak memory consumption was 239.3 MB. Max. memory is 16.1 GB. * Witness Printer took 214.59 ms. Allocated memory is still 614.5 MB. Free memory was 344.3 MB in the beginning and 319.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 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: 17009.8ms, OverallIterations: 24, TraceHistogramMax: 3, EmptinessCheckTime: 161.6ms, AutomataDifference: 6019.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6172 SDtfs, 4837 SDslu, 6567 SDs, 0 SdLazy, 780 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 952.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 823 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 187.9ms 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: 3966.2ms AutomataMinimizationTime, 23 MinimizatonAttempts, 10865 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 253.0ms SsaConstructionTime, 908.2ms SatisfiabilityAnalysisTime, 3583.8ms 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-13 07:48:11,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0748f210-f4e9-4d55-8776-c717054c5419/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...