./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt.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_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/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 183440cdecb0624839d263653999546cbfafc9f0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 07:37:23,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:37:23,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:37:23,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:37:23,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:37:23,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:37:23,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:37:23,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:37:23,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:37:23,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:37:23,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:37:23,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:37:23,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:37:23,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:37:23,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:37:23,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:37:23,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:37:23,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:37:23,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:37:23,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:37:23,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:37:23,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:37:23,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:37:23,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:37:23,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:37:23,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:37:23,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:37:23,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:37:23,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:37:23,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:37:23,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:37:23,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:37:23,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:37:23,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:37:23,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:37:23,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:37:23,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:37:23,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:37:23,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:37:23,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:37:23,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:37:23,514 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 07:37:23,531 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:37:23,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:37:23,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:37:23,532 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:37:23,532 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:37:23,532 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:37:23,532 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 07:37:23,532 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:37:23,532 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:37:23,533 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 07:37:23,533 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 07:37:23,533 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:37:23,533 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 07:37:23,533 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 07:37:23,533 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 07:37:23,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:37:23,534 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:37:23,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 07:37:23,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:37:23,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:37:23,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 07:37:23,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:37:23,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 07:37:23,534 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:37:23,535 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:37:23,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 07:37:23,535 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:37:23,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 07:37:23,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:37:23,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:37:23,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:37:23,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:37:23,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:37:23,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 07:37:23,536 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 07:37:23,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 07:37:23,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 07:37:23,536 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:37:23,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:37:23,536 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_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/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_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/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 -> 183440cdecb0624839d263653999546cbfafc9f0 [2020-12-09 07:37:23,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:37:23,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:37:23,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:37:23,714 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:37:23,714 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:37:23,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt.i [2020-12-09 07:37:23,760 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/data/cde619868/6ed04beb46d5461c8ebc91e1ea1dfbdd/FLAG4e7f84c23 [2020-12-09 07:37:24,183 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:37:24,184 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/sv-benchmarks/c/pthread-wmm/safe030_rmo.opt.i [2020-12-09 07:37:24,198 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/data/cde619868/6ed04beb46d5461c8ebc91e1ea1dfbdd/FLAG4e7f84c23 [2020-12-09 07:37:24,208 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/data/cde619868/6ed04beb46d5461c8ebc91e1ea1dfbdd [2020-12-09 07:37:24,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:37:24,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:37:24,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:37:24,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:37:24,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:37:24,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b391d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24, skipping insertion in model container [2020-12-09 07:37:24,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:37:24,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:37:24,375 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_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/sv-benchmarks/c/pthread-wmm/safe030_rmo.opt.i[949,962] [2020-12-09 07:37:24,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:37:24,496 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:37:24,505 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_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/sv-benchmarks/c/pthread-wmm/safe030_rmo.opt.i[949,962] [2020-12-09 07:37:24,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:37:24,593 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:37:24,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24 WrapperNode [2020-12-09 07:37:24,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:37:24,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:37:24,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:37:24,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:37:24,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:37:24,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:37:24,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:37:24,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:37:24,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... [2020-12-09 07:37:24,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:37:24,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:37:24,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:37:24,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:37:24,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:37:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 07:37:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 07:37:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:37:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 07:37:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 07:37:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 07:37:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 07:37:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 07:37:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 07:37:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 07:37:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 07:37:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 07:37:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:37:24,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:37:24,721 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 07:37:25,914 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:37:25,914 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 07:37:25,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:37:25 BoogieIcfgContainer [2020-12-09 07:37:25,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:37:25,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:37:25,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:37:25,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:37:25,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:37:24" (1/3) ... [2020-12-09 07:37:25,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546e22c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:37:25, skipping insertion in model container [2020-12-09 07:37:25,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:37:24" (2/3) ... [2020-12-09 07:37:25,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546e22c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:37:25, skipping insertion in model container [2020-12-09 07:37:25,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:37:25" (3/3) ... [2020-12-09 07:37:25,921 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2020-12-09 07:37:25,931 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 07:37:25,932 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:37:25,934 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 07:37:25,935 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 07:37:25,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,963 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,968 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,968 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,970 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,970 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:37:25,974 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 07:37:25,982 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 07:37:26,002 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:37:26,002 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 07:37:26,002 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:37:26,002 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:37:26,002 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:37:26,003 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:37:26,003 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:37:26,003 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:37:26,012 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 07:37:26,014 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2020-12-09 07:37:26,016 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 205 flow [2020-12-09 07:37:26,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-12-09 07:37:26,051 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-12-09 07:37:26,052 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 07:37:26,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-12-09 07:37:26,057 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2020-12-09 07:37:26,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 07:37:26,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:26,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 07:37:26,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:26,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:37:26,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:26,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:37:26,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:26,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:26,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:26,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:26,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:26,994 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 07:37:27,355 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-09 07:37:27,465 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 07:37:27,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:27,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:27,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 07:37:27,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,710 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-09 07:37:27,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 07:37:27,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,716 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:27,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:27,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:27,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:27,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:37:27,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:27,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:37:27,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:27,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:27,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:27,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,835 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:37:27,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:37:27,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:37:27,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:27,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:27,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:27,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:27,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:27,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:27,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:27,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:27,886 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:27,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:27,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:27,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:27,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:27,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:27,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:27,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:27,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:37:27,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:27,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 07:37:27,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:28,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:28,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:28,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:28,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:28,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:28,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:28,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:28,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:28,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:37:28,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:37:28,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:37:28,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:28,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,228 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:37:28,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:37:28,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:37:28,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:28,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,269 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:28,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:28,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:28,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:28,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:28,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,277 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:28,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,278 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:28,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,589 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 07:37:28,700 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 07:37:28,839 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 07:37:28,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:28,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:28,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:28,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:37:28,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:28,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 07:37:28,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,969 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:28,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:28,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:37:28,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:28,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 07:37:28,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:29,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:29,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:37:29,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:37:29,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:29,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:29,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:29,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:29,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:37:29,221 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:29,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:29,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:37:29,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:37:29,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:37:29,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:37:29,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:37:29,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:37:29,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:37:29,467 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 07:37:29,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:37:29,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,487 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 07:37:29,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,642 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 07:37:29,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:37:29,662 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 07:37:29,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:37:29,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:37:29,892 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 07:37:29,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:37:29,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,905 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,906 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 07:37:29,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,930 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,931 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,933 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,934 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 07:37:29,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:37:29,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:37:29,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:37:29,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:37:29,954 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 07:37:29,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:37:30,974 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-12-09 07:37:31,105 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-09 07:37:31,423 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-12-09 07:37:31,573 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-09 07:37:31,583 INFO L131 LiptonReduction]: Checked pairs total: 3915 [2020-12-09 07:37:31,583 INFO L133 LiptonReduction]: Total number of compositions: 80 [2020-12-09 07:37:31,587 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-12-09 07:37:31,618 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2020-12-09 07:37:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2020-12-09 07:37:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 07:37:31,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:31,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:31,625 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1491491518, now seen corresponding path program 1 times [2020-12-09 07:37:31,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:31,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361932497] [2020-12-09 07:37:31,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:31,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361932497] [2020-12-09 07:37:31,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:31,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:37:31,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974348236] [2020-12-09 07:37:31,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:37:31,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:37:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:37:31,806 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2020-12-09 07:37:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:31,863 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-12-09 07:37:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:37:31,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 07:37:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:31,878 INFO L225 Difference]: With dead ends: 650 [2020-12-09 07:37:31,878 INFO L226 Difference]: Without dead ends: 550 [2020-12-09 07:37:31,879 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 07:37:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-12-09 07:37:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-12-09 07:37:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-12-09 07:37:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-12-09 07:37:31,969 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-12-09 07:37:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:31,970 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-12-09 07:37:31,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:37:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-12-09 07:37:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 07:37:31,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:31,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:31,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 07:37:31,972 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:31,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1589045551, now seen corresponding path program 1 times [2020-12-09 07:37:31,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:31,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818013755] [2020-12-09 07:37:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:32,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818013755] [2020-12-09 07:37:32,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:32,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:37:32,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914265384] [2020-12-09 07:37:32,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:37:32,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:32,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:37:32,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:37:32,080 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-12-09 07:37:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:32,118 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-12-09 07:37:32,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:37:32,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 07:37:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:32,124 INFO L225 Difference]: With dead ends: 630 [2020-12-09 07:37:32,124 INFO L226 Difference]: Without dead ends: 530 [2020-12-09 07:37:32,125 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 07:37:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-12-09 07:37:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-12-09 07:37:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-12-09 07:37:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-12-09 07:37:32,149 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-12-09 07:37:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:32,150 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-12-09 07:37:32,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:37:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-12-09 07:37:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 07:37:32,152 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:32,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:32,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 07:37:32,152 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:32,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2015868599, now seen corresponding path program 1 times [2020-12-09 07:37:32,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:32,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375975533] [2020-12-09 07:37:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:32,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375975533] [2020-12-09 07:37:32,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:32,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:37:32,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092101328] [2020-12-09 07:37:32,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:37:32,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:37:32,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:37:32,227 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-12-09 07:37:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:32,254 INFO L93 Difference]: Finished difference Result 604 states and 1772 transitions. [2020-12-09 07:37:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:37:32,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 07:37:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:32,258 INFO L225 Difference]: With dead ends: 604 [2020-12-09 07:37:32,258 INFO L226 Difference]: Without dead ends: 514 [2020-12-09 07:37:32,258 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 07:37:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-12-09 07:37:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-12-09 07:37:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-12-09 07:37:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2020-12-09 07:37:32,271 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 11 [2020-12-09 07:37:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:32,271 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2020-12-09 07:37:32,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:37:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2020-12-09 07:37:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 07:37:32,273 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:32,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:32,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 07:37:32,273 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:32,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:32,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1932541835, now seen corresponding path program 1 times [2020-12-09 07:37:32,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:32,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138009146] [2020-12-09 07:37:32,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:32,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138009146] [2020-12-09 07:37:32,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:32,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:37:32,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590466810] [2020-12-09 07:37:32,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:37:32,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:32,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:37:32,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:37:32,332 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand 4 states. [2020-12-09 07:37:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:32,369 INFO L93 Difference]: Finished difference Result 800 states and 2294 transitions. [2020-12-09 07:37:32,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:37:32,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 07:37:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:32,374 INFO L225 Difference]: With dead ends: 800 [2020-12-09 07:37:32,375 INFO L226 Difference]: Without dead ends: 574 [2020-12-09 07:37:32,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:37:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-12-09 07:37:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 494. [2020-12-09 07:37:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-12-09 07:37:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1423 transitions. [2020-12-09 07:37:32,394 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1423 transitions. Word has length 12 [2020-12-09 07:37:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:32,394 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 1423 transitions. [2020-12-09 07:37:32,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:37:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1423 transitions. [2020-12-09 07:37:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 07:37:32,395 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:32,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:32,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 07:37:32,396 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1932500512, now seen corresponding path program 1 times [2020-12-09 07:37:32,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:32,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835297683] [2020-12-09 07:37:32,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:32,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835297683] [2020-12-09 07:37:32,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:32,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:37:32,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576074840] [2020-12-09 07:37:32,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:37:32,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:37:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:37:32,508 INFO L87 Difference]: Start difference. First operand 494 states and 1423 transitions. Second operand 5 states. [2020-12-09 07:37:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:32,577 INFO L93 Difference]: Finished difference Result 548 states and 1537 transitions. [2020-12-09 07:37:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:37:32,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-09 07:37:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:32,581 INFO L225 Difference]: With dead ends: 548 [2020-12-09 07:37:32,581 INFO L226 Difference]: Without dead ends: 488 [2020-12-09 07:37:32,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:37:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-12-09 07:37:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2020-12-09 07:37:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-12-09 07:37:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1401 transitions. [2020-12-09 07:37:32,595 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1401 transitions. Word has length 12 [2020-12-09 07:37:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:32,595 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 1401 transitions. [2020-12-09 07:37:32,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:37:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1401 transitions. [2020-12-09 07:37:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:37:32,596 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:32,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:32,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 07:37:32,597 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:32,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1901119999, now seen corresponding path program 1 times [2020-12-09 07:37:32,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:32,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746334884] [2020-12-09 07:37:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:32,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746334884] [2020-12-09 07:37:32,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:32,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:37:32,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342490358] [2020-12-09 07:37:32,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:37:32,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:32,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:37:32,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:37:32,654 INFO L87 Difference]: Start difference. First operand 488 states and 1401 transitions. Second operand 4 states. [2020-12-09 07:37:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:32,685 INFO L93 Difference]: Finished difference Result 755 states and 2074 transitions. [2020-12-09 07:37:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:37:32,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-09 07:37:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:32,689 INFO L225 Difference]: With dead ends: 755 [2020-12-09 07:37:32,689 INFO L226 Difference]: Without dead ends: 536 [2020-12-09 07:37:32,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:37:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-12-09 07:37:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 464. [2020-12-09 07:37:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-09 07:37:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1274 transitions. [2020-12-09 07:37:32,700 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1274 transitions. Word has length 13 [2020-12-09 07:37:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:32,700 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 1274 transitions. [2020-12-09 07:37:32,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:37:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1274 transitions. [2020-12-09 07:37:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:37:32,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:32,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:32,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 07:37:32,701 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash -734667343, now seen corresponding path program 1 times [2020-12-09 07:37:32,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:32,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85118379] [2020-12-09 07:37:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:32,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85118379] [2020-12-09 07:37:32,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:32,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:37:32,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412172990] [2020-12-09 07:37:32,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:37:32,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:32,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:37:32,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:37:32,803 INFO L87 Difference]: Start difference. First operand 464 states and 1274 transitions. Second operand 6 states. [2020-12-09 07:37:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:32,888 INFO L93 Difference]: Finished difference Result 500 states and 1340 transitions. [2020-12-09 07:37:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:37:32,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 07:37:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:32,892 INFO L225 Difference]: With dead ends: 500 [2020-12-09 07:37:32,892 INFO L226 Difference]: Without dead ends: 452 [2020-12-09 07:37:32,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:37:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-12-09 07:37:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-12-09 07:37:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-12-09 07:37:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1230 transitions. [2020-12-09 07:37:32,901 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1230 transitions. Word has length 13 [2020-12-09 07:37:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:32,901 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1230 transitions. [2020-12-09 07:37:32,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:37:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1230 transitions. [2020-12-09 07:37:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:37:32,902 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:32,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:32,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 07:37:32,902 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:32,903 INFO L82 PathProgramCache]: Analyzing trace with hash 222073074, now seen corresponding path program 1 times [2020-12-09 07:37:32,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:32,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625342673] [2020-12-09 07:37:32,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:32,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625342673] [2020-12-09 07:37:32,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:32,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:37:32,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646420107] [2020-12-09 07:37:32,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:37:32,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:32,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:37:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:37:32,957 INFO L87 Difference]: Start difference. First operand 452 states and 1230 transitions. Second operand 5 states. [2020-12-09 07:37:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:33,032 INFO L93 Difference]: Finished difference Result 501 states and 1339 transitions. [2020-12-09 07:37:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:37:33,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 07:37:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:33,037 INFO L225 Difference]: With dead ends: 501 [2020-12-09 07:37:33,037 INFO L226 Difference]: Without dead ends: 456 [2020-12-09 07:37:33,037 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 07:37:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2020-12-09 07:37:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2020-12-09 07:37:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-12-09 07:37:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1240 transitions. [2020-12-09 07:37:33,052 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1240 transitions. Word has length 13 [2020-12-09 07:37:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:33,053 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 1240 transitions. [2020-12-09 07:37:33,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:37:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1240 transitions. [2020-12-09 07:37:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:37:33,054 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:33,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:33,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 07:37:33,054 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:33,055 INFO L82 PathProgramCache]: Analyzing trace with hash -164998506, now seen corresponding path program 2 times [2020-12-09 07:37:33,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:33,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130234185] [2020-12-09 07:37:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:33,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130234185] [2020-12-09 07:37:33,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:33,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:37:33,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372032333] [2020-12-09 07:37:33,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:37:33,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:33,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:37:33,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:37:33,170 INFO L87 Difference]: Start difference. First operand 456 states and 1240 transitions. Second operand 6 states. [2020-12-09 07:37:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:33,299 INFO L93 Difference]: Finished difference Result 495 states and 1317 transitions. [2020-12-09 07:37:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:37:33,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 07:37:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:33,303 INFO L225 Difference]: With dead ends: 495 [2020-12-09 07:37:33,303 INFO L226 Difference]: Without dead ends: 450 [2020-12-09 07:37:33,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:37:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-12-09 07:37:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 446. [2020-12-09 07:37:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-12-09 07:37:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1208 transitions. [2020-12-09 07:37:33,316 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1208 transitions. Word has length 13 [2020-12-09 07:37:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:33,317 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1208 transitions. [2020-12-09 07:37:33,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:37:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1208 transitions. [2020-12-09 07:37:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 07:37:33,318 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:33,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:33,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 07:37:33,318 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:33,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:33,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1299804351, now seen corresponding path program 1 times [2020-12-09 07:37:33,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:33,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337588082] [2020-12-09 07:37:33,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:33,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337588082] [2020-12-09 07:37:33,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:33,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:37:33,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897997599] [2020-12-09 07:37:33,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:37:33,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:33,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:37:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:37:33,390 INFO L87 Difference]: Start difference. First operand 446 states and 1208 transitions. Second operand 6 states. [2020-12-09 07:37:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:33,506 INFO L93 Difference]: Finished difference Result 530 states and 1418 transitions. [2020-12-09 07:37:33,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:37:33,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 07:37:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:33,509 INFO L225 Difference]: With dead ends: 530 [2020-12-09 07:37:33,509 INFO L226 Difference]: Without dead ends: 494 [2020-12-09 07:37:33,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:37:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-12-09 07:37:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 466. [2020-12-09 07:37:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-12-09 07:37:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1251 transitions. [2020-12-09 07:37:33,519 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1251 transitions. Word has length 14 [2020-12-09 07:37:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:33,519 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 1251 transitions. [2020-12-09 07:37:33,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:37:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1251 transitions. [2020-12-09 07:37:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 07:37:33,520 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:33,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:33,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 07:37:33,521 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:33,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:33,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1686875931, now seen corresponding path program 2 times [2020-12-09 07:37:33,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:33,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106172107] [2020-12-09 07:37:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:33,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106172107] [2020-12-09 07:37:33,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:33,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:37:33,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889363682] [2020-12-09 07:37:33,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:37:33,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:33,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:37:33,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:37:33,631 INFO L87 Difference]: Start difference. First operand 466 states and 1251 transitions. Second operand 7 states. [2020-12-09 07:37:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:33,768 INFO L93 Difference]: Finished difference Result 532 states and 1403 transitions. [2020-12-09 07:37:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:37:33,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-09 07:37:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:33,771 INFO L225 Difference]: With dead ends: 532 [2020-12-09 07:37:33,772 INFO L226 Difference]: Without dead ends: 490 [2020-12-09 07:37:33,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:37:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-12-09 07:37:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 458. [2020-12-09 07:37:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-12-09 07:37:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1228 transitions. [2020-12-09 07:37:33,783 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1228 transitions. Word has length 14 [2020-12-09 07:37:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:33,783 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1228 transitions. [2020-12-09 07:37:33,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:37:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1228 transitions. [2020-12-09 07:37:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 07:37:33,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:33,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:33,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 07:37:33,785 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:33,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1705621535, now seen corresponding path program 1 times [2020-12-09 07:37:33,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:33,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742604501] [2020-12-09 07:37:33,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:33,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742604501] [2020-12-09 07:37:33,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:33,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:37:33,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630466767] [2020-12-09 07:37:33,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:37:33,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:33,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:37:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:37:33,882 INFO L87 Difference]: Start difference. First operand 458 states and 1228 transitions. Second operand 6 states. [2020-12-09 07:37:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:33,942 INFO L93 Difference]: Finished difference Result 480 states and 1265 transitions. [2020-12-09 07:37:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:37:33,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 07:37:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:33,945 INFO L225 Difference]: With dead ends: 480 [2020-12-09 07:37:33,945 INFO L226 Difference]: Without dead ends: 450 [2020-12-09 07:37:33,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:37:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-12-09 07:37:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 446. [2020-12-09 07:37:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-12-09 07:37:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1190 transitions. [2020-12-09 07:37:33,954 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1190 transitions. Word has length 14 [2020-12-09 07:37:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:33,954 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1190 transitions. [2020-12-09 07:37:33,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:37:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1190 transitions. [2020-12-09 07:37:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 07:37:33,955 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:33,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:33,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 07:37:33,955 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:33,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1670281230, now seen corresponding path program 1 times [2020-12-09 07:37:33,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:33,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711229724] [2020-12-09 07:37:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:34,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711229724] [2020-12-09 07:37:34,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:34,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:37:34,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465234150] [2020-12-09 07:37:34,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:37:34,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:34,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:37:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:37:34,012 INFO L87 Difference]: Start difference. First operand 446 states and 1190 transitions. Second operand 4 states. [2020-12-09 07:37:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:34,033 INFO L93 Difference]: Finished difference Result 432 states and 1011 transitions. [2020-12-09 07:37:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:37:34,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 07:37:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:34,035 INFO L225 Difference]: With dead ends: 432 [2020-12-09 07:37:34,035 INFO L226 Difference]: Without dead ends: 324 [2020-12-09 07:37:34,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:37:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-12-09 07:37:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2020-12-09 07:37:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-09 07:37:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 744 transitions. [2020-12-09 07:37:34,041 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 744 transitions. Word has length 15 [2020-12-09 07:37:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:34,041 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 744 transitions. [2020-12-09 07:37:34,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:37:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 744 transitions. [2020-12-09 07:37:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 07:37:34,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:34,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:34,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 07:37:34,042 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash -942899002, now seen corresponding path program 1 times [2020-12-09 07:37:34,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:34,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781143027] [2020-12-09 07:37:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:34,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781143027] [2020-12-09 07:37:34,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:34,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:37:34,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659572391] [2020-12-09 07:37:34,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:37:34,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:34,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:37:34,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:37:34,091 INFO L87 Difference]: Start difference. First operand 324 states and 744 transitions. Second operand 5 states. [2020-12-09 07:37:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:34,117 INFO L93 Difference]: Finished difference Result 259 states and 534 transitions. [2020-12-09 07:37:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:37:34,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 07:37:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:34,119 INFO L225 Difference]: With dead ends: 259 [2020-12-09 07:37:34,119 INFO L226 Difference]: Without dead ends: 186 [2020-12-09 07:37:34,119 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 07:37:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-09 07:37:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2020-12-09 07:37:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-12-09 07:37:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 354 transitions. [2020-12-09 07:37:34,122 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 354 transitions. Word has length 16 [2020-12-09 07:37:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:34,123 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 354 transitions. [2020-12-09 07:37:34,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:37:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 354 transitions. [2020-12-09 07:37:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 07:37:34,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:34,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:34,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 07:37:34,124 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1796959845, now seen corresponding path program 1 times [2020-12-09 07:37:34,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:34,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058308381] [2020-12-09 07:37:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:34,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058308381] [2020-12-09 07:37:34,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:34,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:37:34,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239816170] [2020-12-09 07:37:34,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:37:34,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:34,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:37:34,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:37:34,178 INFO L87 Difference]: Start difference. First operand 182 states and 354 transitions. Second operand 6 states. [2020-12-09 07:37:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:34,210 INFO L93 Difference]: Finished difference Result 155 states and 300 transitions. [2020-12-09 07:37:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:37:34,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 07:37:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:34,211 INFO L225 Difference]: With dead ends: 155 [2020-12-09 07:37:34,211 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 07:37:34,211 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 07:37:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 07:37:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-12-09 07:37:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 07:37:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-12-09 07:37:34,212 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2020-12-09 07:37:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:34,212 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-12-09 07:37:34,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:37:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-12-09 07:37:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:37:34,213 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:34,213 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:34,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 07:37:34,213 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:34,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:34,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1886722460, now seen corresponding path program 1 times [2020-12-09 07:37:34,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:34,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129865429] [2020-12-09 07:37:34,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:37:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:37:34,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129865429] [2020-12-09 07:37:34,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:37:34,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:37:34,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112735801] [2020-12-09 07:37:34,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 07:37:34,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:37:34,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 07:37:34,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:37:34,382 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 9 states. [2020-12-09 07:37:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:37:34,517 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2020-12-09 07:37:34,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:37:34,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-12-09 07:37:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:37:34,518 INFO L225 Difference]: With dead ends: 75 [2020-12-09 07:37:34,518 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 07:37:34,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-09 07:37:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 07:37:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-12-09 07:37:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-09 07:37:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-12-09 07:37:34,520 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-12-09 07:37:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:37:34,520 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-12-09 07:37:34,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 07:37:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-12-09 07:37:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:37:34,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:37:34,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:37:34,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 07:37:34,521 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:37:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:37:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1747085148, now seen corresponding path program 2 times [2020-12-09 07:37:34,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:37:34,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358329802] [2020-12-09 07:37:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:37:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:37:34,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:37:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:37:34,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:37:34,605 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 07:37:34,605 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 07:37:34,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 07:37:34,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:37:34 BasicIcfg [2020-12-09 07:37:34,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 07:37:34,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 07:37:34,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 07:37:34,658 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 07:37:34,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:37:25" (3/4) ... [2020-12-09 07:37:34,660 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 07:37:34,714 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ac9c77b7-a596-4925-828a-fb1c1fa84e3b/bin/utaipan/witness.graphml [2020-12-09 07:37:34,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 07:37:34,715 INFO L168 Benchmark]: Toolchain (without parser) took 10503.59 ms. Allocated memory was 127.9 MB in the beginning and 325.1 MB in the end (delta: 197.1 MB). Free memory was 96.2 MB in the beginning and 182.4 MB in the end (delta: -86.2 MB). Peak memory consumption was 111.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:37:34,715 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 83.9 MB. Free memory was 53.0 MB in the beginning and 52.9 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:37:34,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.13 ms. Allocated memory is still 127.9 MB. Free memory was 96.2 MB in the beginning and 62.3 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:37:34,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.32 ms. Allocated memory is still 127.9 MB. Free memory was 62.3 MB in the beginning and 59.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:37:34,716 INFO L168 Benchmark]: Boogie Preprocessor took 26.64 ms. Allocated memory is still 127.9 MB. Free memory was 59.5 MB in the beginning and 57.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:37:34,716 INFO L168 Benchmark]: RCFGBuilder took 1254.19 ms. Allocated memory is still 127.9 MB. Free memory was 57.2 MB in the beginning and 48.8 MB in the end (delta: 8.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:37:34,716 INFO L168 Benchmark]: TraceAbstraction took 8740.67 ms. Allocated memory was 127.9 MB in the beginning and 325.1 MB in the end (delta: 197.1 MB). Free memory was 48.8 MB in the beginning and 195.0 MB in the end (delta: -146.2 MB). Peak memory consumption was 49.8 MB. Max. memory is 16.1 GB. [2020-12-09 07:37:34,716 INFO L168 Benchmark]: Witness Printer took 56.11 ms. Allocated memory is still 325.1 MB. Free memory was 195.0 MB in the beginning and 182.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:37:34,718 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.12 ms. Allocated memory is still 83.9 MB. Free memory was 53.0 MB in the beginning and 52.9 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 381.13 ms. Allocated memory is still 127.9 MB. Free memory was 96.2 MB in the beginning and 62.3 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.32 ms. Allocated memory is still 127.9 MB. Free memory was 62.3 MB in the beginning and 59.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.64 ms. Allocated memory is still 127.9 MB. Free memory was 59.5 MB in the beginning and 57.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1254.19 ms. Allocated memory is still 127.9 MB. Free memory was 57.2 MB in the beginning and 48.8 MB in the end (delta: 8.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8740.67 ms. Allocated memory was 127.9 MB in the beginning and 325.1 MB in the end (delta: 197.1 MB). Free memory was 48.8 MB in the beginning and 195.0 MB in the end (delta: -146.2 MB). Peak memory consumption was 49.8 MB. Max. memory is 16.1 GB. * Witness Printer took 56.11 ms. Allocated memory is still 325.1 MB. Free memory was 195.0 MB in the beginning and 182.4 MB in the end (delta: 12.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 1011 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.5s, 103 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 27 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3915 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2504; [L812] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2505; [L814] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2506; [L816] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 460 SDtfs, 498 SDslu, 903 SDs, 0 SdLazy, 445 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred 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, 16 MinimizatonAttempts, 240 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 20428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...