./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b2a4b481f8bcc3bb9772c184de225f6906f9f66 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 12:06:54,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 12:06:54,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 12:06:54,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 12:06:54,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 12:06:54,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 12:06:54,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 12:06:54,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 12:06:54,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 12:06:54,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 12:06:54,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 12:06:54,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 12:06:54,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 12:06:54,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 12:06:54,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 12:06:54,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 12:06:54,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 12:06:54,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 12:06:54,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 12:06:54,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 12:06:54,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 12:06:54,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 12:06:54,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 12:06:54,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 12:06:54,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 12:06:54,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 12:06:54,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 12:06:54,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 12:06:54,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 12:06:54,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 12:06:54,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 12:06:54,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 12:06:54,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 12:06:54,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 12:06:54,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 12:06:54,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 12:06:54,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 12:06:54,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 12:06:54,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 12:06:54,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 12:06:54,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 12:06:54,910 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 12:06:54,927 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 12:06:54,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 12:06:54,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 12:06:54,933 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 12:06:54,933 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 12:06:54,933 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 12:06:54,933 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 12:06:54,933 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 12:06:54,934 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 12:06:54,934 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 12:06:54,934 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 12:06:54,934 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 12:06:54,934 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 12:06:54,934 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 12:06:54,934 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 12:06:54,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 12:06:54,935 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 12:06:54,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 12:06:54,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 12:06:54,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 12:06:54,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 12:06:54,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 12:06:54,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 12:06:54,936 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 12:06:54,936 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 12:06:54,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 12:06:54,936 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 12:06:54,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 12:06:54,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 12:06:54,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 12:06:54,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:06:54,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 12:06:54,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 12:06:54,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 12:06:54,937 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 12:06:54,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 12:06:54,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 12:06:54,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 12:06:54,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 12:06:54,937 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b2a4b481f8bcc3bb9772c184de225f6906f9f66 [2020-12-09 12:06:55,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 12:06:55,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 12:06:55,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 12:06:55,123 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 12:06:55,123 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 12:06:55,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe011_pso.oepc.i [2020-12-09 12:06:55,174 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/data/07a1117a0/5d5069e8e02e4ccb859c44a61b354e5e/FLAGef58b5d15 [2020-12-09 12:06:55,608 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 12:06:55,609 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/sv-benchmarks/c/pthread-wmm/safe011_pso.oepc.i [2020-12-09 12:06:55,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/data/07a1117a0/5d5069e8e02e4ccb859c44a61b354e5e/FLAGef58b5d15 [2020-12-09 12:06:55,629 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/data/07a1117a0/5d5069e8e02e4ccb859c44a61b354e5e [2020-12-09 12:06:55,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 12:06:55,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 12:06:55,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 12:06:55,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 12:06:55,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 12:06:55,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:06:55" (1/1) ... [2020-12-09 12:06:55,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e863f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:55, skipping insertion in model container [2020-12-09 12:06:55,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:06:55" (1/1) ... [2020-12-09 12:06:55,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 12:06:55,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 12:06:55,794 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/sv-benchmarks/c/pthread-wmm/safe011_pso.oepc.i[950,963] [2020-12-09 12:06:55,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:06:55,933 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 12:06:55,941 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/sv-benchmarks/c/pthread-wmm/safe011_pso.oepc.i[950,963] [2020-12-09 12:06:55,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:06:56,050 INFO L208 MainTranslator]: Completed translation [2020-12-09 12:06:56,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56 WrapperNode [2020-12-09 12:06:56,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 12:06:56,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 12:06:56,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 12:06:56,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 12:06:56,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 12:06:56,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 12:06:56,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 12:06:56,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 12:06:56,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... [2020-12-09 12:06:56,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 12:06:56,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 12:06:56,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 12:06:56,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 12:06:56,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:06:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 12:06:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 12:06:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 12:06:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 12:06:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 12:06:56,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 12:06:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 12:06:56,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 12:06:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 12:06:56,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 12:06:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 12:06:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 12:06:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 12:06:56,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 12:06:56,206 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 12:06:57,610 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 12:06:57,610 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 12:06:57,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:06:57 BoogieIcfgContainer [2020-12-09 12:06:57,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 12:06:57,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 12:06:57,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 12:06:57,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 12:06:57,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:06:55" (1/3) ... [2020-12-09 12:06:57,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277096b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:06:57, skipping insertion in model container [2020-12-09 12:06:57,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:06:56" (2/3) ... [2020-12-09 12:06:57,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277096b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:06:57, skipping insertion in model container [2020-12-09 12:06:57,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:06:57" (3/3) ... [2020-12-09 12:06:57,630 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2020-12-09 12:06:57,640 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 12:06:57,640 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 12:06:57,643 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 12:06:57,643 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 12:06:57,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,670 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,670 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,670 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,680 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,680 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,686 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 12:06:57,687 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 12:06:57,694 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 12:06:57,707 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 12:06:57,708 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 12:06:57,708 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 12:06:57,708 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 12:06:57,708 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 12:06:57,708 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 12:06:57,708 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 12:06:57,708 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 12:06:57,716 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 12:06:57,717 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2020-12-09 12:06:57,719 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2020-12-09 12:06:57,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-12-09 12:06:57,751 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-12-09 12:06:57,751 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 12:06:57,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-12-09 12:06:57,757 INFO L116 LiptonReduction]: Number of co-enabled transitions 1694 [2020-12-09 12:06:58,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:58,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:58,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:58,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:58,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:58,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:58,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:58,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:58,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:58,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:58,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:58,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:58,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:58,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:58,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:58,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:58,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 12:06:58,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:58,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 12:06:58,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:58,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 12:06:58,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:58,453 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 12:06:58,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:58,668 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 12:06:59,057 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-12-09 12:06:59,175 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 12:06:59,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,244 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,246 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,314 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:06:59,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:06:59,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:06:59,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 12:06:59,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:59,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 12:06:59,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:59,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 12:06:59,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:59,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 12:06:59,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:59,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 12:06:59,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:59,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 12:06:59,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:06:59,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 12:06:59,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:00,231 WARN L197 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-12-09 12:07:00,880 WARN L197 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2020-12-09 12:07:02,321 WARN L197 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-12-09 12:07:02,993 WARN L197 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2020-12-09 12:07:03,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,600 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-09 12:07:03,735 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-09 12:07:03,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,762 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 12:07:03,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 12:07:03,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 12:07:03,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:03,916 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 12:07:03,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:03,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,952 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:03,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:03,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:03,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 12:07:04,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 12:07:04,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 12:07:04,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,171 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 12:07:04,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 12:07:04,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,566 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 12:07:04,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 12:07:04,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 12:07:04,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 12:07:04,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 12:07:04,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,684 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 12:07:04,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:04,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 12:07:04,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 12:07:05,460 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-09 12:07:05,661 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-09 12:07:05,778 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-09 12:07:06,115 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2020-12-09 12:07:06,259 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 12:07:06,571 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2020-12-09 12:07:06,716 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 12:07:06,720 INFO L131 LiptonReduction]: Checked pairs total: 4814 [2020-12-09 12:07:06,720 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-09 12:07:06,724 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-12-09 12:07:06,759 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-12-09 12:07:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-12-09 12:07:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 12:07:06,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:06,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 12:07:06,764 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:06,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1057934, now seen corresponding path program 1 times [2020-12-09 12:07:06,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:06,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940307402] [2020-12-09 12:07:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:06,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940307402] [2020-12-09 12:07:06,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:06,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 12:07:06,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608628379] [2020-12-09 12:07:06,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:07:06,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:06,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:07:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:07:06,930 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-12-09 12:07:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:07,010 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-12-09 12:07:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:07:07,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 12:07:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:07,027 INFO L225 Difference]: With dead ends: 812 [2020-12-09 12:07:07,027 INFO L226 Difference]: Without dead ends: 687 [2020-12-09 12:07:07,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:07:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-12-09 12:07:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-12-09 12:07:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-12-09 12:07:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-12-09 12:07:07,093 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-12-09 12:07:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:07,094 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-12-09 12:07:07,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:07:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-12-09 12:07:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 12:07:07,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:07,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:07,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 12:07:07,095 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash -332907457, now seen corresponding path program 1 times [2020-12-09 12:07:07,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:07,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561345463] [2020-12-09 12:07:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:07,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561345463] [2020-12-09 12:07:07,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:07,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:07:07,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797742618] [2020-12-09 12:07:07,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:07:07,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:07:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:07:07,192 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-12-09 12:07:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:07,219 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2020-12-09 12:07:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:07:07,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 12:07:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:07,224 INFO L225 Difference]: With dead ends: 792 [2020-12-09 12:07:07,224 INFO L226 Difference]: Without dead ends: 667 [2020-12-09 12:07:07,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:07:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-12-09 12:07:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-12-09 12:07:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-12-09 12:07:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-12-09 12:07:07,245 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2020-12-09 12:07:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:07,246 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-12-09 12:07:07,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:07:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-12-09 12:07:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 12:07:07,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:07,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:07,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 12:07:07,248 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:07,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1082766274, now seen corresponding path program 1 times [2020-12-09 12:07:07,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:07,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671697936] [2020-12-09 12:07:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:07,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671697936] [2020-12-09 12:07:07,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:07,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:07:07,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429773550] [2020-12-09 12:07:07,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:07:07,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:07,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:07:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:07:07,311 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2020-12-09 12:07:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:07,333 INFO L93 Difference]: Finished difference Result 736 states and 2205 transitions. [2020-12-09 12:07:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:07:07,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 12:07:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:07,338 INFO L225 Difference]: With dead ends: 736 [2020-12-09 12:07:07,338 INFO L226 Difference]: Without dead ends: 621 [2020-12-09 12:07:07,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:07:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-12-09 12:07:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2020-12-09 12:07:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2020-12-09 12:07:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1910 transitions. [2020-12-09 12:07:07,354 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1910 transitions. Word has length 11 [2020-12-09 12:07:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:07,354 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 1910 transitions. [2020-12-09 12:07:07,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:07:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1910 transitions. [2020-12-09 12:07:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 12:07:07,356 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:07,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:07,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 12:07:07,356 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -794597533, now seen corresponding path program 1 times [2020-12-09 12:07:07,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:07,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193416928] [2020-12-09 12:07:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:07,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193416928] [2020-12-09 12:07:07,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:07,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:07:07,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675905765] [2020-12-09 12:07:07,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:07:07,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:07,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:07:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:07:07,440 INFO L87 Difference]: Start difference. First operand 621 states and 1910 transitions. Second operand 5 states. [2020-12-09 12:07:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:07,493 INFO L93 Difference]: Finished difference Result 829 states and 2510 transitions. [2020-12-09 12:07:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:07:07,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-09 12:07:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:07,498 INFO L225 Difference]: With dead ends: 829 [2020-12-09 12:07:07,498 INFO L226 Difference]: Without dead ends: 437 [2020-12-09 12:07:07,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:07:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-12-09 12:07:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-12-09 12:07:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-12-09 12:07:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions. [2020-12-09 12:07:07,512 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 12 [2020-12-09 12:07:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:07,513 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions. [2020-12-09 12:07:07,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:07:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions. [2020-12-09 12:07:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 12:07:07,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:07,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:07,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 12:07:07,514 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1154818923, now seen corresponding path program 1 times [2020-12-09 12:07:07,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:07,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732893594] [2020-12-09 12:07:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:07,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732893594] [2020-12-09 12:07:07,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:07,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:07:07,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541539937] [2020-12-09 12:07:07,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:07:07,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:07,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:07:07,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:07:07,608 INFO L87 Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 5 states. [2020-12-09 12:07:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:07,731 INFO L93 Difference]: Finished difference Result 501 states and 1419 transitions. [2020-12-09 12:07:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:07:07,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 12:07:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:07,734 INFO L225 Difference]: With dead ends: 501 [2020-12-09 12:07:07,734 INFO L226 Difference]: Without dead ends: 437 [2020-12-09 12:07:07,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:07:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-12-09 12:07:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-12-09 12:07:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-12-09 12:07:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1265 transitions. [2020-12-09 12:07:07,745 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1265 transitions. Word has length 13 [2020-12-09 12:07:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:07,746 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1265 transitions. [2020-12-09 12:07:07,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:07:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1265 transitions. [2020-12-09 12:07:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 12:07:07,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:07,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:07,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 12:07:07,747 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:07,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1678114700, now seen corresponding path program 1 times [2020-12-09 12:07:07,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:07,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131587753] [2020-12-09 12:07:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:07,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131587753] [2020-12-09 12:07:07,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:07,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:07:07,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373394284] [2020-12-09 12:07:07,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:07:07,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:07,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:07:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:07:07,880 INFO L87 Difference]: Start difference. First operand 437 states and 1265 transitions. Second operand 6 states. [2020-12-09 12:07:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:08,056 INFO L93 Difference]: Finished difference Result 551 states and 1563 transitions. [2020-12-09 12:07:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 12:07:08,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 12:07:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:08,060 INFO L225 Difference]: With dead ends: 551 [2020-12-09 12:07:08,060 INFO L226 Difference]: Without dead ends: 489 [2020-12-09 12:07:08,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:07:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-12-09 12:07:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 483. [2020-12-09 12:07:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2020-12-09 12:07:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1385 transitions. [2020-12-09 12:07:08,071 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1385 transitions. Word has length 15 [2020-12-09 12:07:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:08,072 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 1385 transitions. [2020-12-09 12:07:08,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:07:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1385 transitions. [2020-12-09 12:07:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 12:07:08,072 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:08,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:08,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 12:07:08,073 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1678107973, now seen corresponding path program 1 times [2020-12-09 12:07:08,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:08,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890873113] [2020-12-09 12:07:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:08,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890873113] [2020-12-09 12:07:08,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:08,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:07:08,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453400565] [2020-12-09 12:07:08,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:07:08,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:07:08,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:07:08,162 INFO L87 Difference]: Start difference. First operand 483 states and 1385 transitions. Second operand 6 states. [2020-12-09 12:07:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:08,289 INFO L93 Difference]: Finished difference Result 585 states and 1660 transitions. [2020-12-09 12:07:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 12:07:08,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 12:07:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:08,294 INFO L225 Difference]: With dead ends: 585 [2020-12-09 12:07:08,294 INFO L226 Difference]: Without dead ends: 539 [2020-12-09 12:07:08,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:07:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-12-09 12:07:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 485. [2020-12-09 12:07:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-12-09 12:07:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1392 transitions. [2020-12-09 12:07:08,310 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1392 transitions. Word has length 15 [2020-12-09 12:07:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:08,310 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 1392 transitions. [2020-12-09 12:07:08,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:07:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1392 transitions. [2020-12-09 12:07:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 12:07:08,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:08,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:08,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 12:07:08,312 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1678465465, now seen corresponding path program 1 times [2020-12-09 12:07:08,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:08,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497490924] [2020-12-09 12:07:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:08,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497490924] [2020-12-09 12:07:08,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:08,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:07:08,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382629899] [2020-12-09 12:07:08,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:07:08,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:07:08,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:07:08,499 INFO L87 Difference]: Start difference. First operand 485 states and 1392 transitions. Second operand 7 states. [2020-12-09 12:07:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:08,595 INFO L93 Difference]: Finished difference Result 533 states and 1500 transitions. [2020-12-09 12:07:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:07:08,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-09 12:07:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:08,598 INFO L225 Difference]: With dead ends: 533 [2020-12-09 12:07:08,598 INFO L226 Difference]: Without dead ends: 501 [2020-12-09 12:07:08,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:07:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-12-09 12:07:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2020-12-09 12:07:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2020-12-09 12:07:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1432 transitions. [2020-12-09 12:07:08,608 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1432 transitions. Word has length 15 [2020-12-09 12:07:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:08,608 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 1432 transitions. [2020-12-09 12:07:08,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:07:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1432 transitions. [2020-12-09 12:07:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 12:07:08,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:08,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:08,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 12:07:08,610 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash -652396463, now seen corresponding path program 2 times [2020-12-09 12:07:08,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:08,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803913994] [2020-12-09 12:07:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:08,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803913994] [2020-12-09 12:07:08,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:08,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:07:08,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753117267] [2020-12-09 12:07:08,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:07:08,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:08,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:07:08,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:07:08,740 INFO L87 Difference]: Start difference. First operand 501 states and 1432 transitions. Second operand 6 states. [2020-12-09 12:07:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:08,838 INFO L93 Difference]: Finished difference Result 525 states and 1472 transitions. [2020-12-09 12:07:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:07:08,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 12:07:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:08,841 INFO L225 Difference]: With dead ends: 525 [2020-12-09 12:07:08,841 INFO L226 Difference]: Without dead ends: 493 [2020-12-09 12:07:08,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:07:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-12-09 12:07:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 477. [2020-12-09 12:07:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-12-09 12:07:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1364 transitions. [2020-12-09 12:07:08,852 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1364 transitions. Word has length 15 [2020-12-09 12:07:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:08,852 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 1364 transitions. [2020-12-09 12:07:08,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:07:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1364 transitions. [2020-12-09 12:07:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 12:07:08,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:08,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:08,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 12:07:08,853 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:08,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash 482235907, now seen corresponding path program 1 times [2020-12-09 12:07:08,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:08,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363692122] [2020-12-09 12:07:08,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:09,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363692122] [2020-12-09 12:07:09,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:09,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:07:09,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644602626] [2020-12-09 12:07:09,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:07:09,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:07:09,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:07:09,010 INFO L87 Difference]: Start difference. First operand 477 states and 1364 transitions. Second operand 7 states. [2020-12-09 12:07:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:09,172 INFO L93 Difference]: Finished difference Result 569 states and 1619 transitions. [2020-12-09 12:07:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:07:09,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 12:07:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:09,177 INFO L225 Difference]: With dead ends: 569 [2020-12-09 12:07:09,177 INFO L226 Difference]: Without dead ends: 537 [2020-12-09 12:07:09,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 12:07:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-12-09 12:07:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 501. [2020-12-09 12:07:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2020-12-09 12:07:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1443 transitions. [2020-12-09 12:07:09,187 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1443 transitions. Word has length 16 [2020-12-09 12:07:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:09,187 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 1443 transitions. [2020-12-09 12:07:09,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:07:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1443 transitions. [2020-12-09 12:07:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 12:07:09,188 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:09,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:09,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 12:07:09,189 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 482229180, now seen corresponding path program 1 times [2020-12-09 12:07:09,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:09,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572213602] [2020-12-09 12:07:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:09,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572213602] [2020-12-09 12:07:09,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:09,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:07:09,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131816865] [2020-12-09 12:07:09,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:07:09,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:09,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:07:09,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:07:09,323 INFO L87 Difference]: Start difference. First operand 501 states and 1443 transitions. Second operand 7 states. [2020-12-09 12:07:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:09,497 INFO L93 Difference]: Finished difference Result 537 states and 1531 transitions. [2020-12-09 12:07:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:07:09,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 12:07:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:09,501 INFO L225 Difference]: With dead ends: 537 [2020-12-09 12:07:09,501 INFO L226 Difference]: Without dead ends: 513 [2020-12-09 12:07:09,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-09 12:07:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-12-09 12:07:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2020-12-09 12:07:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2020-12-09 12:07:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1443 transitions. [2020-12-09 12:07:09,514 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1443 transitions. Word has length 16 [2020-12-09 12:07:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:09,514 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 1443 transitions. [2020-12-09 12:07:09,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:07:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1443 transitions. [2020-12-09 12:07:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 12:07:09,516 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:09,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:09,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 12:07:09,516 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash 492960667, now seen corresponding path program 2 times [2020-12-09 12:07:09,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:09,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372654652] [2020-12-09 12:07:09,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:09,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372654652] [2020-12-09 12:07:09,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:09,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:07:09,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506887099] [2020-12-09 12:07:09,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:07:09,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:07:09,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:07:09,662 INFO L87 Difference]: Start difference. First operand 501 states and 1443 transitions. Second operand 7 states. [2020-12-09 12:07:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:09,856 INFO L93 Difference]: Finished difference Result 764 states and 2134 transitions. [2020-12-09 12:07:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:07:09,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 12:07:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:09,860 INFO L225 Difference]: With dead ends: 764 [2020-12-09 12:07:09,860 INFO L226 Difference]: Without dead ends: 666 [2020-12-09 12:07:09,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:07:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2020-12-09 12:07:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 467. [2020-12-09 12:07:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2020-12-09 12:07:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1320 transitions. [2020-12-09 12:07:09,871 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1320 transitions. Word has length 16 [2020-12-09 12:07:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:09,871 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 1320 transitions. [2020-12-09 12:07:09,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:07:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1320 transitions. [2020-12-09 12:07:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 12:07:09,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:09,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:09,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 12:07:09,872 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 492953940, now seen corresponding path program 2 times [2020-12-09 12:07:09,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:09,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699148820] [2020-12-09 12:07:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:10,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699148820] [2020-12-09 12:07:10,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:10,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:07:10,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544963358] [2020-12-09 12:07:10,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:07:10,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:07:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:07:10,029 INFO L87 Difference]: Start difference. First operand 467 states and 1320 transitions. Second operand 7 states. [2020-12-09 12:07:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:10,208 INFO L93 Difference]: Finished difference Result 537 states and 1491 transitions. [2020-12-09 12:07:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:07:10,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 12:07:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:10,211 INFO L225 Difference]: With dead ends: 537 [2020-12-09 12:07:10,211 INFO L226 Difference]: Without dead ends: 509 [2020-12-09 12:07:10,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:07:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-12-09 12:07:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 453. [2020-12-09 12:07:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-12-09 12:07:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1264 transitions. [2020-12-09 12:07:10,220 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1264 transitions. Word has length 16 [2020-12-09 12:07:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:10,220 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 1264 transitions. [2020-12-09 12:07:10,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:07:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1264 transitions. [2020-12-09 12:07:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 12:07:10,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:10,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:10,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 12:07:10,221 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash 492530139, now seen corresponding path program 1 times [2020-12-09 12:07:10,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:10,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713349587] [2020-12-09 12:07:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:10,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713349587] [2020-12-09 12:07:10,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:10,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:07:10,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702946881] [2020-12-09 12:07:10,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:07:10,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:07:10,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:07:10,253 INFO L87 Difference]: Start difference. First operand 453 states and 1264 transitions. Second operand 4 states. [2020-12-09 12:07:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:10,276 INFO L93 Difference]: Finished difference Result 721 states and 1977 transitions. [2020-12-09 12:07:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:07:10,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 12:07:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:10,278 INFO L225 Difference]: With dead ends: 721 [2020-12-09 12:07:10,278 INFO L226 Difference]: Without dead ends: 425 [2020-12-09 12:07:10,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:07:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2020-12-09 12:07:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 401. [2020-12-09 12:07:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-12-09 12:07:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1032 transitions. [2020-12-09 12:07:10,286 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1032 transitions. Word has length 16 [2020-12-09 12:07:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:10,286 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 1032 transitions. [2020-12-09 12:07:10,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:07:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1032 transitions. [2020-12-09 12:07:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 12:07:10,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:10,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:10,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 12:07:10,287 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1222661999, now seen corresponding path program 2 times [2020-12-09 12:07:10,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:10,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091129392] [2020-12-09 12:07:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:10,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091129392] [2020-12-09 12:07:10,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:10,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:07:10,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782155806] [2020-12-09 12:07:10,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:07:10,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:10,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:07:10,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:07:10,322 INFO L87 Difference]: Start difference. First operand 401 states and 1032 transitions. Second operand 4 states. [2020-12-09 12:07:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:10,345 INFO L93 Difference]: Finished difference Result 397 states and 903 transitions. [2020-12-09 12:07:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:07:10,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 12:07:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:10,351 INFO L225 Difference]: With dead ends: 397 [2020-12-09 12:07:10,351 INFO L226 Difference]: Without dead ends: 302 [2020-12-09 12:07:10,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:07:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-12-09 12:07:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2020-12-09 12:07:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-12-09 12:07:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 681 transitions. [2020-12-09 12:07:10,357 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 681 transitions. Word has length 16 [2020-12-09 12:07:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:10,358 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 681 transitions. [2020-12-09 12:07:10,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:07:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 681 transitions. [2020-12-09 12:07:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 12:07:10,358 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:10,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:10,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 12:07:10,359 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1411500507, now seen corresponding path program 1 times [2020-12-09 12:07:10,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:10,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857602525] [2020-12-09 12:07:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:10,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857602525] [2020-12-09 12:07:10,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:10,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:07:10,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237429758] [2020-12-09 12:07:10,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:07:10,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:07:10,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:07:10,411 INFO L87 Difference]: Start difference. First operand 302 states and 681 transitions. Second operand 5 states. [2020-12-09 12:07:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:10,448 INFO L93 Difference]: Finished difference Result 249 states and 502 transitions. [2020-12-09 12:07:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:07:10,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-09 12:07:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:10,450 INFO L225 Difference]: With dead ends: 249 [2020-12-09 12:07:10,450 INFO L226 Difference]: Without dead ends: 187 [2020-12-09 12:07:10,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:07:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-12-09 12:07:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-12-09 12:07:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-09 12:07:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 372 transitions. [2020-12-09 12:07:10,455 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 372 transitions. Word has length 17 [2020-12-09 12:07:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:10,455 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 372 transitions. [2020-12-09 12:07:10,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:07:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 372 transitions. [2020-12-09 12:07:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 12:07:10,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:10,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:10,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 12:07:10,457 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:10,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1049838257, now seen corresponding path program 1 times [2020-12-09 12:07:10,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:10,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419596604] [2020-12-09 12:07:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:10,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419596604] [2020-12-09 12:07:10,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:10,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 12:07:10,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135734422] [2020-12-09 12:07:10,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:07:10,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:10,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:07:10,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:07:10,706 INFO L87 Difference]: Start difference. First operand 187 states and 372 transitions. Second operand 9 states. [2020-12-09 12:07:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:10,841 INFO L93 Difference]: Finished difference Result 202 states and 390 transitions. [2020-12-09 12:07:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 12:07:10,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-09 12:07:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:10,843 INFO L225 Difference]: With dead ends: 202 [2020-12-09 12:07:10,843 INFO L226 Difference]: Without dead ends: 188 [2020-12-09 12:07:10,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:07:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-09 12:07:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2020-12-09 12:07:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-12-09 12:07:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 368 transitions. [2020-12-09 12:07:10,847 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 368 transitions. Word has length 19 [2020-12-09 12:07:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:10,847 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 368 transitions. [2020-12-09 12:07:10,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:07:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 368 transitions. [2020-12-09 12:07:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 12:07:10,847 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:10,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:10,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 12:07:10,848 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:10,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1534850081, now seen corresponding path program 2 times [2020-12-09 12:07:10,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:10,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781497377] [2020-12-09 12:07:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:11,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781497377] [2020-12-09 12:07:11,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:11,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 12:07:11,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581464667] [2020-12-09 12:07:11,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:07:11,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:11,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:07:11,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:07:11,091 INFO L87 Difference]: Start difference. First operand 185 states and 368 transitions. Second operand 9 states. [2020-12-09 12:07:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:11,241 INFO L93 Difference]: Finished difference Result 197 states and 381 transitions. [2020-12-09 12:07:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:07:11,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-09 12:07:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:11,243 INFO L225 Difference]: With dead ends: 197 [2020-12-09 12:07:11,243 INFO L226 Difference]: Without dead ends: 183 [2020-12-09 12:07:11,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:07:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-09 12:07:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-12-09 12:07:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-12-09 12:07:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 364 transitions. [2020-12-09 12:07:11,246 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 364 transitions. Word has length 19 [2020-12-09 12:07:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:11,246 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 364 transitions. [2020-12-09 12:07:11,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:07:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 364 transitions. [2020-12-09 12:07:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 12:07:11,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:11,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:11,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 12:07:11,247 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash -445266509, now seen corresponding path program 3 times [2020-12-09 12:07:11,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:11,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619879538] [2020-12-09 12:07:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:11,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619879538] [2020-12-09 12:07:11,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:11,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 12:07:11,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679000894] [2020-12-09 12:07:11,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:07:11,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:07:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:07:11,534 INFO L87 Difference]: Start difference. First operand 183 states and 364 transitions. Second operand 9 states. [2020-12-09 12:07:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:11,725 INFO L93 Difference]: Finished difference Result 183 states and 361 transitions. [2020-12-09 12:07:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:07:11,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-09 12:07:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:11,727 INFO L225 Difference]: With dead ends: 183 [2020-12-09 12:07:11,727 INFO L226 Difference]: Without dead ends: 153 [2020-12-09 12:07:11,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:07:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-12-09 12:07:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2020-12-09 12:07:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-12-09 12:07:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 293 transitions. [2020-12-09 12:07:11,729 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 293 transitions. Word has length 19 [2020-12-09 12:07:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:11,730 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 293 transitions. [2020-12-09 12:07:11,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:07:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 293 transitions. [2020-12-09 12:07:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 12:07:11,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:11,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:11,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-09 12:07:11,730 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1211997573, now seen corresponding path program 1 times [2020-12-09 12:07:11,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:11,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190057988] [2020-12-09 12:07:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:11,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190057988] [2020-12-09 12:07:11,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:11,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:07:11,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472020250] [2020-12-09 12:07:11,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:07:11,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:11,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:07:11,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:07:11,776 INFO L87 Difference]: Start difference. First operand 145 states and 293 transitions. Second operand 6 states. [2020-12-09 12:07:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:11,808 INFO L93 Difference]: Finished difference Result 124 states and 250 transitions. [2020-12-09 12:07:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:07:11,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-09 12:07:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:11,809 INFO L225 Difference]: With dead ends: 124 [2020-12-09 12:07:11,809 INFO L226 Difference]: Without dead ends: 97 [2020-12-09 12:07:11,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:07:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-12-09 12:07:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-12-09 12:07:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-09 12:07:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 166 transitions. [2020-12-09 12:07:11,811 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 166 transitions. Word has length 19 [2020-12-09 12:07:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:11,811 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 166 transitions. [2020-12-09 12:07:11,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:07:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 166 transitions. [2020-12-09 12:07:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 12:07:11,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:11,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:11,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-09 12:07:11,812 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1196716410, now seen corresponding path program 1 times [2020-12-09 12:07:11,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:11,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632404248] [2020-12-09 12:07:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:07:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:07:12,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632404248] [2020-12-09 12:07:12,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:07:12,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 12:07:12,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505744524] [2020-12-09 12:07:12,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 12:07:12,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:07:12,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 12:07:12,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 12:07:12,077 INFO L87 Difference]: Start difference. First operand 87 states and 166 transitions. Second operand 10 states. [2020-12-09 12:07:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:07:12,291 INFO L93 Difference]: Finished difference Result 124 states and 226 transitions. [2020-12-09 12:07:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 12:07:12,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-09 12:07:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:07:12,292 INFO L225 Difference]: With dead ends: 124 [2020-12-09 12:07:12,292 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 12:07:12,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-12-09 12:07:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 12:07:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2020-12-09 12:07:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 12:07:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-12-09 12:07:12,294 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22 [2020-12-09 12:07:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:07:12,294 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-12-09 12:07:12,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 12:07:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-12-09 12:07:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 12:07:12,295 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:07:12,295 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:07:12,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-09 12:07:12,295 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:07:12,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:07:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2124764362, now seen corresponding path program 2 times [2020-12-09 12:07:12,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:07:12,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513895855] [2020-12-09 12:07:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:07:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 12:07:12,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 12:07:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 12:07:12,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 12:07:12,402 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 12:07:12,402 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 12:07:12,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-09 12:07:12,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:07:12 BasicIcfg [2020-12-09 12:07:12,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 12:07:12,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 12:07:12,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 12:07:12,455 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 12:07:12,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:06:57" (3/4) ... [2020-12-09 12:07:12,457 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 12:07:12,515 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0dedc3e8-d0b8-488e-9e03-3e83aa0e1fed/bin/utaipan/witness.graphml [2020-12-09 12:07:12,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 12:07:12,516 INFO L168 Benchmark]: Toolchain (without parser) took 16883.81 ms. Allocated memory was 83.9 MB in the beginning and 209.7 MB in the end (delta: 125.8 MB). Free memory was 61.0 MB in the beginning and 69.1 MB in the end (delta: -8.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:07:12,516 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 83.9 MB. Free memory was 58.4 MB in the beginning and 58.3 MB in the end (delta: 76.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 12:07:12,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.69 ms. Allocated memory was 83.9 MB in the beginning and 119.5 MB in the end (delta: 35.7 MB). Free memory was 60.7 MB in the beginning and 94.0 MB in the end (delta: -33.3 MB). Peak memory consumption was 41.7 MB. Max. memory is 16.1 GB. [2020-12-09 12:07:12,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.15 ms. Allocated memory is still 119.5 MB. Free memory was 93.2 MB in the beginning and 91.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:07:12,517 INFO L168 Benchmark]: Boogie Preprocessor took 38.40 ms. Allocated memory is still 119.5 MB. Free memory was 91.1 MB in the beginning and 88.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:07:12,517 INFO L168 Benchmark]: RCFGBuilder took 1470.62 ms. Allocated memory was 119.5 MB in the beginning and 144.7 MB in the end (delta: 25.2 MB). Free memory was 88.2 MB in the beginning and 42.8 MB in the end (delta: 45.4 MB). Peak memory consumption was 70.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:07:12,518 INFO L168 Benchmark]: TraceAbstraction took 14830.68 ms. Allocated memory was 144.7 MB in the beginning and 209.7 MB in the end (delta: 65.0 MB). Free memory was 113.0 MB in the beginning and 82.7 MB in the end (delta: 30.3 MB). Peak memory consumption was 95.4 MB. Max. memory is 16.1 GB. [2020-12-09 12:07:12,518 INFO L168 Benchmark]: Witness Printer took 60.40 ms. Allocated memory is still 209.7 MB. Free memory was 82.7 MB in the beginning and 69.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 12:07:12,519 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.13 ms. Allocated memory is still 83.9 MB. Free memory was 58.4 MB in the beginning and 58.3 MB in the end (delta: 76.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 417.69 ms. Allocated memory was 83.9 MB in the beginning and 119.5 MB in the end (delta: 35.7 MB). Free memory was 60.7 MB in the beginning and 94.0 MB in the end (delta: -33.3 MB). Peak memory consumption was 41.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.15 ms. Allocated memory is still 119.5 MB. Free memory was 93.2 MB in the beginning and 91.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.40 ms. Allocated memory is still 119.5 MB. Free memory was 91.1 MB in the beginning and 88.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1470.62 ms. Allocated memory was 119.5 MB in the beginning and 144.7 MB in the end (delta: 25.2 MB). Free memory was 88.2 MB in the beginning and 42.8 MB in the end (delta: 45.4 MB). Peak memory consumption was 70.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14830.68 ms. Allocated memory was 144.7 MB in the beginning and 209.7 MB in the end (delta: 65.0 MB). Free memory was 113.0 MB in the beginning and 82.7 MB in the end (delta: 30.3 MB). Peak memory consumption was 95.4 MB. Max. memory is 16.1 GB. * Witness Printer took 60.40 ms. Allocated memory is still 209.7 MB. Free memory was 82.7 MB in the beginning and 69.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1201 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 159 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.0s, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 28 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 4814 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2031; [L819] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2032; [L821] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2033; [L823] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 561 SDtfs, 775 SDslu, 1549 SDs, 0 SdLazy, 878 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 440 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 75241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...