./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_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_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/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 2d0efb2b7db857c130817c46f142aefdb6cc0e00 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:23:22,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 20:23:22,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 20:23:22,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 20:23:22,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 20:23:22,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 20:23:22,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 20:23:22,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 20:23:22,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 20:23:22,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 20:23:22,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 20:23:22,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 20:23:22,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 20:23:22,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 20:23:22,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 20:23:22,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 20:23:22,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 20:23:22,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 20:23:22,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 20:23:22,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 20:23:22,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 20:23:22,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 20:23:22,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 20:23:22,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 20:23:22,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 20:23:22,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 20:23:22,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 20:23:22,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 20:23:22,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 20:23:22,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 20:23:22,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 20:23:22,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 20:23:22,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 20:23:22,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 20:23:22,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 20:23:22,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 20:23:22,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 20:23:22,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 20:23:22,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 20:23:22,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 20:23:22,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 20:23:22,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 20:23:22,452 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 20:23:22,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 20:23:22,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 20:23:22,453 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 20:23:22,453 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 20:23:22,453 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 20:23:22,453 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 20:23:22,453 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 20:23:22,454 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 20:23:22,454 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 20:23:22,454 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 20:23:22,454 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 20:23:22,454 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 20:23:22,454 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 20:23:22,454 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 20:23:22,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 20:23:22,455 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 20:23:22,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 20:23:22,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 20:23:22,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 20:23:22,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 20:23:22,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 20:23:22,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 20:23:22,455 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 20:23:22,456 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 20:23:22,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 20:23:22,456 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 20:23:22,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 20:23:22,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 20:23:22,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 20:23:22,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:23:22,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 20:23:22,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 20:23:22,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 20:23:22,457 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 20:23:22,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 20:23:22,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 20:23:22,457 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 20:23:22,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 20:23:22,457 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_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/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_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/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 -> 2d0efb2b7db857c130817c46f142aefdb6cc0e00 [2020-12-09 20:23:22,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 20:23:22,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 20:23:22,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 20:23:22,660 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 20:23:22,661 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 20:23:22,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i [2020-12-09 20:23:22,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/data/242fd2017/6607362164964b8086ee016494f7c8fa/FLAG20543c130 [2020-12-09 20:23:23,123 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 20:23:23,123 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i [2020-12-09 20:23:23,135 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/data/242fd2017/6607362164964b8086ee016494f7c8fa/FLAG20543c130 [2020-12-09 20:23:23,147 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/data/242fd2017/6607362164964b8086ee016494f7c8fa [2020-12-09 20:23:23,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 20:23:23,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 20:23:23,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 20:23:23,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 20:23:23,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 20:23:23,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c59b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23, skipping insertion in model container [2020-12-09 20:23:23,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 20:23:23,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 20:23:23,312 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_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i[949,962] [2020-12-09 20:23:23,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:23:23,423 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 20:23:23,432 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_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i[949,962] [2020-12-09 20:23:23,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:23:23,514 INFO L208 MainTranslator]: Completed translation [2020-12-09 20:23:23,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23 WrapperNode [2020-12-09 20:23:23,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 20:23:23,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 20:23:23,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 20:23:23,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 20:23:23,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 20:23:23,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 20:23:23,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 20:23:23,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 20:23:23,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... [2020-12-09 20:23:23,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 20:23:23,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 20:23:23,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 20:23:23,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 20:23:23,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/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 20:23:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 20:23:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 20:23:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 20:23:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 20:23:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 20:23:23,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 20:23:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 20:23:23,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 20:23:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 20:23:23,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 20:23:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 20:23:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 20:23:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 20:23:23,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 20:23:23,671 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 20:23:24,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 20:23:24,909 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 20:23:24,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:23:24 BoogieIcfgContainer [2020-12-09 20:23:24,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 20:23:24,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 20:23:24,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 20:23:24,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 20:23:24,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:23:23" (1/3) ... [2020-12-09 20:23:24,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a51754f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:23:24, skipping insertion in model container [2020-12-09 20:23:24,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:23:23" (2/3) ... [2020-12-09 20:23:24,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a51754f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:23:24, skipping insertion in model container [2020-12-09 20:23:24,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:23:24" (3/3) ... [2020-12-09 20:23:24,918 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2020-12-09 20:23:24,929 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 20:23:24,929 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 20:23:24,931 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 20:23:24,932 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 20:23:24,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,955 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,955 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,955 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,956 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,966 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:23:24,971 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 20:23:24,979 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 20:23:24,993 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 20:23:24,993 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 20:23:24,993 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 20:23:24,994 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 20:23:24,994 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 20:23:24,994 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 20:23:24,994 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 20:23:24,994 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 20:23:25,003 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 20:23:25,005 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 207 flow [2020-12-09 20:23:25,007 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 207 flow [2020-12-09 20:23:25,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-12-09 20:23:25,053 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-12-09 20:23:25,053 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 20:23:25,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-12-09 20:23:25,060 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2020-12-09 20:23:25,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 20:23:25,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:25,735 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 20:23:25,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:25,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 20:23:25,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:25,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 20:23:25,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:25,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 20:23:25,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:25,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 20:23:25,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:25,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 20:23:25,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:25,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 20:23:25,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:25,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 20:23:25,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:25,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 20:23:25,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:26,859 WARN L197 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-12-09 20:23:27,153 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2020-12-09 20:23:28,564 WARN L197 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2020-12-09 20:23:29,200 WARN L197 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2020-12-09 20:23:29,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 20:23:29,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,359 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 20:23:29,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 20:23:29,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:29,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 20:23:29,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:29,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,413 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 20:23:29,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,434 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 20:23:29,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,639 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 20:23:29,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,658 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 20:23:29,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,730 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,733 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 20:23:29,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:29,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:29,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:29,751 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 20:23:29,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:30,061 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-09 20:23:30,468 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2020-12-09 20:23:30,627 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-09 20:23:30,661 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 20:23:30,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:30,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 20:23:30,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:30,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 20:23:30,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:30,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 20:23:30,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:30,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 20:23:30,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:30,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:30,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:30,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:30,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:30,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:30,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:30,866 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 20:23:30,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:30,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:30,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:30,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:30,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:30,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:30,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:30,881 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 20:23:30,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:30,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 20:23:30,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:30,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 20:23:30,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:30,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 20:23:30,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:30,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 20:23:30,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:31,141 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,143 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:31,145 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 20:23:31,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:31,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:31,159 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 20:23:31,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:31,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,192 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:31,195 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 20:23:31,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:31,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:31,209 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 20:23:31,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:31,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:31,236 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 20:23:31,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:23:31,247 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:23:31,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 20:23:31,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:31,251 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 20:23:31,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:23:32,353 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-12-09 20:23:32,482 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 20:23:32,800 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-12-09 20:23:32,936 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 20:23:32,939 INFO L131 LiptonReduction]: Checked pairs total: 3750 [2020-12-09 20:23:32,939 INFO L133 LiptonReduction]: Total number of compositions: 80 [2020-12-09 20:23:32,943 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-12-09 20:23:32,972 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2020-12-09 20:23:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2020-12-09 20:23:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 20:23:32,977 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:32,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:32,977 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 20:23:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash -91940209, now seen corresponding path program 1 times [2020-12-09 20:23:32,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:32,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407089402] [2020-12-09 20:23:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:33,174 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 20:23:33,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407089402] [2020-12-09 20:23:33,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:33,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 20:23:33,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910261340] [2020-12-09 20:23:33,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 20:23:33,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:33,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 20:23:33,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 20:23:33,194 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2020-12-09 20:23:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:33,255 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-12-09 20:23:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 20:23:33,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 20:23:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:33,271 INFO L225 Difference]: With dead ends: 650 [2020-12-09 20:23:33,271 INFO L226 Difference]: Without dead ends: 550 [2020-12-09 20:23:33,272 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 20:23:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-12-09 20:23:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-12-09 20:23:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-12-09 20:23:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-12-09 20:23:33,332 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-12-09 20:23:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:33,332 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-12-09 20:23:33,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 20:23:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-12-09 20:23:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:23:33,334 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:33,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:33,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 20:23:33,334 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 20:23:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1199905836, now seen corresponding path program 1 times [2020-12-09 20:23:33,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:33,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358256278] [2020-12-09 20:23:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:33,416 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 20:23:33,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358256278] [2020-12-09 20:23:33,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:33,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 20:23:33,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094571586] [2020-12-09 20:23:33,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:23:33,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:23:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:23:33,418 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-12-09 20:23:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:33,450 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-12-09 20:23:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:23:33,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 20:23:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:33,457 INFO L225 Difference]: With dead ends: 630 [2020-12-09 20:23:33,457 INFO L226 Difference]: Without dead ends: 530 [2020-12-09 20:23:33,457 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 20:23:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-12-09 20:23:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-12-09 20:23:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-12-09 20:23:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-12-09 20:23:33,483 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-12-09 20:23:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:33,483 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-12-09 20:23:33,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:23:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-12-09 20:23:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 20:23:33,485 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:33,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:33,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 20:23:33,486 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 20:23:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash -581593344, now seen corresponding path program 1 times [2020-12-09 20:23:33,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:33,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400780658] [2020-12-09 20:23:33,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:23:33,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400780658] [2020-12-09 20:23:33,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:33,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 20:23:33,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104134151] [2020-12-09 20:23:33,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:23:33,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:33,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:23:33,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:23:33,608 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-12-09 20:23:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:33,667 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2020-12-09 20:23:33,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:23:33,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 20:23:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:33,672 INFO L225 Difference]: With dead ends: 593 [2020-12-09 20:23:33,673 INFO L226 Difference]: Without dead ends: 518 [2020-12-09 20:23:33,673 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 20:23:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-12-09 20:23:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2020-12-09 20:23:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-12-09 20:23:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1573 transitions. [2020-12-09 20:23:33,692 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1573 transitions. Word has length 11 [2020-12-09 20:23:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:33,692 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1573 transitions. [2020-12-09 20:23:33,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:23:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1573 transitions. [2020-12-09 20:23:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 20:23:33,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:33,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:33,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 20:23:33,694 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 20:23:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:33,695 INFO L82 PathProgramCache]: Analyzing trace with hash -870231967, now seen corresponding path program 1 times [2020-12-09 20:23:33,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:33,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022034637] [2020-12-09 20:23:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:33,790 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 20:23:33,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022034637] [2020-12-09 20:23:33,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:33,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:23:33,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146766867] [2020-12-09 20:23:33,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:23:33,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:23:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:23:33,791 INFO L87 Difference]: Start difference. First operand 518 states and 1573 transitions. Second operand 6 states. [2020-12-09 20:23:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:33,876 INFO L93 Difference]: Finished difference Result 565 states and 1653 transitions. [2020-12-09 20:23:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 20:23:33,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-12-09 20:23:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:33,880 INFO L225 Difference]: With dead ends: 565 [2020-12-09 20:23:33,880 INFO L226 Difference]: Without dead ends: 490 [2020-12-09 20:23:33,880 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 20:23:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-12-09 20:23:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2020-12-09 20:23:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-12-09 20:23:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1469 transitions. [2020-12-09 20:23:33,891 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1469 transitions. Word has length 12 [2020-12-09 20:23:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:33,891 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 1469 transitions. [2020-12-09 20:23:33,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:23:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1469 transitions. [2020-12-09 20:23:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 20:23:33,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:33,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:33,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 20:23:33,893 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 20:23:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1162877187, now seen corresponding path program 1 times [2020-12-09 20:23:33,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:33,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16294767] [2020-12-09 20:23:33,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:33,977 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 20:23:33,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16294767] [2020-12-09 20:23:33,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:33,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:23:33,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846299619] [2020-12-09 20:23:33,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:23:33,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:33,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:23:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:23:33,986 INFO L87 Difference]: Start difference. First operand 490 states and 1469 transitions. Second operand 6 states. [2020-12-09 20:23:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:34,109 INFO L93 Difference]: Finished difference Result 524 states and 1522 transitions. [2020-12-09 20:23:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 20:23:34,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 20:23:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:34,113 INFO L225 Difference]: With dead ends: 524 [2020-12-09 20:23:34,113 INFO L226 Difference]: Without dead ends: 470 [2020-12-09 20:23:34,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:23:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-12-09 20:23:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2020-12-09 20:23:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-12-09 20:23:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1395 transitions. [2020-12-09 20:23:34,124 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1395 transitions. Word has length 13 [2020-12-09 20:23:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:34,124 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 1395 transitions. [2020-12-09 20:23:34,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:23:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1395 transitions. [2020-12-09 20:23:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 20:23:34,125 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:34,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:34,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 20:23:34,126 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 20:23:34,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash -620951754, now seen corresponding path program 1 times [2020-12-09 20:23:34,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:34,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147219192] [2020-12-09 20:23:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:34,161 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 20:23:34,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147219192] [2020-12-09 20:23:34,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:34,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:23:34,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430155103] [2020-12-09 20:23:34,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:23:34,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:34,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:23:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:23:34,163 INFO L87 Difference]: Start difference. First operand 470 states and 1395 transitions. Second operand 4 states. [2020-12-09 20:23:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:34,187 INFO L93 Difference]: Finished difference Result 701 states and 1997 transitions. [2020-12-09 20:23:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:23:34,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-09 20:23:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:34,191 INFO L225 Difference]: With dead ends: 701 [2020-12-09 20:23:34,191 INFO L226 Difference]: Without dead ends: 482 [2020-12-09 20:23:34,191 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 20:23:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-12-09 20:23:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 446. [2020-12-09 20:23:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-12-09 20:23:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1270 transitions. [2020-12-09 20:23:34,201 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1270 transitions. Word has length 13 [2020-12-09 20:23:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:34,201 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1270 transitions. [2020-12-09 20:23:34,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:23:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1270 transitions. [2020-12-09 20:23:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 20:23:34,202 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:34,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:34,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 20:23:34,202 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 20:23:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:34,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1351430434, now seen corresponding path program 1 times [2020-12-09 20:23:34,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:34,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870300357] [2020-12-09 20:23:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:34,296 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 20:23:34,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870300357] [2020-12-09 20:23:34,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:34,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:23:34,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356646616] [2020-12-09 20:23:34,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 20:23:34,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 20:23:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:23:34,297 INFO L87 Difference]: Start difference. First operand 446 states and 1270 transitions. Second operand 7 states. [2020-12-09 20:23:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:34,407 INFO L93 Difference]: Finished difference Result 512 states and 1431 transitions. [2020-12-09 20:23:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:23:34,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-09 20:23:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:34,411 INFO L225 Difference]: With dead ends: 512 [2020-12-09 20:23:34,411 INFO L226 Difference]: Without dead ends: 434 [2020-12-09 20:23:34,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:23:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-12-09 20:23:34,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-12-09 20:23:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-09 20:23:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1213 transitions. [2020-12-09 20:23:34,427 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1213 transitions. Word has length 14 [2020-12-09 20:23:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:34,427 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1213 transitions. [2020-12-09 20:23:34,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 20:23:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1213 transitions. [2020-12-09 20:23:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 20:23:34,428 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:34,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:34,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 20:23:34,429 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 20:23:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:34,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2069632166, now seen corresponding path program 1 times [2020-12-09 20:23:34,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:34,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135139158] [2020-12-09 20:23:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:34,500 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 20:23:34,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135139158] [2020-12-09 20:23:34,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:34,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:23:34,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240479572] [2020-12-09 20:23:34,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:23:34,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:23:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:23:34,502 INFO L87 Difference]: Start difference. First operand 434 states and 1213 transitions. Second operand 4 states. [2020-12-09 20:23:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:34,527 INFO L93 Difference]: Finished difference Result 414 states and 1014 transitions. [2020-12-09 20:23:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:23:34,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 20:23:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:34,529 INFO L225 Difference]: With dead ends: 414 [2020-12-09 20:23:34,529 INFO L226 Difference]: Without dead ends: 310 [2020-12-09 20:23:34,529 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 20:23:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-12-09 20:23:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2020-12-09 20:23:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-12-09 20:23:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 741 transitions. [2020-12-09 20:23:34,536 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 741 transitions. Word has length 14 [2020-12-09 20:23:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:34,537 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 741 transitions. [2020-12-09 20:23:34,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:23:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 741 transitions. [2020-12-09 20:23:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 20:23:34,537 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:34,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:34,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 20:23:34,538 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 20:23:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -56041785, now seen corresponding path program 1 times [2020-12-09 20:23:34,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:34,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949634317] [2020-12-09 20:23:34,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:34,592 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 20:23:34,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949634317] [2020-12-09 20:23:34,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:34,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:23:34,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804788908] [2020-12-09 20:23:34,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:23:34,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:23:34,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:23:34,594 INFO L87 Difference]: Start difference. First operand 310 states and 741 transitions. Second operand 5 states. [2020-12-09 20:23:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:34,626 INFO L93 Difference]: Finished difference Result 240 states and 514 transitions. [2020-12-09 20:23:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 20:23:34,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-09 20:23:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:34,628 INFO L225 Difference]: With dead ends: 240 [2020-12-09 20:23:34,628 INFO L226 Difference]: Without dead ends: 186 [2020-12-09 20:23:34,628 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 20:23:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-09 20:23:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-12-09 20:23:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-09 20:23:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 387 transitions. [2020-12-09 20:23:34,632 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 387 transitions. Word has length 15 [2020-12-09 20:23:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:34,632 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 387 transitions. [2020-12-09 20:23:34,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:23:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 387 transitions. [2020-12-09 20:23:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 20:23:34,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:34,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:23:34,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 20:23:34,633 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 20:23:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2037657781, now seen corresponding path program 1 times [2020-12-09 20:23:34,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:34,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915944793] [2020-12-09 20:23:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:23:34,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915944793] [2020-12-09 20:23:34,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:34,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:23:34,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456191502] [2020-12-09 20:23:34,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:23:34,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:34,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:23:34,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:23:34,688 INFO L87 Difference]: Start difference. First operand 186 states and 387 transitions. Second operand 6 states. [2020-12-09 20:23:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:34,727 INFO L93 Difference]: Finished difference Result 158 states and 330 transitions. [2020-12-09 20:23:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:23:34,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 20:23:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:34,728 INFO L225 Difference]: With dead ends: 158 [2020-12-09 20:23:34,728 INFO L226 Difference]: Without dead ends: 98 [2020-12-09 20:23:34,729 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 20:23:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-12-09 20:23:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2020-12-09 20:23:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-09 20:23:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 177 transitions. [2020-12-09 20:23:34,732 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 177 transitions. Word has length 17 [2020-12-09 20:23:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:34,732 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 177 transitions. [2020-12-09 20:23:34,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:23:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 177 transitions. [2020-12-09 20:23:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 20:23:34,733 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:34,733 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 20:23:34,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 20:23:34,733 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 20:23:34,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:34,734 INFO L82 PathProgramCache]: Analyzing trace with hash -453767717, now seen corresponding path program 1 times [2020-12-09 20:23:34,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:34,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754185256] [2020-12-09 20:23:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:34,781 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 20:23:34,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754185256] [2020-12-09 20:23:34,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:34,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:23:34,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817674920] [2020-12-09 20:23:34,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:23:34,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:23:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:23:34,783 INFO L87 Difference]: Start difference. First operand 88 states and 177 transitions. Second operand 5 states. [2020-12-09 20:23:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:34,814 INFO L93 Difference]: Finished difference Result 115 states and 226 transitions. [2020-12-09 20:23:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:23:34,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-12-09 20:23:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:34,815 INFO L225 Difference]: With dead ends: 115 [2020-12-09 20:23:34,815 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 20:23:34,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:23:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 20:23:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-12-09 20:23:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 20:23:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-12-09 20:23:34,817 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-12-09 20:23:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:34,817 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-12-09 20:23:34,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:23:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-12-09 20:23:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 20:23:34,818 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:34,818 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 20:23:34,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 20:23:34,818 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 20:23:34,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:34,818 INFO L82 PathProgramCache]: Analyzing trace with hash -36042101, now seen corresponding path program 2 times [2020-12-09 20:23:34,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:34,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018960624] [2020-12-09 20:23:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:23:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:23:34,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018960624] [2020-12-09 20:23:34,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:23:34,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:23:34,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881265058] [2020-12-09 20:23:34,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 20:23:34,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:23:34,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 20:23:34,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:23:34,911 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 7 states. [2020-12-09 20:23:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:23:35,024 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-12-09 20:23:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:23:35,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-09 20:23:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:23:35,025 INFO L225 Difference]: With dead ends: 63 [2020-12-09 20:23:35,025 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 20:23:35,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:23:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 20:23:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-12-09 20:23:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-09 20:23:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-12-09 20:23:35,027 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-12-09 20:23:35,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:23:35,027 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-12-09 20:23:35,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 20:23:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-12-09 20:23:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 20:23:35,027 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:23:35,027 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 20:23:35,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 20:23:35,028 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 20:23:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:23:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash -689523069, now seen corresponding path program 3 times [2020-12-09 20:23:35,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:23:35,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821379257] [2020-12-09 20:23:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:23:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 20:23:35,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 20:23:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 20:23:35,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 20:23:35,134 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 20:23:35,135 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 20:23:35,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 20:23:35,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:23:35 BasicIcfg [2020-12-09 20:23:35,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 20:23:35,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 20:23:35,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 20:23:35,202 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 20:23:35,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:23:24" (3/4) ... [2020-12-09 20:23:35,204 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 20:23:35,269 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6e2ac6a6-b68f-427a-a7e5-00a3ee13694f/bin/utaipan/witness.graphml [2020-12-09 20:23:35,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 20:23:35,270 INFO L168 Benchmark]: Toolchain (without parser) took 12118.73 ms. Allocated memory was 96.5 MB in the beginning and 209.7 MB in the end (delta: 113.2 MB). Free memory was 54.8 MB in the beginning and 146.3 MB in the end (delta: -91.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 16.1 GB. [2020-12-09 20:23:35,270 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 96.5 MB. Free memory was 72.6 MB in the beginning and 72.5 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:23:35,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.87 ms. Allocated memory is still 96.5 MB. Free memory was 54.7 MB in the beginning and 44.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2020-12-09 20:23:35,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.12 ms. Allocated memory is still 96.5 MB. Free memory was 44.3 MB in the beginning and 73.3 MB in the end (delta: -29.0 MB). Peak memory consumption was 3.6 MB. Max. memory is 16.1 GB. [2020-12-09 20:23:35,271 INFO L168 Benchmark]: Boogie Preprocessor took 26.91 ms. Allocated memory is still 96.5 MB. Free memory was 73.3 MB in the beginning and 71.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:23:35,271 INFO L168 Benchmark]: RCFGBuilder took 1321.37 ms. Allocated memory was 96.5 MB in the beginning and 144.7 MB in the end (delta: 48.2 MB). Free memory was 71.2 MB in the beginning and 69.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 68.4 MB. Max. memory is 16.1 GB. [2020-12-09 20:23:35,271 INFO L168 Benchmark]: TraceAbstraction took 10288.72 ms. Allocated memory was 144.7 MB in the beginning and 209.7 MB in the end (delta: 65.0 MB). Free memory was 69.0 MB in the beginning and 157.9 MB in the end (delta: -88.9 MB). Peak memory consumption was 78.2 MB. Max. memory is 16.1 GB. [2020-12-09 20:23:35,272 INFO L168 Benchmark]: Witness Printer took 67.32 ms. Allocated memory is still 209.7 MB. Free memory was 157.9 MB in the beginning and 146.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 20:23:35,273 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 96.5 MB. Free memory was 72.6 MB in the beginning and 72.5 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 361.87 ms. Allocated memory is still 96.5 MB. Free memory was 54.7 MB in the beginning and 44.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.12 ms. Allocated memory is still 96.5 MB. Free memory was 44.3 MB in the beginning and 73.3 MB in the end (delta: -29.0 MB). Peak memory consumption was 3.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.91 ms. Allocated memory is still 96.5 MB. Free memory was 73.3 MB in the beginning and 71.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1321.37 ms. Allocated memory was 96.5 MB in the beginning and 144.7 MB in the end (delta: 48.2 MB). Free memory was 71.2 MB in the beginning and 69.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 68.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10288.72 ms. Allocated memory was 144.7 MB in the beginning and 209.7 MB in the end (delta: 65.0 MB). Free memory was 69.0 MB in the beginning and 157.9 MB in the end (delta: -88.9 MB). Peak memory consumption was 78.2 MB. Max. memory is 16.1 GB. * Witness Printer took 67.32 ms. Allocated memory is still 209.7 MB. Free memory was 157.9 MB in the beginning and 146.3 MB in the end (delta: 11.5 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 1117 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 150 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.9s, 104 PlacesBefore, 36 PlacesAfterwards, 96 TransitionsBefore, 27 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3750 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2528; [L816] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L817] 0 pthread_t t2529; [L818] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L819] 0 pthread_t t2530; [L820] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, 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] [L793] 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) [L793] 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) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 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 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 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 [L764] 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) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] 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) [L764] 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) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 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 [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 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 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L826] 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) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] 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) [L826] 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) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 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 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 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 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 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) [L837] 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) [L838] 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)) [L838] EXPR 0 !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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] EXPR 0 !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) [L839] 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)) [L839] 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)) [L840] 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)) [L840] EXPR 0 !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) [L840] 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)) [L840] 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)) [L841] 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)) [L841] EXPR 0 !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) [L841] 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)) [L841] 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)) [L842] 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)) [L842] EXPR 0 !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) [L842] 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)) [L842] 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)) [L843] 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)) [L843] EXPR 0 !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) [L843] 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)) [L843] 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)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=0, x=1, 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, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 321 SDtfs, 350 SDslu, 633 SDs, 0 SdLazy, 290 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 46 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 14897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...